The DOI matches its Crossref record.
SLINK: An optimally efficient algorithm for the single-link cluster method
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Ankerst, M. (1999) · doi:10.1145/304181.304187 · Cited by 3,982
Kriegel, H., Kröger, P., Sander, J., & Zimek, A. (2011) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.30 · Cited by 900
Learning Concept Hierarchies from Text Corpora using Formal Concept Analysis
Cimiano, P., Hotho, A., & Staab, S. (2005) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1648 · Cited by 522
Thirty Years of Machine Learning: The Road to Pareto-Optimal Wireless Networks
Wang, J., Jiang, C., Zhang, H., Ren, Y., Chen, K.-C., & Hanzo, L. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.2965856 · Cited by 486
Nielsen, F. (2016) · Undergraduate Topics in Computer Science · doi:10.1007/978-3-319-21903-5_8 · Cited by 494
Metadata
- Authors
- Sibson, R.
- Venue
- The Computer Journal
- Publisher
- Oxford University Press (OUP)
- Published
- 1973-01-01
- Volume
- 16
- Issue
- 1
- Pages
- 30-34
- ISSN
- 0010-4620 (ISSN-L)
- 1460-2067
- OpenAlex
- W2120636855
- Cited by
- 1,203
- References
- 0
- FWCI
- 5.35
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: SLINK: An optimally efficient algorithm for the single-link cluster method. https://app.cochat.ai/papers/10.1093/comjnl/16.1.30
- The paper
- Sibson, R. (1973). SLINK: An optimally efficient algorithm for the single-link cluster method. The Computer Journal. https://doi.org/10.1093/comjnl/16.1.30
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
