Metraipolis › archive › dc_6dd36ca821ec

Sector-Mean: Deterministic Initialization of K-Means Centroids via Angular Sector Partitioning — arXiv:2609.06468

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.06468
License (as archived)
CC0-1.0
Archived
2026-10-16T13:56:46.168Z
SHA-256 of the archived text
ea446a504a8022dcebda2e7cc36fa5fb2797e238c2e67fff78d9fc687e80eb79
Stable URL of this page
https://metraipolis.com/documento/dc_6dd36ca821ec

How to cite

Sector-Mean: Deterministic Initialization of K-Means Centroids via Angular Sector Partitioning — arXiv:2609.06468 — arXiv (en), https://arxiv.org/abs/2609.06468 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_6dd36ca821ec (Metraipolis archive dc_6dd36ca821ec, sha256 ea446a504a8022dcebda2e7cc36fa5fb2797e238c2e67fff78d9fc687e80eb79)
BibTeX
@misc{dc6dd36ca821ec,
  title = {Sector-Mean: Deterministic Initialization of K-Means Centroids via Angular Sector Partitioning — arXiv:2609.06468},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.06468},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_6dd36ca821ec; sha256 ea446a504a8022dcebda2e7cc36fa5fb2797e238c2e67fff78d9fc687e80eb79},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.06468. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

K-Means is one of the most widely used clustering algorithms, but its susceptibility to initial centroid selection remains a primary bottleneck for its convergence speed and clustering accuracy. This paper proposes Sector-Mean Initialization, a deterministic initialization strategy with O(N) time complexity that partitions the two-dimensional data space into angular sectors around the global centroid and initializes centroids using sector-wise means. We evaluate the method on established two-dimensional benchmarks (SIPU, Birch) and multiple real-world datasets, comparing against random, K-Means++, and Max-Min initialization under identical Lloyd iterations. The statistical analysis of Friedman's test (p<0.05) and Nemenyi post-hoc comparison indicates that, while delivering equivalent clustering quality as K-Means++ and Max-Min, Sector-Mean offers significant computational efficiency. Experimental results show that Sector-Mean reduces the initialization time by 74.9% and 59.8% in comparison to K-Means++ and max-min, respectively. And, it yields the lowest average number of iterations, achieving approximately 5% fewer iterations than K-Means++ and 16% fewer than max-min. These results highlight that Sector-Mean initialization offers a deterministic and computationally efficient initialization strategy while preserving cluster quality.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-09 in cs.LG).
Categorie arXiv: Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2609.06468 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T13:39:42.875Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).