vix.ing · top · new · best · stats

SLINK: An optimally efficient algorithm for the single-link cluster method

1973/01/01 by R. Sibson, Robin Sibson · 1,200 citations
Computer Science · Mathematics · Physics and Astronomy · #Advanced Clustering Algorithms Research #Algorithm #Cluster (spacecraft) #Combinatorics #Compact space #Complex Network Analysis Techniques #Computer science #Dendrogram #Diagram #Fortran #Link (geometry) #Mathematics #Programming language #Range (aeronautics) #Representation (politics) #Theoretical and Computational Physics #Theoretical computer science #Tree (set theory)

paper · pdf · doi:10.1093/comjnl/16.1.30

published in The Computer Journal 16(1), 30-34 (Oxford University Press)

openalex publication_date 1973/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/30

Abstract

The SLINK algorithm carries out single-link (nearest-neighbour) cluster analysis on an arbitrary dissimilarity coefficient and provides a representation of the resultant dendrogram which can readily be converted into the usual tree-diagram. The algorithm achieves the theoretical order-of-magnitude bounds for both compactness of storage and speed of operation, and makes the application of the single-link method feasible for a number of OTU's well into the range 103 to 104. The algorithm is easily programmable in a variety of languages including FORTRAN.

Cited by

Related