Revision as of 04:24, 31 October 2015 edit David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,852 edits fix ← Previous edit		Revision as of 11:13, 14 May 2016 edit undo Fmadd (talk \| contribs) Extended confirmed users 10,468 edits increasing link information, agglomerative vs divisive hierarchical clustering Next edit →
Line 1: In the theory of [[cluster analysis]], the '''nearest-neighbor chain algorithm''' is a method that can be used to perform several types of ~~agglomerative~~ [[agglomerative hierarchical clustering]], using an amount of memory that is linear in the number of points to be clustered and an amount of time linear in the number of distinct distances between pairs of points.<ref name="murtagh-hmds">{{citation \| last = Murtagh \| first = Fionn \| editor1-last = Abello \| editor1-first = James M.

Nearest-neighbor chain algorithm: Difference between revisions