论文信息 - NP-hardness of Euclidean sum-of-squares clustering - 字舞流文

NP-hardness of Euclidean sum-of-squares clustering

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.

Pierre Hansen | Daniel Aloise | Preyas Popat | Amit Deshpande | P. Hansen | A. Deshpande | Daniel Aloise | P. Popat

[1] Sergei Vassilvitskii,et al. k-means++: the advantages of careful seeding , 2007, SODA '07.

[2] Pierre Hansen,et al. Cluster analysis and mathematical programming , 1997, Math. Program..

[3] Pierre Hansen,et al. On the Complexity of Minimum Sum-of-Squares Clustering , 2007 .

[4] Alan M. Frieze,et al. Clustering Large Graphs via the Singular Value Decomposition , 2004, Machine Learning.

[5] Eyke Hüllermeier,et al. Online clustering of parallel data streams , 2006, Data Knowl. Eng..

[6] Farhad Shahrokhi,et al. Sparsest cuts and bottlenecks in graphs , 1990, Discret. Appl. Math..

[7] S. Dasgupta. The hardness of k-means clustering , 2008 .

[8] Leo van Iersel,et al. On the Complexity of Several Haplotyping Problems , 2005, WABI.

[9] J. MacQueen. Some methods for classification and analysis of multivariate observations , 1967 .