.png){kind=icon}
Return
An effective synchronization clustering algorithm
.png){kind=icon}
PRE
AI
DOI：10.1007/s10489-016-0814-y.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents an Effective Synchronization Clustering (ESynC) algorithm using a linear version of Vicsek model. The development of ESynC algorithm is inspired by Synchronization Clustering (SynC) algorithm and Vicsek model. After some analysis and experimental comparison, we observe that ESynC algorithm based on the linear version of Vicsek model can get better local synchronization effect than SynC algorithm based on an extensive Kuramoto model and a similar synchronization clustering algorithm based on the original version of Vicsek model. By some simulated experiments of some artificial data sets, eight UCI data sets, and three picture data sets, we observe that ESynC algorithm not only gets better local synchronization effect but also needs less iterative times and time cost than SynC algorithm. We also introduce an Improved ESynC algorithm (IESynC algorithm) in time cost by combining multidimensional grid partitioning method and Red-Black tree structure. By some simulated experiments, we observe that IESynC algorithm can get some improvement of time cost than ESynC algorithm in some data sets. Extensive comparison experiments with some class clustering algorithms demonstrate that our two algorithms can often get acceptable clustering results in many cases. At last, it gives several solid and insightful future research suggestions.
Keywords:
Clustering
Synchronization
Kuramoto model
A linear version of Vicsek model
Near neighbor point set
Journal
IF:
3.5
Papers:
7.7K
Citations:
2.0W
Organization
No organization information available
Cited Papers
ShareSaveRoute-dependent switch between hierarchical and egalitarian strategies in pigeon flocks.png)
SCIENTIFIC REPORTS
OAAI
SCIENTIFIC REPORTSIF3.9
OAAIShareSave
ShareSaveShareSave
View more