ck-means and fck-means

Abdesslem Layeb

ck-means and fck-means

Číslo: 2/2023
Periodikum: Acta Informatica Pragensia
DOI: 10.18267/j.aip.223

Klíčová slova: Clustering; Kmeans; Kmeans++; Initialization; Crowding distance; Heuristics

Pro získání musíte mít účet v Citace PRO.

Přečíst po přihlášení

Anotace: This paper presents two novel deterministic initialization procedures for k-means clustering based on a modified crowding distance. The procedures, named ck-means and fck-means, use more crowded points as initial centroids. Experimental studies on multiple datasets demonstrate that the proposed approach outperforms k-means and k-means++ in terms of clustering accuracy. The effectiveness of ck-means and fck-means is attributed to their ability to select better initial centroids based on the modified crowding distance. Overall, the proposed approach provides a promising alternative for improving k-means clustering.