0% found this document useful (0 votes)
3 views

Agglomerative Clustering 08122018

Agglomerative clustering is a hierarchical clustering technique that does not require prior knowledge of the number of clusters. It starts with individual data points and recursively merges the closest pairs to form clusters, which can be represented in a dendrogram. The process continues until all points are merged into a single cluster, allowing users to choose the level of clustering that best represents the data.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
3 views

Agglomerative Clustering 08122018

Agglomerative clustering is a hierarchical clustering technique that does not require prior knowledge of the number of clusters. It starts with individual data points and recursively merges the closest pairs to form clusters, which can be represented in a dendrogram. The process continues until all points are merged into a single cluster, allowing users to choose the level of clustering that best represents the data.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 36

Agglomerative Clustering

All the figures are courtesy of intel software


Contents are inspired by ‘Elements of statistical Learning’ , Tibshirani etal.
Agglomerative Clustering

● K-means requires that we know the number of clusters before hand.


● Hierarchical clustering does not require the number of clusters apriori
● Agglomerative clustering is a bottom-up hierarchical clustering technique which results in a dendrogram
Hierarchical Agglomerative Clustering

Income

Age
Hierarchical Agglomerative Clustering

Find closest pair, merge into a cluster

Income

Age
Hierarchical Agglomerative Clustering

Find next closest pair and merge

Income

Age
Hierarchical Agglomerative Clustering

Find next closest pair and merge

Income

Age
Hierarchical Agglomerative Clustering

Income

Age
Hierarchical Agglomerative Clustering

Keep merging closest pairs

Income

Age
Hierarchical Agglomerative Clustering

If the closest pair is two clusters, merge them

Income

Age
Hierarchical Agglomerative Clustering

Keep merging closest pairs and clusters

Income

Age
Hierarchical Agglomerative Clustering

Keep merging closest pairs and clusters

Income

Age
Hierarchical Agglomerative Clustering

Current number of clusters = 6

Income

Age
Hierarchical Agglomerative Clustering

Current number of clusters = 5

Income

Age
Hierarchical Agglomerative Clustering

Current number of clusters = 4

Income

Age
Hierarchical Agglomerative Clustering

Current number of clusters = 3

Income

Age
Hierarchical Agglomerative Clustering

Current number of clusters = 2

Income

Age
Hierarchical Agglomerative Clustering

Current number of clusters = 1

Income

Age
Hierarchical Agglomerative Clustering

Current number of clusters = 1

Income

Age
Hierarchical Agglomerative Clustering

Current number of clusters = 5

Income

Age
Hierarchical Agglomerative Clustering

Current number of clusters = 5

distance
Cluster
Hierarchical Agglomerative Clustering

Current number of clusters = 4

Income

Age
Hierarchical Agglomerative Clustering

Current number of clusters = 4

distance
Cluster
Hierarchical Agglomerative Clustering

Current number of clusters = 3

Income

Age
Hierarchical Agglomerative Clustering

Current number of clusters = 3

distance
Cluster
Hierarchical Agglomerative Clustering

Current number of clusters = 2

Income

Age
Hierarchical Agglomerative Clustering

Current number of clusters = 2

distance
Cluster
Hierarchical Linkage Types

Single linkage: minimum pairwise distance between


clusters

Income

Age
Hierarchical Linkage Types

Single linkage: minimum pairwise distance between


clusters

Income

Age
Hierarchical Linkage Types

Complete linkage: maximum pairwise distance between


clusters

Income

Age
Hierarchical Linkage Types

Complete linkage: maximum pairwise distance between


clusters

Income

Age
Hierarchical Linkage Types

Average linkage: average pairwise distance between


clusters

Income

Age
Hierarchical Linkage Types

Average linkage: average pairwise distance between


clusters

Income

Age
Hierarchical Linkage Types

Ward linkage: merge based on best inertia

Income

Age
Hierarchical Linkage Types

Ward linkage: merge based on best inertia

Income

Age
Agglormerative Clustering

● Start the bottom i.e. individual data points and recursively merge a selected pair producing a grouping at
the next higher level.
● The chosen cluster has the smallest dissimilarity measure.
● We will have N-1 levels and the user can decide the level at which there appears to be a natural
clustering of data.
● The recursive grouping can be represented by a binary tree with nodes representing the cluster and the
root node represents the entire data
● The data points in each node are more similar to each other than to data points in other nodes at the
same level.
Agglomerative Clustering - Summary

● Initialize each data point as a cluster


● Merge the two closest clusters (first iteration, these will be just two data points)
● Loop till you get one cluster

distance
Cluster

You might also like