.png){kind=icon}
返回
ESC: An efficient synchronization-based clustering algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2012.11.015.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Clustering algorithm
Dynamical synchronization model
Neighborhood closure
Density-biased sampling
Cluster validity criterion
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
K
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
.png){kind=icon}
查看更多内容