4.6 Article

Clustering by Local Gravitation

期刊

IEEE TRANSACTIONS ON CYBERNETICS
卷 48, 期 5, 页码 1383-1396

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TCYB.2017.2695218

关键词

Cluster algorithms; cluster analysis; clustering; density-based clustering

资金

  1. NSFC [U1611461, U1501252, 61572146, 61572199]
  2. Science and Technology Planning Project of Guangdong Province, China [2015A050502011, 2016B090918042, 2016A050503015, 2016B010127003]
  3. Research Grants Council of the Hong Kong Special Administrative Region, China [CityU 11300715]
  4. City University of Hong Kong [7004674]

向作者/读者索取更多资源

The objective of cluster analysis is to partition a set of data points into several groups based on a suitable distance measure. We first propose a model called local gravitation among data points. In this model, each data point is viewed as an object with mass, and associated with a local resultant force (LRF) generated by its neighbors. The motivation of this paper is that there exist distinct differences between the LRFs (including magnitudes and directions) of the data points close to the cluster centers and at the boundary of the clusters. To capture these differences efficiently, two new local measures named centrality and coordination are further investigated. Based on empirical observations, two new clustering methods called local gravitation clustering and communication with local agents are designed, and several test cases are conducted to verify their effectiveness. The experiments on synthetic data sets and real-world data sets indicate that both clustering approaches achieve good performance on most of the data sets.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据