.png){kind=icon}
.png){kind=icon}
Return
ESC: An efficient synchronization-based clustering algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2012.11.015.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Clustering is an essential approach for detecting the intrinsic groups in data. An efficient clustering algorithm based on a generalized local synchronization model is proposed. It uses a novel stopping criterion of data synchronization to detect clusters prior to the perfect synchronization. Moreover, a density-biased sampling method is adopted to extract samples from the original data set. The clustering structure can be effectively revealed on the samples. As a result, the clustering efficiency is significantly improved. By using a cluster validity criterion, the proposed algorithm can find clusters of arbitrary number, shape, size and density as well as isolate noises in the vector data without any data distribution assumption. Extensive experiments on several synthetic and real-world data sets show that the proposed algorithm possesses high accuracy and it is more efficient than the state-of-the-art synchronization-based clustering method. (C) 2012 Elsevier B.V. All rights reserved.
Keywords:
Clustering algorithm
Dynamical synchronization model
Neighborhood closure
Density-biased sampling
Cluster validity criterion
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
K
IF:
7.6
Papers:
1.2W
Citations:
4.5W
View more organizations