Clustering by Local Gravitation
- Authors
- Wang, Zhiqiang; Yu, Zhiwen; Philip Chen C.L.; You, Jane; Gu, Tianlong; Wong, Hau-San; ZHANG, Jun
- Issue Date
- May-2018
- Publisher
- IEEE Advancing Technology for Humanity
- Keywords
- Cluster algorithms; cluster analysis; clustering; density-based clustering
- Citation
- IEEE Transactions on Cybernetics, v.48, no.5, pp 1383 - 1396
- Pages
- 14
- Indexed
- SCI
SCIE
SCOPUS
- Journal Title
- IEEE Transactions on Cybernetics
- Volume
- 48
- Number
- 5
- Start Page
- 1383
- End Page
- 1396
- URI
- https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/115774
- DOI
- 10.1109/TCYB.2017.2695218
- ISSN
- 2168-2267
2168-2275
- Abstract
- 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. © 2013 IEEE.
- Files in This Item
-
Go to Link
- Appears in
Collections - COLLEGE OF ENGINEERING SCIENCES > SCHOOL OF ELECTRICAL ENGINEERING > 1. Journal Articles

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.