Machine Learning

, Volume 75, Issue 2, pp 245–248

NP-hardness of Euclidean sum-of-squares clustering

Authors

    • École Polytechnique de Montréal
  • Amit Deshpande
    • Microsoft Research India
  • Pierre Hansen
    • GERAD and HEC Montréal
  • Preyas Popat
    • Chennai Mathematical Institute
Article

DOI: 10.1007/s10994-009-5103-0

Cite this article as:
Aloise, D., Deshpande, A., Hansen, P. et al. Mach Learn (2009) 75: 245. doi:10.1007/s10994-009-5103-0

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.

Keywords

Clustering Sum-of-squares Complexity

Copyright information

© Springer Science+Business Media, LLC 2009