Revision as of 13:32, 14 September 2011 edit Matus Telgarsky (talk \| contribs) 3 edits m english was terrible ← Previous edit		Revision as of 14:12, 14 September 2011 edit undo Matus Telgarsky (talk \| contribs) 3 edits m changed the width field on the image to reflect the new version's size. Next edit →
Line 67: ==The algorithm== [[File:Nearest-neighbor chain algorithm animated.gif\|frame\|~~323px~~300px\|alt=Animated execution of Nearest-neighbor chain algorithm\|Animation of the algorithm using Ward's distance. Black dots are points, grey regions are larger clusters, blue arrows point to nearest neighbors, and the red bar indicates the current chain. For visual simplicity, when a merge leaves the chain empty, it continues with the recently merged cluster.]] Intuitively, the nearest neighbor chain algorithm repeatedly follows a chain of clusters {{math\|''A'' → ''B'' → ''C'' → ...}} where each cluster is the [[nearest neighbor]] of the previous one, until reaching a pair of clusters that are mutual nearest neighbors.<ref name="murtagh-tcj">{{citation \| last = Murtagh \| first = Fionn

Nearest-neighbor chain algorithm: Difference between revisions