共 32 条
[2]
Ackermann MR, 2009, PROCEEDINGS OF THE TWENTIETH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, P1088
[3]
NP-hardness of Euclidean sum-of-squares clustering
[J].
MACHINE LEARNING,
2009, 75 (02)
:245-248
[4]
[Anonymous], 1991, Probability: theory and examples
[5]
[Anonymous], 1973, Pattern Classification and Scene Analysis
[6]
Arthur D., 2006, Proceedings of the Twenty-Second Annual Symposium on Computational Geometry (SCG'06), P144, DOI 10.1145/1137856.1137880
[7]
Arthur D, 2007, PROCEEDINGS OF THE EIGHTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, P1027
[8]
k-Means has Polynomial Smoothed Complexity
[J].
2009 50TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE: FOCS 2009, PROCEEDINGS,
2009,
:405-414
[10]
Badoiu M, 2002, P 34 ANN ACM S THEOR, P250, DOI DOI 10.1145/509907.509947