Package smile.clustering.linkage
Class SingleLinkage
- java.lang.Object
-
- smile.clustering.linkage.Linkage
-
- smile.clustering.linkage.SingleLinkage
-
public class SingleLinkage extends Linkage
Single linkage. The distance between groups is defined as the distance between the closest pair of objects, one from each group. A drawback of this method is the so-called chaining phenomenon: clusters 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.Single linkage clustering is essentially the same as Kruskal's algorithm for minimum spanning trees. However, in single linkage clustering, the order in which clusters are formed is important, while for minimum spanning trees what matters is the set of pairs of points that form distances chosen by the algorithm.
- Author:
- Haifeng Li
-
-
Constructor Summary
Constructors Constructor Description SingleLinkage(double[][] proximity)
Constructor.
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description void
merge(int i, int j)
Merge two clusters into one and update the proximity matrix.java.lang.String
toString()
-