# Generalization of k-means Related Algorithms

arXiv: https://arxiv.org/abs/1903.10025 · HTML: https://mlsanity.com/paper/1903.10025/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 24 Mar 2019.

## Built on by (most cited first, 1 of 1)

- [Are Easy Data Easy (for K-Means)](https://mlsanity.com/paper/2308.01926/) (2023)

## 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.
