A fast algorithm to initialize cluster centroids in fuzzy clustering applications

Zeynel Cebeci, Cagatay Cebeci

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)
15 Downloads (Pure)


The goal of partitioning clustering analysis is to divide a dataset into a predetermined number of homogeneous clusters. The quality of final clusters from a prototype-based partitioning algorithm is highly affected by the initially chosen centroids. In this paper, we propose the InoFrep, a novel data-dependent initialization algorithm for improving computational efficiency and robustness in prototype-based hard and fuzzy clustering. The InoFrep is a single-pass algorithm using the frequency polygon data of the feature with the highest peaks count in a dataset. By using the Fuzzy C-means (FCM) clustering algorithm, we empirically compare the performance of the InoFrep on one synthetic and six real datasets to those of two common initialization methods: Random sampling of data points and K-means++. Our results show that the InoFrep algorithm significantly reduces the number of iterations and the computing time required by the FCM algorithm. Additionally, it can be applied to multidimensional large datasets because of its shorter initialization time and independence from dimensionality due to working with only one feature with the highest number of peaks.
Original languageEnglish
Article number446
Number of pages15
Issue number9
Publication statusPublished - 15 Sept 2020


  • clustering
  • datasets
  • machine learning


Dive into the research topics of 'A fast algorithm to initialize cluster centroids in fuzzy clustering applications'. Together they form a unique fingerprint.

Cite this