The Hardness Of K Means Clustering

The Hardness of K-means Clustering

We show that k-means clustering is an NP-hard optimization problem, even if k is fixed to 2.

Advances in Knowledge Discovery and Data Mining, Part I

Algorithm Engineering

Algorithm Engineering is a methodology for algorithmic research that combines theory with implementation and experimentation in order to obtain better algorithms with high practical impact. Traditionally, the study of algorithms was dominated by mathematical (worst-case) analysis. In Algorithm Engineering, algorithms are also implemented and experiments conducted in a systematic way, sometimes resembling the experimentation processes known from fields such as biology, chemistry, or physics. This helps in counteracting an otherwise growing gap between theory and practice.