k-means++: the advantages of careful seeding

Keywords

Seeding, Cluster analysis, Computer science, Simplicity, Simple (philosophy)

References

• A fast hybrid k-means level set algorithm for segmentationFrédéric Gibou — 2005
• Approximation schemes for clustering problemsW. Fernandez de la Véga, Marek Karpiński, Claire Kenyon — 2003
• The Effectiveness of Lloyd-Type Methods for the k-Means ProblemRafail Ostrovsky, Yuval Rabani, Leonard J. Schulman — 2006
• How slow is the k-means method?David Arthur, Sergei Vassilvitskii — 2006
• Clustering Large Graphs via the Singular Value DecompositionPetros Drineas, Alan Frieze, Ravi Kannan — 2004
• Large-scale clustering of cDNA-fingerprinting data.Ralf Herwig, Albert J. Poustka, Christine H. Müller — 1999
• How Fast Is the k-Means Method?Sariel Har-Peled, Bardia Sadri — 2005
• Worst-case and Smoothed Analysis of the ICP Algorithm, with an Application to the k-means MethodDavid Arthur, Sergei Vassilvitskii — 2006
• On coresets for k-means and k-median clusteringSariel Har-Peled, Soham Mazumdar — 2004
• Optimal Time Bounds for Approximate ClusteringRamgopal R. Mettu, C. Greg Plaxton — 2002
• Applications of weighted Voronoi diagrams and randomization to variance-based k-clustering: (extended abstract)Mary Inaba, Naoki Katoh, Hiroshi Imai — 1994
• Better streaming algorithms for clustering problemsMoses Charikar, Liadan O'Callaghan, Rina Panigrahy‎ — 2003
• A simple linear time (1 + /spl epsiv/)-approximation algorithm for k-means clustering in any dimensionsAmit Kumar, Yogish Sabharwal, Subhankar Sen — 2004
• k-means projective clusteringPankaj K. Agarwal, Nabil H. Mustafa — 2004
• Clustering Data Streams: Theory and PracticeSuvajyoti Guha, Adam Meyerson, Nita Mishra — 2003
• Least squares quantization in PCMSheelagh Lloyd — 1982
• Online facility locationAdam Meyerson — 2001
• A local search approximation algorithm for k-means clusteringTapas Kanungo, David M. Mount, Nathan S. Netanyahu — 2002
• Worst-case and Smoothed Analysis of the ICP Algorithm, with an Application to the k-means MethodDavid Arthur, Sergei Vassilvitskii — 2006
• How fast is κ-means?S. Dasgupta — 2003

Cited by

• A separability index for clustering and classification problems with applications to cluster merging and systematic evaluation of clustering algorithmsAnna Peterson — 2011
• Varieties of capitalist debates: how institutions shape public conflicts on economic liberalization in the U.K., France, and GermanyBruno Wüest — 2010
• A Domain Aware Genetic Algorithm for the p-Median ProblemSumitra Mukherjee, Dennis Vickers — 2011
• Label Transfer by Measuring Compactness真由美 安部, 美和 福満, 敦子 久保 — 2013
• Adaptive dual control of topic-based information retrievalVitaliy Vitsentiy — 2009
• Fully automated registration of vibrational microspectroscopic images in histologically stained tissue sections浩 鮫島, 克 池ノ上 — 2015
• Denoising Autoencoder Self-Organizing Map (DASOM)María Luisa Domínguez Reboiras — 2018
• Self-Similarity Constrained Sparse Representation for Hyperspectral Image Super-ResolutionR.W.A. Hutjes — 2018
• Acoustic source localization with microphone arrays for remote noise monitoring in an Intensive Care UnitJ.-C Ruwet — 2018
• A Three-Dimensional Hough Transform-Based Track-Before-Detect Technique for Detecting Extended Targets in Strong Clutter BackgroundsBo Yan, Na Xu, Wenbo Zhao — 2019
• Statistical analysis of RNA-seq data from next- generation sequencing technologyYaqing Si — 2012
• A novel construction of connectivity graphs for clustering and visualizationWesam Ashour Barbakh, Colin Fyfe — 2008
• Indexation de séquences de descripteursRomain Tavenard — 2011
• "Fulfilling the Needs of Gray-Sheep Users in Recommender Systems, A Clustering Solution"Mustansar Ali Ghazanfar, Adam Prügel‐Bennett — 2011
• Red tide detection using remotely sensed data: A case study of Sabah, MalaysiaAsmala Ahmad, Noorazuan Hashim, Laili Nordin — 2009
• On the Complexity of Minimum Sum-of-Squares ClusteringDaniel Aloise, Pierre Hansen — 2007
• Problems and Mitigation Strategies for Developing and Validating Statistical Cyber DefensesMichael Atighetchi, Michael J. Mayhew, Rachel Greenstadt — 2014
• Approximation Algorithms and New Models for Clustering and LearningPranjal Awasthi — 2013
• Adaptive surrogate models for reliability analysis and reliability-based design optimizationVincent Dubourg — 2011
• Center Based Clustering: A Foundational PerspectivePranjal Awasthi, Maria-Florina Balcan — 2014

Related papers

• UCI Machine Learning RepositoryArthur Asuncion — 2007
• Deep Residual Learning for Image RecognitionKaiming He, Xiangyu Zhang, Shaoqing Ren — 2015
• Visualizing Data using t-SNELaurens van der Maaten, Geoffrey E. Hinton — 2008
• On Spectral Clustering: Analysis and an algorithmAndrew Y. Ng, Michael I. Jordan, Yair Weiss — 2001
• An Efficient k-Means Clustering Algorithm: Analysis and ImplementationTapas Kanungo, David M. Mount, Nathan S. Netanyahu — 2002
• Distinctive Image Features from Scale-Invariant KeypointsDavid Lowe — 2004
• Least squares quantization in PCMSheelagh Lloyd — 1982
• A tutorial on spectral clusteringUlrike von Luxburg — 2007
• Some methods for classification and analysis of multivariate observationsJames B. MacQueen — 1967