NP-hardness of Euclidean sum-of-squares clustering

Machine Learning 2009 / 05 Vol. 75; Iss. 2

NP-hardness of Euclidean sum-of-squares clustering

Daniel Aloise, Amit Deshpande, Pierre Hansen, Preyas Popat
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
75
Language:
english
Pages:
4
DOI:
10.1007/s10994-009-5103-0
Date:
May, 2009
File:
PDF, 261 KB
english, 2009
Conversion to is in progress
Conversion to is failed