The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Scalable k-means++
Abstract
Over half a century old and showing no signs of aging, k -means remains one of the most popular data processing algorithms. As is well-known, a proper initialization of k -means is crucial for obtaining a good final solution. The recently proposed k -means++ initialization algorithm achieves this, obtaining an initial set of centers that is provably close to the optimum solution. A major downside of the k -means++ is its inherent sequential nature, which limits its applicability to massive data: one must make k passes over the data to find a good initial set of centers. In this work we show how to drastically reduce the number of passes needed to obtain, in parallel, a good initialization. This is unlike prevailing efforts on parallelizing k -means that have mostly focused on the post-initialization phases of k -means. We prove that our proposed initialization algorithm k -means|| obtains a nearly optimal solution after a logarithmic number of passes, and then show that in practice a constant number of passes suffices. Experimental evaluation on real-world large-scale data demonstrates that k -means|| outperforms k -means++ in both sequential and parallel settings.
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
Jain, A. K., Murty, M. N., & Flynn, P. J. (1999) · ACM Computing Surveys · doi:10.1145/331499.331504 · Cited by 13,199
(2007) · doi:10.5555/1283383.1283494 · Cited by 7,364
Self-citationTop 10 algorithms in data mining
Wu, X., Kumar, V., Ross Quinlan, J., Ghosh, J., Yang, Q., Motoda, H., McLachlan, G. J., Ng, A., Liu, B., Yu, P. S., et al. (2008) · Knowledge and Information Systems · doi:10.1007/s10115-007-0114-2 · Cited by 5,667 · cited 1×
“Even so, a single method — k -means — remains the most popular clustering method; in fact, it was identified as one of the top 10 algorithms in data mining [34].”
MethodBIRCH: 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
MapReduce: Simplified Data Processing on Large Cluster
Senior Software Developer, A. U., & Dayalan, M. (2018) · International Journal of Research and Engineering · doi:10.21276/ijre.2018.5.5.4 · Cited by 2,948
A Survey of Clustering Data Mining Techniques
Berkhin, P. (2006) · Grouping Multidimensional Data · doi:10.1007/3-540-28349-8_2 · Cited by 2,804
White, T. (2009) · Cited by 2,800
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
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
Google news personalization: scalable online collaborative filtering
Das, A. S., Datar, M., Garg, A., & Rajaram, S. (2007) · Proceedings of the 16th international conference on World Wide Web · doi:10.1145/1242572.1242610 · Cited by 1,511
Sculley, D. (2010) · Proceedings of the 19th international conference on World wide web · doi:10.1145/1772690.1772862 · Cited by 1,147
Clustering data streams: theory and practice
Guha, S., Meyerson, A., Mishra, N., Motwani, R., & O'Callaghan, L. (2003) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2003.1198387 · Cited by 882
NP-hardness of Euclidean sum-of-squares clustering
Aloise, D., Deshpande, A., Hansen, P., & Popat, P. (2009) · Machine Learning · doi:10.1007/s10994-009-5103-0 · Cited by 867
Scaling clustering algorithms to large databases
Bradley, P., Fayyad, U. M., & Reina, C. (1998) · Cited by 716
Parallel K-Means Clustering Based on MapReduce
Zhao, W., Ma, H., & He, Q. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-10665-1_71 · Cited by 626
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
A Model of Computation for MapReduce
Karloff, H. J., Suri, S., & Vassilvitskii, S. (2010) · Cited by 454
Self-citationA Data-Clustering Algorithm on Distributed Memory Multiprocessors
Dhillon, I. S., & Modha, D. S. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-46502-2_13 · Cited by 386
Two-phase clustering process for outliers detection
Jiang, M. F., Tseng, S. S., & Su, C. M. (2001) · Pattern Recognition Letters · doi:10.1016/s0167-8655(00)00131-8 · Cited by 341
How slow is the k -means method?
Arthur, D., & Vassilvitskii, S. (2006) · Proceedings of the twenty-second annual symposium on Computational geometry · doi:10.1145/1137856.1137880 · Cited by 304
Self-citationStreamKM++: A clustering algorithm for data streams
Ackermann, M. R., Märtens, M., Raupach, C., Swierkot, K., Lammersen, C., & Sohler, C. (2012) · ACM Journal of Experimental Algorithmics · doi:10.1145/2133803.2184450 · Cited by 294
The Effectiveness of Lloyd-Type Methods for the k-Means Problem
Ostrovsky, R., Rabani, Y., Schulman, L., & Swamy, C. (2006) · 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) · doi:10.1109/focs.2006.75 · Cited by 261
A Simple Linear Time (1+ ∊) -Approximation Algorithm for k-Means Clustering in Any Dimensions
Kumar, A., Sabharwal, Y., & Sen, S. (2004) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2004.7 · Cited by 247
Filtering: a method for solving graph problems in MapReduce
Lattanzi, S., Moseley, B., Suri, S., & Vassilvitskii, S. (2011) · Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures · doi:10.1145/1989493.1989505 · Cited by 226
Self-citationDensest subgraph in streaming and MapReduce
Bahmani, B., Kumar, R., & Vassilvitskii, S. (2012) · Proceedings of the VLDB Endowment · doi:10.14778/2140436.2140442 · Cited by 219
Self-citationFast clustering using MapReduce
Ene, A., Im, S., & Moseley, B. (2011) · Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2020408.2020515 · Cited by 212
Self-citationk-means requires exponentially many iterations even in the plane
Vattani, A. (2009) · Proceedings of the twenty-fifth annual symposium on Computational geometry · doi:10.1145/1542362.1542419 · Cited by 186
Self-citationStreaming k-means approximation
Ailon, N., Jaiswal, R., & Monteleoni, C. (2009) · Cited by 163
Fast personalized PageRank on MapReduce
Bahmani, B., Chakrabarti, K., & Xin, D. (2011) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/1989323.1989425 · Cited by 157
Self-citationIntegrating K-means clustering with a relational DBMS using SQL
ORDÓÑEZ, C. R. (2006) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2006.31 · Cited by 117
StreamKM++: A Clustering Algorithm for Data Streams
Ackermann, M. R., Raupach, C., Lammersen, C., Sohler, C., Märtens, M., & Swierkot, K. (2010) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611972900.16 · Cited by 103
Efficient disk-based K-means clustering for relational databases
ORDÓÑEZ, C. R., & Omiecinski, E. R. (2004) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2004.25 · Cited by 97
Chierichetti, F., Kumar, R., & Tomkins, A. (2010) · International World Wide Web Conference (WWW) · doi:10.1145/1772690.1772715 · Cited by 94
Self-citationA Survey on Clustering Algorithms for Data in Spatial Database Management Systems
Chandra.E, A., & Anuradha.V.P, A. (2011) · International Journal of Computer Applications · doi:10.5120/2969-3975 · Cited by 30
Cited by
Deep Learning for Anomaly Detection in Time-Series Data: Review, Analysis, and Guidelines
Choi, K., Yi, J., Park, C., & Yoon, S. (2021) · IEEE Access · doi:10.1109/access.2021.3107975 · Cited by 588
How much can k-means be improved by using better initialization and repeats?
Fränti, P., & Sieranoja, S. (2019) · Pattern Recognition · doi:10.1016/j.patcog.2019.04.014 · Cited by 451
Localized Discrete Empirical Interpolation Method
Peherstorfer, B., Butnaru, D., Willcox, K., & Bungartz, H.-J. (2014) · SIAM Journal on Scientific Computing · doi:10.1137/130924408 · Cited by 273
Making AI Forget You: Data Deletion in Machine Learning
Ginart, A., Guan, M. Y., Valiant, G., & Zou, J. (2019) · arXiv · doi:10.48550/arxiv.1907.05012 · Cited by 175
Prioritising references for systematic reviews with RobotAnalyst: A user study
Przybyła, P., Brockmeier, A. J., Kontonatsios, G., Le Pogam, M., McNaught, J., von Elm, E., Nolan, K., & Ananiadou, S. (2018) · Research Synthesis Methods · doi:10.1002/jrsm.1311 · Cited by 148
“The spectral representation is clustered using spherical k-means, 10 replicates, a maximum of 100 iterations, and the scalable k-means++ oversam-pling initialisation algorithm 77 with the parameters l = 2 k and r = 5, where k is the number of clusters.”
Method
Metadata
- Authors
- Bahmani, B., Moseley, B., Vattani, A., Kumar, R., & Vassilvitskii, S.
- Venue
- Proceedings of the VLDB Endowment
- Published
- 2012-03
- Volume
- 5
- Issue
- 7
- Pages
- 622-633
- ISSN
- 2150-8097 (ISSN-L)
- OpenAlex
- W2108399535
- Cited by
- 628
- References
- 34
- FWCI
- 27.23
- 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.