A survey of Clustering Algorithms
The DOI matches its Crossref record; 67 of the 67 references it cites were found in a registry or an index.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“K-medoids clustering [91] is a variant of K-means that is more robust to noises and outliers.”
From Machine learning: Algorithms, real-world applications and research directions (2021) · cites this paper as [91]
Citations
Cites
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
Hierarchical Grouping to Optimize an Objective Function
Ward, J. H. (1963) · Journal of the American Statistical Association · doi:10.1080/01621459.1963.10500845 · Cited by 20,598
(1996) · Cited by 20,179
(2012) · Encyclopedia of the Sciences of Learning · doi:10.1007/978-1-4419-1428-6_5195 · Cited by 19,370
Jain, A. K., Murty, M. N., & Flynn, P. J. (1999) · ACM Computing Surveys · doi:10.1145/331499.331504 · Cited by 13,199
Everitt, B. J., Landau, S., & Leese, M. (1974) · Cited by 9,358
Witten, I. H. (2008) · Cited by 9,143
Hubert, L., & Arabie, P. (1985) · Journal of Classification · doi:10.1007/bf01908075 · Cited by 8,219
Objective Criteria for the Evaluation of Clustering Methods
Rand, W. M. (1971) · Journal of the American Statistical Association · doi:10.1080/01621459.1971.10482356 · Cited by 6,566
Research works printed but not linked: 6
- Averbuch, M. and Karson, T. and Ben-Ami, B. and Maimon, O. and Rokach, L., Contextsensitive medical information retrieval, The 11th World Congress on Medical Informatics (MEDINFO 2004), San Francisco, CA, September 2004, IOS Press, pp. 282–286.
- Fortier, J.J. and Solomon, H. 1996. Clustering procedures. In proceedings of the Multivariate Analysis, ’66, P.R. Krishnaiah (Ed.), pp. 493-506.
- Hoppner F. , Klawonn F., Kruse R., Runkler T., Fuzzy Cluster Analysis, Wiley, 2000.
- Ng, R. and Han, J. 1994. Very large data bases. In Proceedings of the 20th International Conference on Very Large Data Bases (VLDB94, Santiago, Chile, Sept.), VLDB Endowment, Berkeley, CA, 144155.
- Strehl A. and Ghosh J., Clustering Guidance and Quality Evaluation Using Relationship-based Visualization, Proceedings of Intelligent Engineering Systems Through Artificial Neural Networks, 2000, St. Louis, Missouri, USA, pp 483-488.
- Wallace C. S. and Dowe D. L., Intrinsic classification by mml – the snob program. In Proceedings of the 7th Australian Joint Conference on Artificial Intelligence, pages 37-44, 1994.
Cited by
Machine learning: Algorithms, real-world applications and research directions
Sarker, I. H. (2021) · SN Computer Science · doi:10.1007/s42979-021-00592-x · Cited by 5,583
Cybersecurity data science: an overview from machine learning perspective
Sarker, I. H., Kayes, A. S. M., Badsha, S., Alqahtani, H., Watters, P., & Ng, A. (2020) · Journal of Big Data · doi:10.1186/s40537-020-00318-5 · Cited by 766
“K-means [141], K-medoids [142] are the popular partitioning clustering algorithms, and single linkage [143] or complete linkage [144] are the well-known hierarchical clustering algorithms used in various application domains.”
MethodSarker, I. H. (2021) · SN Computer Science · doi:10.1007/s42979-021-00765-8 · Cited by 570
“Many clustering algorithms with the ability to group data have been proposed in machine learning and data science literature [141] [98] [138].”
AI-Driven Cybersecurity: An Overview, Security Intelligence Modeling and Research Directions
Sarker, I. H., Furhad, M. H., & Nowrozy, R. (2021) · SN Computer Science · doi:10.1007/s42979-021-00557-0 · Cited by 543
AI-Driven Cybersecurity: An Overview, Security Intelligence Modeling and Research Directions
Sarker, I. H. (2021) · doi:10.20944/preprints202101.0457.v1 · Cited by 550
Metadata
- Authors
- Rokach, L.
- Affiliations
- Ben-Gurion University of the Negev (IL)
- Corresponding author
- Rokach, Lior
- ORCID
- Rokach, Lior
- Venue
- Data Mining and Knowledge Discovery Handbook
- Publisher
- Springer US
- Published
- 2009
- Pages
- 269-298
- OpenAlex
- W1629143244
- Cited by
- 245
- References
- 67
- Citations by year
- 2026: 3 · 2025: 11 · 2024: 7 · 2023: 15 · 2022: 23 · 2021: 35 · 2020: 20 · 2019: 18 · 2018: 18 · 2017: 14 · 2016: 26 · 2015: 17 · 2014: 19 · 2013: 6 · 2012: 7
- FWCI
- 6.47
- Type
- book chapter
- Language
- en
- Open access
- closed
- Locations
- Springer eBooks (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Advanced Clustering Algorithms Research
- Physical Sciences › Computer Science › Information Systems › Data Mining and Machine Learning Applications
- Physical Sciences › Computer Science › Artificial Intelligence › Bayesian Methods and Mixture Models
- Keywords
- clustering algorithms, data mining, similarity measures, hierarchical clustering, partitional clustering, density-based clustering, model-based clustering, grid-based clustering, soft computing, large data sets, number of clusters determination
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: A survey of Clustering Algorithms. https://app.cochat.ai/papers/10.1007/978-0-387-09823-4_14
- The paper
- Rokach, L. (2009). A survey of Clustering Algorithms. Data Mining and Knowledge Discovery Handbook. https://doi.org/10.1007/978-0-387-09823-4_14
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.