NP-hardness of Euclidean sum-of-squares clustering

Authors:
Daniel Aloise;Amit Deshpande;Pierre Hansen;Preyas Popat
Affiliations:
École Polytechnique de Montréal, Montreal, Canada H3C 3A7;Microsoft Research India, Bangalore, India 560 080;GERAD and HEC Montréal, Montreal, Canada H3T 2A7;Chennai Mathematical Institute, Siruseri, India 603103
Venue:
Machine Learning
Year:
2009

Citing 7
Cited 31

Sparsest cuts and bottlenecks in graphs

Discrete Applied Mathematics - Computational combinatiorics
Cluster analysis and mathematical programming

Mathematical Programming: Series A and B - Special issue: papers from ismp97, the 16th international symposium on mathematical programming, Lausanne EPFL
Clustering Large Graphs via the Singular Value Decomposition

Machine Learning
Online clustering of parallel data streams

Data & Knowledge Engineering
The Effectiveness of Lloyd-Type Methods for the k-Means Problem

FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
k-means++: the advantages of careful seeding

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
On the complexity of several haplotyping problems

WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics

Adaptive Sampling for k-Means Clustering

APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Spectral Algorithms

Foundations and Trends® in Theoretical Computer Science
Minimum sum-of-squares clustering by DC programming and DCA

ICIC'09 Proceedings of the Intelligent computing 5th international conference on Emerging intelligent computing technology and applications
Dimension reduction and visualization of large high-dimensional data via interpolation

Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing
Viterbi training for PCFGs: hardness results and competitiveness of uniform initialization

ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Improving the performance of k-means for color quantization

Image and Vision Computing
A clustering based approach for skyline diversity

Expert Systems with Applications: An International Journal
Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering

Journal of Global Optimization
The complexity status of problems related to sparsest cuts

IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
A clustering method combining differential evolution with the K-means algorithm

Pattern Recognition Letters
A bad instance for k-means++

TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Semi-supervised parameter-free divisive hierarchical clustering of categorical data

PAKDD'11 Proceedings of the 15th Pacific-Asia conference on Advances in knowledge discovery and data mining - Volume Part I
Smoothed Analysis of the k-Means Method

Journal of the ACM (JACM)
The growing neural gas and clustering of large amounts of data

Optical Memory and Neural Networks
Scalable k-means++

Proceedings of the VLDB Endowment
A unified framework for market segmentation and its applications

Expert Systems with Applications: An International Journal
StreamKM++: A clustering algorithm for data streams

Journal of Experimental Algorithmics (JEA)
The complexity of finding uniform sparsest cuts in various graph classes

Journal of Discrete Algorithms
In-situ soil moisture sensing: Optimal sensor placement and field estimation

ACM Transactions on Sensor Networks (TOSN)
The planar k-means problem is NP-hard

Theoretical Computer Science
Fast k-clustering queries on embeddings of road networks

Proceedings of the 3rd International Conference on Computing for Geospatial Research and Applications
Dense and sparse graph partition

Discrete Applied Mathematics
Clustering by analytic functions

Information Sciences: an International Journal
The MADlib analytics library: or MAD skills, the SQL

Proceedings of the VLDB Endowment
A comparative study of efficient initialization methods for the k-means clustering algorithm

Expert Systems with Applications: An International Journal
Size Constrained Distance Clustering: Separation Properties and Some Complexity Results

Fundamenta Informaticae - From Physics to Computer Science: to Gianpiero Cattaneo for his 70th birthday
Fault tolerant decentralised K-Means clustering for asynchronous large-scale networks

Journal of Parallel and Distributed Computing
Online, deviation-constrained capacitated vehicle routing

Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Optimising sum-of-squares measures for clustering multisets defined over a metric space

Discrete Applied Mathematics
A bad instance for k-means++

Theoretical Computer Science
A binomial noised model for cluster validation

Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology - Recent Advances in Soft Computing: Theories and Applications

Quantified Score

Hi-index	0.01

Visualization

Abstract

A recent proof of NP-hardness of Euclidean sum-of-squares clustering, due to Drineas et al. (Mach. Learn. 56:9---33, 2004), is not valid. An alternate short proof is provided.