Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
37 views

Amity School of Engineering and Technology Amity University, Uttar Pradesh

1. The document compares four different clustering methods: partitioning methods, hierarchical clustering, fuzzy clustering, and model-based clustering. 2. Partitioning methods classify data into k groups based on characteristics and similarity. Hierarchical clustering groups similar objects into clusters in a bottom-up or top-down approach. Fuzzy clustering assigns data points membership in clusters based on distance to cluster centers. 3. Model-based clustering assumes data is generated from probability distributions with each distribution representing a different cluster. It does not require specifying the number of clusters beforehand.

Uploaded by

buddy
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
37 views

Amity School of Engineering and Technology Amity University, Uttar Pradesh

1. The document compares four different clustering methods: partitioning methods, hierarchical clustering, fuzzy clustering, and model-based clustering. 2. Partitioning methods classify data into k groups based on characteristics and similarity. Hierarchical clustering groups similar objects into clusters in a bottom-up or top-down approach. Fuzzy clustering assigns data points membership in clusters based on distance to cluster centers. 3. Model-based clustering assumes data is generated from probability distributions with each distribution representing a different cluster. It does not require specifying the number of clusters beforehand.

Uploaded by

buddy
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

AMITY SCHOOL OF ENGINEERING AND TECHNOLOGY

AMITY UNIVERSITY, UTTAR PRADESH

MACHINE LEARNING
Comparison Between
Partitioning Methods, Hierarchical Clustering, Fuzzy
Clustering, Model-Based Clustering
VRIDHI GUPTA
A2305218276
Assignment 4
6cse 5 X

Submitted To: Mr Roshan Lal


Partitioning Hierarchical Fuzzy Clustering Model-Based
Topics Methods Clustering Clustering

Approach K-means clustering Agglomerative has The algorithm In the model-based


bottom-up approach minimizes intra- clustering approach,
and divisive has top- cluster variance and the data is a coming
down approach has the same problems from a mixture of
as 'k'-means; the probability
minimum is a local distributions, each of
minimum, and the which represents a
results depend on the different cluster.
initial choice of
weights.

Datasets This method parts the Determine the most Choose a few it is assumed that the
dataset into n prominent vertical clusters. Assign data are generated by
partitions and distance that does coefficients randomly a mixture of
classifies the data into not intersect any of to each data point for probability
k groups. the other clusters. being in the clusters. distributions in which
The optimal number Repeat until the each component
of clusters is equal algorithm has represents a different
to the number of converged. cluster
vertical lines going
through the
horizontal line.

Does not require a-


Advantage Simple to implement No apriori This gives the priori specification of
and can train large information about flexibility to express number of clusters. It
datasets. the number of that data points can can identify noise data
clusters required. belong to more than while clustering.
one cluster.

Disadvant Does not work well Rigid method, once Better results but It requires an
age with different shape splitting is done it takes a greater underlying model
and size of clusters. cannot be undone. number of iterations. for the data, and
the cluster are
heavily dependent
on this
assumption. But it
still lacks software
implementations.
1. Partitioning Methods:

This clustering method classifies the information into multiple


groups based on the characteristics and similarity of the data. It the
data analysts to specify the number of clusters that have been
generated for the clustering methods.

In the partitioning method, when database(D) contains multiple(N)


objects, then the partitioning method constructs user-specified(K)
partitions of the data in which each partition represents a cluster
and a particular region. Many algorithms come under the
partitioning method. Some of the popular ones are K-Mean,
PAM(K-Medoids), CLARA algorithm (Clustering Large
Applications) etc.

2. Hierarchical Clustering:

Hierarchical clustering, also known as hierarchical cluster


analysis, is an algorithm that groups similar objects into groups
called clusters. The endpoint is a set of clusters, where each cluster
is distinct from the other cluster, and the items within each cluster
are broadly like each other.
3. Fuzzy Clustering:
This algorithm works by assigning membership to each data point
corresponding to each cluster centre based on the distance between
the cluster centre and the data point. More the data is near the
cluster centre; more is its membership towards the cluster centre.
Summation of the membership of each data point should be equal
to one. After each iteration, membership and cluster centres are
updated according to the formula.
4. Model-Based Clustering:

Model-based clustering is a practical approach to clustering


analysis. This chapter introduces model-based clustering
algorithms. First, we present an overview of model-based
clustering. Then, we introduce Gaussian mixture models,
model-based agglomerative hierarchical clustering, and the
expectation-maximization (EM) algorithm. Finally, we present
model-based clustering and two model-based clustering
algorithms.

You might also like