NP-hardness of Euclidean sum-of-squares clustering

Title
NP-hardness of Euclidean sum-of-squares clustering
Authors
Keywords
-
Journal
MACHINE LEARNING
Volume 75, Issue 2, Pages 245-248
Publisher
Springer Nature
Online
2009-01-24
DOI
10.1007/s10994-009-5103-0

Ask authors/readers for more resources

Publish scientific posters with Peeref

Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.

Learn More

Ask a Question. Answer a Question.

Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.

Get Started