Generalization of k-means Related Algorithms
Not on the map. Why?
Abstract (arXiv)
This article briefly introduced Arthur and Vassilvitshii's work on k-means++ algorithm and further generalized the center initialization process. It is found that choosing the most distant sample point from the nearest center as new center can mostly have the same effect as the center initialization process in the k-means++ algorithm.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 24 Mar 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1.
1 paper.
- 2023Are Easy Data Easy (for K-Means)cited by 0
- 2023Are Easy Data Easy (for K-Means)2 Aug 2023