Nearest-neighbor chain algorithm: Difference between revisions

Revision as of 13:29, 14 September 2011

Revision as of 13:32, 14 September 2011

Line 189:

| title=Modern hierarchical, agglomerative clustering algorithms

| class=stat.ML

| year=2011 }}.</ref> Following the earlier discussion of the value of defining cluster distances recursively, and(so that memoizingmemoization earliercan distancebe computationsused

into order togreatly speed up overall distance computations), care must be taken with suchrecursively definitionsdefined distances so that they are not using the hierarchy in a way which is sensitive to merge order.

sensitive to merge order.

==References==