The DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.
K-Means Clustering Versus Validation Measures: A Data-Distribution Perspective
Abstract
K-means is a well-known and widely used partitional clustering method. While there are considerable research efforts to characterize the key features of the K-means clustering algorithm, further investigation is needed to understand how data distributions can have impact on the performance of K-means clustering. To that end, in this paper, we provide a formal and organized study of the effect of skewed data distributions on K-means clustering. Along this line, we first formally illustrate that K-means tends to produce clusters of relatively uniform size, even if input data have varied "true" cluster sizes. In addition, we show that some clustering validation measures, such as the entropy measure, may not capture this uniform effect and provide misleading information on the clustering performance. Viewed in this light, we provide the coefficient of variation (CV) as a necessary criterion to validate the clustering results. Our findings reveal that K-means tends to produce clusters in which the variations of cluster sizes, as measured by CV, are in a range of about 0.3-1.0. Specifically, for data sets with large variation in "true" cluster sizes (e.g., CV > 1.0), K-means reduces variation in resultant cluster sizes to less than 1.0. In contrast, for data sets with small variation in "true" cluster sizes (e.g., CV < 0.3), K-means increases variation in resultant cluster sizes to greater than 0.3. In other words, for the earlier two cases, K-means produces the clustering results which are away from the "true" cluster distributions.
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
(1967) · Cited by 23,719
(1996) · Cited by 20,179
Jolliffe, I. (2005) · Encyclopedia of Statistics in Behavioral Science · doi:10.1002/0470013192.bsa501 · Cited by 14,310
UCI Repository of machine learning databases
Blake, C. L. (1998) · Medical Entomology and Zoology · Cited by 10,582
An algorithm for suffix stripping
Porter, M. F. (1980) · Program · doi:10.1108/eb046814 · Cited by 8,096
Algorithms for Clustering Data
Sarle, W. S. (1990) · Technometrics · doi:10.1080/00401706.1990.10484648 · Cited by 7,865
(2008) · Data Mining and Market Intelligence for Optimal Marketing Returns · doi:10.4324/9780080878096-12 · Cited by 6,954
LOF: identifying density-based local outliers
Breunig, M. M., Kriegel, H.-P., Ng, R. T., & Sander, J. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335388 · Cited by 5,207
An Introduction to Data Mining
Stephens, C. R., & Sukumar, R. (2006) · The Handbook of Marketing Research · doi:10.4135/9781412973380.n22 · Cited by 4,562
LOF: identifying density-based local outliers
Breunig, M. M., Kriegel, H.-P., Ng, R. T., & Sander, J. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335388 · Cited by 4,149
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
Bhattacharjee, A., Richards, W. G., Staunton, J., Li, C., Monti, S., Vasa, P., Ladd, C., Beheshti, J., Bueno, R., Gillette, M., et al. (2001) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.191502998 · Cited by 2,576
A Comparison of Document Clustering Techniques
Steinbach, M. S., Karypis, G., & Kumar, V. (2000) · Cited by 2,532
Applied Numerical Linear Algebra
Demmel, J. W. (1997) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971446 · Cited by 2,299
Applied numerical linear algebra
(1998) · Choice Reviews Online · doi:10.5860/choice.35-3919 · Cited by 2,170
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
Yeoh, E.-J., Ross, M. E., Shurtleff, S. A., Williams, W. K., Patel, D., Mahfouz, R., Behm, F. G., Raimondi, S. C., Relling, M. V., Patel, A., et al. (2002) · Cancer Cell · doi:10.1016/s1535-6108(02)00032-6 · Cited by 1,917
Introduction to Data Mining, (First Edition)
Tan, P., Steinbach, M. S., & Kumar, V. (2005) · Addison-Wesley Longman Publishing Co., Inc. eBooks · Cited by 1,889
Modern Multidimensional Scaling
Borg, I., & Groenen, P. (1997) · Springer Series in Statistics · doi:10.1007/978-1-4757-2711-1 · Cited by 1,728
Krishna, K., & Narasimha Murty, M. (1999) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/3477.764879 · Cited by 1,717
(2002) · Wiley Series in Probability and Statistics · doi:10.1002/0471271357.ch12 · Cited by 1,656
Distance-based outliers: algorithms and applications
Knorr, E. M., Ng, R. T., & Tucakov, V. (2000) · The VLDB Journal The International Journal on Very Large Data Bases · doi:10.1007/s007780050006 · Cited by 1,195 · cited 2×
“For instance, a simple method [ 35 ] of detecting outliers is based on the distance measure.”
MethodSome 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
Clustering Using a Similarity Measure Based on Shared Near Neighbors
Jarvis, R. A., & Patrick, E. A. (1973) · IEEE Transactions on Computers · doi:10.1109/t-c.1973.223640 · Cited by 955
Fast and effective text mining using linear-time document clustering
Larsen, B., & Aone, C. (1999) · Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/312129.312186 · Cited by 857
Intrusion detection with unlabeled data using clustering
Portnoy, L. (2000) · doi:10.7916/d8mp5904 · Cited by 747
Scaling clustering algorithms to large databases
Bradley, P., Fayyad, U. M., & Reina, C. (1998) · Cited by 716
Empirical and Theoretical Comparisons of Selected Criterion Functions for Document Clustering
Zhao, Y., & Karypis, G. (2004) · Machine Learning · doi:10.1023/b:mach.0000027785.44527.d6 · Cited by 611
Criterion Functions for Document Clustering: Experiments and Analysis
Zhao, Y., & Karypis, G. (2001) · University of Minnesota Digital Conservancy (University of Minnesota) · Cited by 581
Cluster validity methods: part I
Halkidi, M., Batistakis, Y., & Vazirgiannis, M. (2002) · ACM SIGMOD Record · doi:10.1145/565117.565124 · Cited by 534
Modern Multidimensional Scaling
(2005) · Springer Series in Statistics · doi:10.1007/0-387-28981-x · Cited by 432
OHSUMED: An Interactive Retrieval Evaluation and New Large Test Collection for Research
Hersh, W., Buckley, C., Leone, T. J., & Hickam, D. (1994) · SIGIR ’94 · doi:10.1007/978-1-4471-2099-5_20 · Cited by 352
COOLCAT: an entropy-based algorithm for categorical clustering
Barbará, D., Li, Y., & Couto, J. (2002) · Proceedings of the eleventh international conference on Information and knowledge management · doi:10.1145/584792.584888 · Cited by 345
K-means clustering versus validation measures
Xiong, H., Wu, J., & Chen, J. (2006) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1150402.1150503 · Cited by 61
Self-citationRobust clustering by pruning outliers
Zhang, J., & Leung, Y.-W. (2003) · IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) · doi:10.1109/tsmcb.2003.816993 · Cited by 47
Cited by
Comparative Analysis of K-Means and Fuzzy C-Means Algorithms
Ghosh, S., & Kumar, S. (2013) · International Journal of Advanced Computer Science and Applications · doi:10.14569/ijacsa.2013.040406 · Cited by 536
K-means properties on six clustering benchmark datasets
Fränti, P., & Sieranoja, S. (2018) · Applied Intelligence · doi:10.1007/s10489-018-1238-7 · Cited by 518
Understanding and Enhancement of Internal Clustering Validation Measures
Liu, Y., Li, Z., Xiong, H., Gao, X., Wu, J., & Wu, S. (2013) · IEEE Transactions on Cybernetics · doi:10.1109/tsmcb.2012.2220543 · Cited by 315
Self-citation
Metadata
- Authors
- Xiong, H., Wu, J., & Chen, J.
- Venue
- IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)
- Published
- 2009-04
- Volume
- 39
- Issue
- 2
- Pages
- 318-331
- ISSN
- 1083-4419 (ISSN-L)
- OpenAlex
- W2113540758
- Cited by
- 277
- References
- 35
- FWCI
- 13.25
- 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.