Revision as of 06:09, 16 May 2022 edit Bruce1ee (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers, Rollbackers 302,074 edits m fixed lint errors – file options; size is ignored when using frame ← Previous edit		Revision as of 00:58, 27 January 2023 edit undo Citation bot (talk \| contribs) Bots 5,872,172 edits Add: s2cid, doi. \| Use this bot. Report bugs. \| Suggested by Whoop whoop pull up \| Linked from User:David_Eppstein \| #UCB_webform_linked 59/118 Next edit →
Line 42: \| url = http://www.jea.acm.org/2000/EppsteinDynamic/ \| volume = 5 \| year = 2000\| doi = 10.1145/351827.351829 \| bibcode = 1999cs.......12014E \| s2cid = 1357701 }}.</ref><ref name="day-edels">{{citation \| last1 = Day \| first1 = William H. E. \| last2 = Edelsbrunner \| first2 = Herbert \| author2-link = Herbert Edelsbrunner Line 52: \| url = http://www.cs.duke.edu/~edels/Papers/1984-J-05-HierarchicalClustering.pdf \| volume = 1 \| year = 1984\| s2cid = 121201396 ~~\| year = 1984~~}}.</ref> The nearest-neighbor chain algorithm uses a smaller amount of time and space than the greedy algorithm by merging pairs of clusters in a different order. In this way, it avoids the problem of repeatedly finding closest pairs. Nevertheless, for many types of clustering problem, it can be guaranteed to come up with the same hierarchical clustering as the greedy algorithm despite the different merge order.<ref name="murtagh-tcj"/> ==The algorithm==

Nearest-neighbor chain algorithm: Difference between revisions