The DOI matches its Crossref record; 54 of the 54 references it cites were found in a registry or an index.
K-means properties on six clustering benchmark datasets
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Least squares quantization in PCM
Lloyd, S. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056489 · Cited by 15,836
Algorithm AS 136: A K-Means Clustering Algorithm
Hartigan, J. A., & Wong, M. A. (1979) · Applied Statistics · doi:10.2307/2346830 · Cited by 14,523
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
An index to quantify an individual’s scientific research output
Hirsch, J. E. (2005) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0507655102 · Cited by 11,669
Data clustering: 50 years beyond K-means
Jain, A. K. (2010) · Pattern Recognition Letters · doi:10.1016/j.patrec.2009.09.011 · Cited by 9,368
(2007) · doi:10.5555/1283383.1283494 · Cited by 7,364
Pattern classification and scene analysis
Chien, Y. (1974) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1974.1100577 · Cited by 3,398
Adaptive Control Processes: A Guided Tour
Bellman, R. E. (1961) · doi:10.1515/9781400874668 · Cited by 2,802
When Is ''Nearest Neighbor'' Meaningful?
Beyer, K., Goldstein, J., Ramakrishnan, R., & Shaft, U. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-49257-7_15 · Cited by 2,403
X-means: Extending K-means with Efficient Estimation of the Number of Clusters
Pelleg, D., & Moore, A. (2000) · Cited by 2,245
Adaptive Control Processes: A Guided Tour.
Page, E. S., & Bellman, R. (1962) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2343225 · Cited by 2,185
Cluster analysis of multivariate data : efficiency versus interpretability of classifications
Forgy, E. W. (1965) · Biometrics · Cited by 2,093
On the Surprising Behavior of Distance Metrics in High Dimensional Space
Aggarwal, C. C., Hinneburg, A., & Keim, D. A. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44503-x_27 · Cited by 2,083
Clustering to minimize the maximum intercluster distance
Gonzalez, T. F. (1985) · Theoretical Computer Science · doi:10.1016/0304-3975(85)90224-5 · Cited by 1,717
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
Ben‐Hur, A., Horn, D., Siegelmann, H. T., & Vapnik, V. N. (2002) · doi:10.5555/944790.944807 · Cited by 1,330
Refining Initial Points for K-Means Clustering
Bradley, P. S., & Fayyad, U. M. (1998) · Cited by 1,031
A clustering technique for summarizing multivariate data
Ball, G. H., & Hall, D. J. (1967) · Behavioral Science · doi:10.1002/bs.3830120210 · Cited by 912
BIRCH: A New Data Clustering Algorithm and Its Applications
Zhang, T., Ramakrishnan, R., & Livny, M. (1997) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009783824328 · Cited by 888
An empirical comparison of four initialization methods for the K-Means algorithm
Peña, J. M., Lozano, J. A., & Larrañaga, P. (1999) · Pattern Recognition Letters · doi:10.1016/s0167-8655(99)00069-0 · Cited by 866
The Challenges of Clustering High Dimensional Data
Steinbach, M., Ertöz, L., & Kumar, V. (2004) · New Directions in Statistical Physics · doi:10.1007/978-3-662-08968-2_16 · Cited by 508
Fast approximate spectral clustering
Yan, D., Huang, L., & Jordan, M. I. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557118 · Cited by 474
A local search approximation algorithm for k-means clustering
Kanungo, T., Mount, D. M., Netanyahu, N. S., Piatko, C. D., Silverman, R., & Wu, A. Y. (2002) · Proceedings of the eighteenth annual symposium on Computational geometry · doi:10.1145/513400.513402 · Cited by 474
Letter recognition using Holland-style adaptive classifiers
Frey, P. W., & Slate, D. J. (1991) · Machine Learning · doi:10.1007/bf00114162 · Cited by 409
Iterative shrinking method for clustering problems
Fränti, P., & Virmajoki, O. (2006) · Pattern Recognition · doi:10.1016/j.patcog.2005.09.012 · Cited by 341
Self-citationOptimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering
Hinneburg, A., & Keim, D. A. (1999) · KOPS (University of Konstanz) · Cited by 339
Hubs in Space: Popular Nearest Neighbors in High-Dimensional Data
RadovanovićMiloš, NanopoulosAlexandros, & IvanovićMirjana (2010) · Journal of Machine Learning Research · doi:10.5555/1756006.1953015 · Cited by 334
The k-means clustering technique: General considerations and implementation in Mathematica
Morissette, L., & Chartier, S. (2013) · Tutorials in Quantitative Methods for Psychology · doi:10.20982/tqmp.09.1.p015 · Cited by 327
Initializing K-means Batch Clustering: A Critical Evaluation of Several Techniques
Steinley, D., & Brusco, M. J. (2007) · Journal of Classification · doi:10.1007/s00357-007-0003-0 · Cited by 316
Fast Agglomerative Clustering Using a k-Nearest Neighbor Graph
Fränti, P., Virmajoki, O., & Hautamäki, V. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.227 · Cited by 310
Self-citationK-Means Clustering Versus Validation Measures: A Data-Distribution Perspective
Xiong, H., Wu, J., & Chen, J. (2009) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2008.2004559 · Cited by 277
The planark-means problem is NP-hard
Mahajan, M., Nimbhorkar, P., & Varadarajan, K. (2012) · Theoretical Computer Science · doi:10.1016/j.tcs.2010.05.034 · Cited by 277
Local Optima in K-Means Clustering: What You Don't Know May Hurt You.
Steinley, D. (2003) · Psychological Methods · doi:10.1037/1082-989x.8.3.294 · Cited by 269
Locally adaptive metrics for clustering high dimensional data
Domeniconi, C., Gunopulos, D., Ma, S., Yan, B., Al‐Razgan, M., & Papadopoulos, D. (2007) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-006-0060-8 · Cited by 238
A new algorithm for initial cluster centers in k-means algorithm
Erisoglu, M., Calis, N., & Sakallioglu, S. (2011) · Pattern Recognition Letters · doi:10.1016/j.patrec.2011.07.011 · Cited by 193
Set Matching Measures for External Cluster Validity
Rezaei, M., & Fränti, P. (2016) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2016.2551240 · Cited by 192
Self-citationA discriminative framework for clustering via similarity functions
Balcan, M.-F., Blum, A. L., & Vempala, S. (2008) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1374376.1374474 · Cited by 163
Simulating Data to Study Performance of Finite Mixture Modeling and Clustering Algorithms
Maitra, R., & Melnykov, V. (2010) · Journal of Computational and Graphical Statistics · doi:10.1198/jcgs.2009.08054 · Cited by 161
Feature clustering based support vector machine recursive feature elimination for gene selection
Huang, X., Zhang, L., Wang, B., Li, F., & Zhang, Z. (2017) · Applied Intelligence · doi:10.1007/s10489-017-0992-2 · Cited by 146
The Role of Hubness in Clustering High-Dimensional Data
Tomasev, N., Radovanovic, M., Mladenic, D., & Ivanovic, M. (2014) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2013.25 · Cited by 142
The Hardness of Approximation of Euclidean k-MeansPreprint
Awasthi, P., Charikar, M., Krishnaswamy, R., & Sinop, A. K. (2015) · arXiv (Cornell University) · doi:10.4230/lipics.socg.2015.754 · Cited by 135
Centroid index: Cluster level similarity measure
Fränti, P., Rezaei, M., & Zhao, Q. (2014) · Pattern Recognition · doi:10.1016/j.patcog.2014.03.017 · Cited by 133
Self-citationThe $K$-Means-Type Algorithms Versus Imbalanced Data Distributions
Liang, J., Bai, L., Dang, C., & Cao, F. (2012) · IEEE Transactions on Fuzzy Systems · doi:10.1109/tfuzz.2011.2182354 · Cited by 125
Ulrike Von Luxburg, A., Williamson, R. C., & Guyon, I. (2011) · Cited by 115
Randomised Local Search Algorithm for the Clustering Problem
Fränti, P., & Kivijärvi, J. (2000) · Pattern Analysis and Applications · doi:10.1007/s100440070007 · Cited by 113
Self-citationEfficient and portable combined Tausworthe random number generators
Tezuka, S., & L’Ecuyer, P. (1991) · ACM Transactions on Modeling and Computer Simulation · doi:10.1145/116890.116892 · Cited by 93
The variance of the adjusted Rand index.
Steinley, D., Brusco, M. J., & Hubert, L. J. (2016) · Psychological Methods · doi:10.1037/met0000049 · Cited by 80
Genetic algorithm with deterministic crossover for vector quantization
Fränti, P. (2000) · Pattern Recognition Letters · doi:10.1016/s0167-8655(99)00133-6 · Cited by 78
Self-citationExploring the uniform effect of FCM clustering: A data distribution perspective
Zhou, K., & Yang, S. (2016) · Knowledge-Based Systems · doi:10.1016/j.knosys.2016.01.001 · Cited by 77
Comparison of clustering methods: A case study of text-independent speaker modeling
Kinnunen, T., Sidoroff, I., Tuononen, M., & Fränti, P. (2011) · Pattern Recognition Letters · doi:10.1016/j.patrec.2011.06.023 · Cited by 65
Self-citationLocally Scaled Density Based Clustering
Biçici, E., & Yüret, D. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-71618-1_82 · Cited by 55
Ackerman, M., Ben-David, S., Brânzei, S., & Loker, D. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v26i1.8282 · Cited by 49
Dynamic local search for clustering with unknown number of clusters
Kärkkäinen, I., & Fränti, P. (2003) · doi:10.1109/icpr.2002.1048283 · Cited by 30
Self-citation
Cited by
A Fast Adaptive k-means with No Bounds
Xia, S., Peng, D., Meng, D., Zhang, C., Wang, G., Giem, E., Wei, W., & Chen, Z. (2020) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2020.3008694 · Cited by 149
Metadata
- Authors
- Fränti, P., & Sieranoja, S.
- Venue
- Applied Intelligence
- Published
- 2018-07-26
- Volume
- 48
- Issue
- 12
- Pages
- 4743-4759
- ISSN
- 0924-669X (ISSN-L)
- 1573-7497
- OpenAlex
- W2884586244
- Cited by
- 518
- References
- 54
- FWCI
- 28.29
- 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.
