The DOI matches its Crossref record; 52 of the 52 references it cites were found in a registry or an index.
Why so many clustering algorithms: a position paper
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
Everitt, B. J., Landau, S., & Leese, M. (1974) · Cited by 9,358
Algorithms for Clustering Data
Sarle, W. S. (1990) · Technometrics · doi:10.1080/00401706.1990.10484648 · Cited by 7,865
Finding Groups in Data: An Introduction to Cluster Analysis
Kaufman, L., & Rousseeuw, P. J. (1990) · Wiley Series in Probability and Statistics · doi:10.1002/9780470316801 · Cited by 7,344
Algorithms for clustering data
Flury, B. (1989) · Journal of Statistical Planning and Inference · doi:10.1016/0378-3758(89)90033-5 · Cited by 6,432
Robust Regression and Outlier Detection
Piepel, G. F. (1989) · Technometrics · doi:10.1080/00401706.1989.10488524 · Cited by 6,144
Robust Regression and Outlier Detection
Rousseeuw, P. J., & Leroy, A. M. (1987) · Wiley Series in Probability and Statistics · doi:10.1002/0471725382 · Cited by 5,609
Data mining: practical machine learning tools and techniques with Java implementations
Witten, I. H., & Frank, E. (2002) · ACM SIGMOD Record · doi:10.1145/507338.507355 · Cited by 5,137
Pattern Classification and Scene Analysis
Thompson, M., Duda, R. O., & Hart, P. E. (1974) · Leonardo · doi:10.2307/1573081 · Cited by 4,495
Data Mining: Concepts and Techniques
Thamaraiselvi, G., & Kaliammal, A. (2014) · Journal of Information and Knowledge · Cited by 4,088
BIRCH: an efficient data clustering method for very large databases
Zhang, T., Ramakrishnan, R., & Livny, M. (1996) · Proceedings of the 1996 ACM SIGMOD international conference on Management of data - SIGMOD '96 · doi:10.1145/233269.233324 · Cited by 3,935
Statistical Analysis of Finite Mixture Distributions.
Lindsay, B. G., Titterington, D. M., Smith, A. F. M., & Makov, U. E. (1987) · Journal of the American Statistical Association · doi:10.2307/2289504 · Cited by 2,905
On Clustering Validation Techniques
Halkidi, M., Batistakis, Y., & Vazirgiannis, M. (2001) · Journal of Intelligent Information Systems · doi:10.1023/a:1012801612483 · Cited by 2,646
Well-Separated Clusters and Optimal Fuzzy Partitions
Dunn†, J. C. (1974) · Journal of Cybernetics · doi:10.1080/01969727408546059 · Cited by 2,510
Aldenderfer, M. S. (1984) · Cited by 2,502
Aldenderfer, M., & Blashfield, R. (1984) · Sage eBooks · doi:10.4135/9781412983648 · Cited by 2,137
BIRCH: an efficient data clustering method for very large databases
Zhang, T., Ramakrishnan, R., & Livny, M. (1996) · ACM SIGMOD Record · doi:10.1145/235968.233324 · Cited by 2,097
Chameleon: hierarchical clustering using dynamic modeling
Karypis, G., Han, E.-H., & Kumar, V. (1999) · Computer · doi:10.1109/2.781637 · Cited by 2,097
Introduction to Robust Estimation and Hypothesis Testing
(2012) · Elsevier eBooks · doi:10.1016/c2010-0-67044-1 · Cited by 2,055
Statistical Analysis of Finite Mixture Distributions.
Newton, J., Titterington, D. M., Smith, A. F. M., & Makov, U. E. (1986) · Biometrics · doi:10.2307/2531224 · Cited by 1,986
CURE: an efficient clustering algorithm for large databases
Guha, S., Rastogi, R., & Shim, K. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276312 · Cited by 1,907
On cluster validity for the fuzzy c-means model
Pal, N. R., & Bezdek, J. C. (1995) · IEEE Transactions on Fuzzy Systems · doi:10.1109/91.413225 · Cited by 1,850
Efficient and Effective Clustering Methods for Spatial Data Mining
Ng, R. T., & Han, J. (1994) · Cited by 1,778
An efficient approach to clustering in large multimedia databases with noise
Hinneburg, A., & Keim, D. A. (1998) · KOPS (University of Konstanz) · Cited by 1,181
Some new indexes of cluster validity
Bezdek, J. C., & Pal, N. R. (1998) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/3477.678624 · Cited by 1,132
Web document clustering: a feasibility demonstration
Zamir, O., & Etzioni, O. (1998) · Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/290941.290956 · Cited by 1,055
An Information Measure for Classification
Wallace, C. S., & Boulton, D. M. (1968) · The Computer Journal · doi:10.1093/comjnl/11.2.185 · Cited by 933
Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
Teitz, M. B., & Bart, P. (1968) · Operations Research · doi:10.1287/opre.16.5.955 · Cited by 787
Ray, S., & Turi, R. H. (2000) · International Conference on Advances in Pattern Recognition · Cited by 728
CURE: an efficient clustering algorithm for large databases
Guha, S., Rastogi, R., & Shim, K. (1998) · ACM SIGMOD Record · doi:10.1145/276305.276312 · Cited by 669
Tools for Statistical Inference
Rukhin, A. L. (1997) · Technometrics · doi:10.1080/00401706.1997.10485139 · Cited by 659
Data mining and knowledge discovery in databases
Fayyad, U., & Uthurusamy, R. (1996) · Communications of the ACM · doi:10.1145/240455.240463 · Cited by 590
Introduction to Robust Estimation and Hypothesis Testing
Stahel, W., & Wilcox, R. R. (1998) · Journal of the American Statistical Association · doi:10.2307/2669876 · Cited by 421
Clustering with a genetically optimized approach
Hall, L. O., Ozyurt, I. B., & Bezdek, J. C. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.771164 · Cited by 409
Rissanen, J. (1987) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1987.tb01694.x · Cited by 339
Kuhn, H. W. (1973) · Mathematical Programming · doi:10.1007/bf01584648 · Cited by 329
Quality Scheme Assessment in the Clustering Process
Halkidi, M., Vazirgiannis, M., & Batistakis, Y. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45372-5_26 · Cited by 305
On the Complexity of Clustering Problems
Brucker, P. (1978) · Lecture Notes in Economics and Mathematical Systems · doi:10.1007/978-3-642-95322-4_5 · Cited by 266
Bonner, R. E. (1964) · IBM Journal of Research and Development · doi:10.1147/rd.81.0022 · Cited by 209
Discovering associations in spatial data — An efficient medoid based approach
Estivill‐Castro, V., & Murray, A. T. (1998) · Lecture notes in computer science · doi:10.1007/3-540-64383-4_10 · Cited by 74
Self-citationRobust Distance-Based Clustering with Applications to Spatial Data Mining
Estivill‐Castro, V., & Houle, M. E. (2001) · Algorithmica · doi:10.1007/s00453-001-0010-1 · Cited by 43
Self-citationProving geometric algorithm non-solvability: An application of factoring polynomials
Bajaj, C. (1986) · Journal of Symbolic Computation · doi:10.1016/s0747-7171(86)80015-3 · Cited by 34
A human-computer cooperative system for effective high dimensional clustering
Aggarwal, C. C. (2001) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/502512.502542 · Cited by 29
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
Computational 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
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.