Optimising sum-of-squares measures for clustering multisets defined over a metric space
Discrete Applied Mathematics(2013)
摘要
Clustering is the problem of dividing a dataset into subsets, called clusters, which are both homogeneous and well-separated. Many criteria have been devised which simultaneously measure both of these properties. Two such criteria are centroid-distance, used by the popular k-means algorithm, and the complete sum of all intra-cluster distances squared, which we call all-squares. This paper compares these two criteria in the context of clustering multisets which are defined over a metric space.
更多查看译文
关键词
Clustering,Sum-of-squares,Optimisation,Complexity,NP-completeness
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要