Complete-Linkage Clustering Algorithm
(Redirected from complete-linkage clustering)
Jump to navigation
Jump to search
A Complete-Linkage Clustering Algorithm is a bottom-up hierarchical clustering algorithm that ...
- …
- Counter-Example(s):
- See: Dendrogram.
References
2015
- (Wikipedia, 2015) ⇒ http://en.wikipedia.org/wiki/Complete-linkage_clustering Retrieved:2015-1-16.
- Complete-linkage clustering is one of several methods of agglomerative hierarchical clustering. At the beginning of the process, each element is in a cluster of its own. The clusters are then sequentially combined into larger clusters until all elements end up being in the same cluster. At each step, the two clusters separated by the shortest distance are combined. The definition of 'shortest distance' is what differentiates between the different agglomerative clustering methods. In complete-linkage clustering, the link between two clusters contains all element pairs, and the distance between clusters equals the distance between those two elements (one in each cluster) that are farthest away from each other. The shortest of these links that remains at any step causes the fusion of the two clusters whose elements are involved. The method is also known as farthest neighbour clustering. The result of the clustering can be visualized as a dendrogram, which shows the sequence of cluster fusion and the distance at which each fusion took place. [1] Mathematically, the complete linkage function — the distance [math]\displaystyle{ D(X,Y) }[/math] between clusters [math]\displaystyle{ X }[/math] and [math]\displaystyle{ Y }[/math] — is described by the following expression : [math]\displaystyle{ D(X,Y)= \max_{x\in X, y\in Y} d(x,y) }[/math] where * [math]\displaystyle{ d(x,y) }[/math] is the distance between elements [math]\displaystyle{ x \in X }[/math] and [math]\displaystyle{ y \in Y }[/math] ;
- [math]\displaystyle{ X }[/math] and [math]\displaystyle{ Y }[/math] are two sets of elements (clusters)
- Complete linkage clustering avoids a drawback of the alternative single linkage method - the so-called chaining phenomenon, where clusters formed via single linkage clustering may be forced together due to single elements being close to each other, even though many of the elements in each cluster may be very distant to each other. Complete linkage tends to find compact clusters of approximately equal diameters. [2]
- Complete-linkage clustering is one of several methods of agglomerative hierarchical clustering. At the beginning of the process, each element is in a cluster of its own. The clusters are then sequentially combined into larger clusters until all elements end up being in the same cluster. At each step, the two clusters separated by the shortest distance are combined. The definition of 'shortest distance' is what differentiates between the different agglomerative clustering methods. In complete-linkage clustering, the link between two clusters contains all element pairs, and the distance between clusters equals the distance between those two elements (one in each cluster) that are farthest away from each other. The shortest of these links that remains at any step causes the fusion of the two clusters whose elements are involved. The method is also known as farthest neighbour clustering. The result of the clustering can be visualized as a dendrogram, which shows the sequence of cluster fusion and the distance at which each fusion took place. [1] Mathematically, the complete linkage function — the distance [math]\displaystyle{ D(X,Y) }[/math] between clusters [math]\displaystyle{ X }[/math] and [math]\displaystyle{ Y }[/math] — is described by the following expression : [math]\displaystyle{ D(X,Y)= \max_{x\in X, y\in Y} d(x,y) }[/math] where * [math]\displaystyle{ d(x,y) }[/math] is the distance between elements [math]\displaystyle{ x \in X }[/math] and [math]\displaystyle{ y \in Y }[/math] ;