A Combined Clustering Algorithm Based on ESynC Algorithm and a Merging Judgement Process of Micro-Clusters

Abstract

The first synchronization clustering (SynC) algorithm based on an extensive Kuromato model was presented in 2010. In 2017, an effective synchronization clustering (ESynC) algorithm, inspired by SynC algorithm and a linear version of Vicsek model, was proposed. When facing complex data distributions, ESynC algorithm may regard an irregular and whole cluster as some micro-clusters. To conquer this shortcoming, a combined clustering algorithm based on ESynC algorithm and a merging judgement process of micro-clusters (CESynC) is presented. CESynC algorithm first uses ESynC algorithm to detect clusters or micro-clusters, then merges those conjoint micro-clusters by using a merging judgement process. For some datasets that ESynC and SynC cannot detect correct clusters, CESynC can capture natural clusters. From the simulation experiments, we observe that CESynC can get better (or the same) clustering results than (or as) that of ESynC in many cases. We also observe that the clustering results of CESynC and ESynC are often better than that of SynC. Therefore, we can say CESynC can often obtain better clustering quality than ESynC and SynC in some kinds of datasets. Further comparison experiments with some classical clustering algorithms demonstrate the clustering effect of CESynC.