Why so many clustering algorithms: a position paper
The DOI matches its Crossref record; 52 of the 52 references it cites were found in a registry or an index.
Abstract
We argue that there are many clustering algorithms, because the notion of "cluster" cannot be precisely defined. Clustering is in the eye of the beholder, and as such, researchers have proposed many induction principles and models whose corresponding optimization problem can only be approximately solved by an even larger number of algorithms. Therefore, comparing clustering algorithms, must take into account a careful understanding of the inductive principles involved.
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
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
(1979) · Cited by 43,841
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
(1967) · Cited by 23,719
(1996) · Cited by 20,179
Jain, A. K., Murty, M. N., & Flynn, P. J. (1999) · ACM Computing Surveys · doi:10.1145/331499.331504 · Cited by 13,199
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
Finding groups in data: an introduction to cluster analysis
(1991) · Choice Reviews Online · doi:10.5860/choice.28-4558 · Cited by 10,474
Pattern Recognition with Fuzzy Objective Function Algorithms
Bezdek, J. C. (1981) · doi:10.1007/978-1-4757-0450-1 · Cited by 9,881
Cited by
A Comprehensive Survey of Clustering Algorithms
Xu, D., & Tian, Y. (2015) · Annals of Data Science · doi:10.1007/s40745-015-0040-1 · Cited by 1,939
Big IoT data analytics: Architecture, opportunities, and open research challenges
(2017) · IEEE Access · doi:10.1109/access.2017.2689040 · Cited by 980
“For example, Bayesian network, Classification is a supervised learning approach that uses prior knowledge as training data to classify data objects into groups [46].”
BackgroundComputational cluster validation in post-genomic data analysis
Handl, J., Knowles, J., & Kell, D. B. (2005) · Bioinformatics · doi:10.1093/bioinformatics/bti517 · Cited by 898
On the evaluation of unsupervised outlier detection: measures, datasets, and an empirical study
Campos, G. O., Zimek, A., Sander, J., Campello, R. J. G. B., Micenková, B., Schubert, E., Assent, I., & Houle, M. E. (2016) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-015-0444-8 · Cited by 735
An Evolutionary Approach to Multiobjective Clustering
Handl, J., & Knowles, J. (2007) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2006.877146 · Cited by 717
Deep learning and artificial intelligence methods for Raman and surface-enhanced Raman scattering
Lussier, F., Thibault, V., Charron, B., Wallace, G. Q., & Masson, J.-F. (2020) · TrAC Trends in Analytical Chemistry · doi:10.1016/j.trac.2019.115796 · Cited by 666
Selection of K in K-means clustering
Pham, D. T., Dimov, S. S., & Nguyen, C. D. (2005) · Proceedings of the Institution of Mechanical Engineers, Part C: Journal of Mechanical Engineering Science · doi:10.1243/095440605x8298 · Cited by 597
A survey of Web clustering engines
Carpineto, C., Osiński, S., Romano, G., & Weiss, D. (2009) · ACM Computing Surveys · doi:10.1145/1541880.1541884 · Cited by 399
Web Usage Mining as a Tool for Personalization: A Survey
Pierrakos, D., Paliouras, G., Papatheodorou, C., & Spyropoulos, C. D. (2003) · User Modeling and User-Adapted Interaction · doi:10.1023/a:1026238916441 · Cited by 348
RapidMiner: Data Mining Use Cases and Business Analytics Applications
(2016) · Chapman & Hall/CRC eBooks · doi:10.1201/b16023 · Cited by 314
A comprehensive evaluation of module detection methods for gene expression data
Saelens, W., Cannoodt, R., & Saeys, Y. (2018) · Nature Communications · doi:10.1038/s41467-018-03424-4 · Cited by 311
Deep learning-based clustering approaches for bioinformatics
Karim, M. R., Beyan, O., Zappa, A., Costa, I. G., Rebholz-Schuhmann, D., Cochez, M., & Decker, S. (2021) · Briefings in Bioinformatics · doi:10.1093/bib/bbz170 · Cited by 297
Privacy-Preserving Data Mining: Methods, Metrics, and Applications
Mendes, R., & Vilela, J. P. (2017) · IEEE Access · doi:10.1109/access.2017.2706947 · Cited by 294
Shastri, A., Valecha, N., Bashirov, E., Tataria, H., Lentmaier, M., Tufvesson, F., Rossi, M., & Casari, P. (2022) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2022.3177305 · Cited by 165
“More on the existing clustering models and algorithms, their categorization and discussion can be found in [220].”
Method
Metadata
- Authors
- Estivill-Castro, V.
- Venue
- ACM SIGKDD Explorations Newsletter
- Published
- 2002-06
- Volume
- 4
- Issue
- 1
- Pages
- 65-75
- ISSN
- 1931-0145 (ISSN-L)
- 1931-0153
- OpenAlex
- W2054274648
- Cited by
- 600
- References
- 52
- FWCI
- 12.38
- 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.