Strong Consistency of $K$-Means Clustering 论文

1981The Annals of Statistics引用 464
Advanced Clustering Algorithms ResearchFace and Expression RecognitionBayesian Methods and Mixture Models

详细信息

发表期刊/会议
The Annals of Statistics
发表日期
1981-01-01
发表年份
1981

关键词

Advanced Clustering Algorithms ResearchFace and Expression RecognitionBayesian Methods and Mixture Models

摘要

A random sample is divided into the $k$ clusters that minimise the within cluster sum of squares. Conditions are found that ensure the almost sure convergence, as the sample size increases, of the set of means of the $k$ clusters. The result is proved for a more general clustering criterion.