In $k$-means, how is it NP-hard if the dimensionality of the data is at least $2$ ($d\geq 2$)?
Posted by Maryam Faheem, at stats.stackexchange.com,
In $k$-means, how is it NP-hard if the dimensionality of the data is at least $2$ ($d\geq 2$)? Can someone justify or give…