In the theory of cluster analysis, the nearest-neighbor chain algorithm is an algorithm that can be used to perform several types of agglomerative hierarchical clustering, in which a hierarchy of clusters is created by repeatedly merging pairs of smaller clusters to form larger clusters.
In the theory of cluster analysis, the nearest-neighbor chain algorithm is an algorithm that can speed up several methods for agglomerative hierarchical clustering. These are methods that take a collection of points as input, and create a hierarchy of clusters of points by repeatedly merging pairs of smaller clusters to form larger clusters.