Machine Learning

, Volume 75, Issue 2, pp 245–248

NP-hardness of Euclidean sum-of-squares clustering

  • Daniel Aloise
  • Amit Deshpande
  • Pierre Hansen
  • Preyas Popat
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

ClusteringSum-of-squaresComplexity
Download to read the full article text

Copyright information

© Springer Science+Business Media, LLC 2009

Authors and Affiliations

  • Daniel Aloise
    • 1
  • Amit Deshpande
    • 2
  • Pierre Hansen
    • 3
  • Preyas Popat
    • 4
  1. 1.École Polytechnique de MontréalMontrealCanada
  2. 2.Microsoft Research IndiaBangaloreIndia
  3. 3.GERAD and HEC MontréalMontrealCanada
  4. 4.Chennai Mathematical InstituteSiruseriIndia