COL870: Clustering Algorithms Hardness of k means clustering

Ishaan Preet Singh,Surbhi Goel

user-5ebe3c75d0b15254d6c50b36（2015）

引用 0|浏览19

暂无评分

摘要

We discuss proofs of the NP-hardness of k-means clustering, specifically for 2-means [1] and planar k-means [2][3].

查看译文

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要