A fast algorithm to initialize cluster centroids in fuzzy clustering applications

Cebeci, Zeynel and Cebeci, Cagatay (2020) A fast algorithm to initialize cluster centroids in fuzzy clustering applications. Information, 11 (9). 446. ISSN 2078-2489 (https://doi.org/10.3390/info11090446)

[thumbnail of Cebeci-Cebeci-Information-2020-A-fast-algorithm-to-initialize-cluster-centroids]
Preview
 Text. Filename: Cebeci_Cebeci_Information_2020_A_fast_algorithm_to_initialize_cluster_centroids.pdf
Final Published Version
License: Creative Commons Attribution 4.0 logo
Download (437kB)| Preview

Abstract

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.

CORE (COnnecting REpositories)