Single link algorithm is an example of agglomerative hierarchical clustering method. We recall that is a bottom-up strategy: compare each point with each point. Each object is placed in a separate cluster, and at each step we merge the closest pair of clusters, until certain termination conditions are satisfied. This requires defining a notion of cluster proximity.For the single link, the proximity of two clusters is defined as the minimum of the distance between any two points in the two clusters.
Read Complete Article
No comments:
Post a Comment