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.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Algorithms for Clustering Data
Sarle, W. S. (1990) · Technometrics · doi:10.1080/00401706.1990.10484648 · Cited by 7,865
Ankerst, M. (1999) · doi:10.1145/304181.304187 · Cited by 3,982
A Survey of Clustering Data Mining Techniques
Berkhin, P. (2006) · Grouping Multidimensional Data · doi:10.1007/3-540-28349-8_2 · Cited by 2,804
Algorithms for hierarchical clustering: an overview
Murtagh, F., & Contreras, P. (2012) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.53 · Cited by 1,874
Density-Based Clustering in Spatial Databases: The Algorithm GDBSCAN and Its Applications
Sander, J., Ester, M., Kriegel, H.-P., & Xu, X. (1998) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009745219419 · Cited by 1,495
Scatter/Gather: A Cluster-based Approach to Browsing Large Document Collections
Cutting, D. R., Karger, D. R., Pedersen, J. O., & Tukey, J. W. (2017) · ACM SIGIR Forum · doi:10.1145/3130348.3130362 · Cited by 1,419
A Robust Fuzzy Local Information C-Means Clustering Algorithm
Krinidis, S., & Chatzis, V. (2010) · IEEE Transactions on Image Processing · doi:10.1109/tip.2010.2040763 · Cited by 1,124
A Survey of Recent Advances in Hierarchical Clustering Algorithms
Murtagh, F. (1983) · The Computer Journal · doi:10.1093/comjnl/26.4.354 · Cited by 1,058
Hand, D. J. (2007) · Drug Safety · doi:10.2165/00002018-200730070-00010 · Cited by 1,044
Efficient algorithms for agglomerative hierarchical clustering methods
Day, W. H. E., & Edelsbrunner, H. (1984) · Journal of Classification · doi:10.1007/bf01890115 · Cited by 971
Ezugwu, A. E., Ikotun, A. M., Oyelade, O. O., Abualigah, L., Agushaka, J. O., Eke, C. I., & Akinyelu, A. A. (2022) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2022.104743 · Cited by 924
Kriegel, H., Kröger, P., Sander, J., & Zimek, A. (2011) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.30 · Cited by 900
State-of-the-art in privacy preserving data mining
Verykios, V. S., Bertino, E., Fovino, I. N., Provenza, L. P., Saygin, Y., & Theodoridis, Y. (2004) · ACM SIGMOD Record · doi:10.1145/974121.974131 · Cited by 816
On the History of the Minimum Spanning Tree Problem
Graham, R. L., & Hell, P. (1985) · IEEE Annals of the History of Computing · doi:10.1109/mahc.1985.10011 · Cited by 813
Recent trends in hierarchic document clustering: A critical review
Willett, P. (1988) · Information Processing & Management · doi:10.1016/0306-4573(88)90027-1 · Cited by 705
fastcluster: Fast Hierarchical, Agglomerative Clustering Routines for R and Python
Müllner, D. (2013) · Journal of Statistical Software · doi:10.18637/jss.v053.i09 · Cited by 605
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
Accelerated Hierarchical Density Based Clustering
McInnes, L., & Healy, J. (2017) · 2017 IEEE International Conference on Data Mining Workshops (ICDMW) · doi:10.1109/icdmw.2017.12 · Cited by 434
Nielsen, F. (2016) · Undergraduate Topics in Computer Science · doi:10.1007/978-3-319-21903-5_8 · Cited by 494
The Representation of Biological Classes in the Human Brain
Connolly, A. C., Guntupalli, J. S., Gors, J., Hanke, M., Halchenko, Y. O., Wu, Y.-C., Abdi, H., & Haxby, J. V. (2012) · The Journal of Neuroscience · doi:10.1523/jneurosci.5547-11.2012 · Cited by 410
Parallel algorithms for hierarchical clustering
Olson, C. F. (1995) · Parallel Computing · doi:10.1016/0167-8191(95)00017-i · Cited by 404
The Application of Deep Learning in Cancer Prognosis Prediction
Zhu, W., Xie, L., Han, J., & Guo, X. (2020) · Cancers · doi:10.3390/cancers12030603 · Cited by 380
A Review of Hierarchical Classification
Gordon, A. D. (1987) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2981629 · Cited by 380
An efficient enhanced k-means clustering algorithm
Fahim, A. M., Salem, A. M., Torkey, F. A., & Ramadan, M. A. (2006) · Journal of Zhejiang University-SCIENCE A · doi:10.1631/jzus.2006.a1626 · Cited by 342
Structure of the Zebrafish Locomotor Repertoire Revealed with Unsupervised Behavioral Clustering
Marques, J. C., Lackner, S., Félix, R., & Orger, M. B. (2018) · Current Biology · doi:10.1016/j.cub.2017.12.002 · Cited by 245
WebFace260M: A Benchmark Unveiling the Power of Million-Scale Deep Face Recognition
Zhu, Z., Huang, G., Deng, J., Ye, Y., Huang, J., Chen, X., Zhu, J., Yang, T., Lu, J., Du, D., et al. (2021) · 2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr46437.2021.01035 · Cited by 290
Clustering Methodologies in Exploratory Data Analysis
Dubes, R., & Jain, A. K. (1980) · Advances in Computers · doi:10.1016/s0065-2458(08)60034-0 · Cited by 286
Algorithms for hierarchical clustering: an overview,II
Murtagh, F., & Contreras, P. (2017) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1219 · Cited by 285
Internal state dynamics shape brainwide activity and foraging behaviour
Marques, J. C., Li, M., Schaak, D., Robson, D. N., & Li, J. M. (2020) · Nature · doi:10.1038/s41586-019-1858-z · Cited by 243
Toward Privacy in Public Databases
Chawla, S., Dwork, C., McSherry, F., Smith, A., & Wee, H. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30576-7_20 · Cited by 264
Business Intelligence for Enterprise Systems: A Survey
Duan, L., & Xu, L. D. (2012) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2012.2188804 · Cited by 254
Learning to cluster faces on an affinity graph
Yang, L., Zhan, X., Chen, D., Yan, J., Loy, C. C., & Lin, D. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2019.00240 · Cited by 142
Li, S., Laima, S., & Li, H. (2017) · Engineering Structures · doi:10.1016/j.engstruct.2017.02.024 · Cited by 96
Loop closure detection in SLAM by combining visual and spatial appearance
Ho, K. L., & Newman, P. (2006) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2006.04.016 · Cited by 93
Multiscale PHATE identifies multimodal signatures of COVID-19
Kuchroo, M., Huang, J., Wong, P., Grenier, J.-C., Shung, D., Tong, A., Lucas, C., Klein, J., Burkhardt, D. B., Gigante, S., et al. (2022) · Nature Biotechnology · doi:10.1038/s41587-021-01186-x · Cited by 72
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
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.