Introducing Gravitational Force into Affinity Propagation Clustering
Clustering has long been an important data processing task in different applications. Typically, it attempts to partition the available data into groups according to their underlying distributions, and each cluster is represented by a center or an exemplar. In this paper, a new clustering algorithm...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SAGE Publishing
2011-03-01
|
| Series: | Journal of Algorithms & Computational Technology |
| Online Access: | https://doi.org/10.1260/1748-3018.5.1.23 |
| Summary: | Clustering has long been an important data processing task in different applications. Typically, it attempts to partition the available data into groups according to their underlying distributions, and each cluster is represented by a center or an exemplar. In this paper, a new clustering algorithm called gravitational-force-based affinity propagation clustering (GFAPC) is proposed, based on the well-known Newton's law of universal gravitation. It views the available data points as nodes of a network (or planets of a universe) and the clusters and their corresponding exemplars can be obtained by transmitting affinity messages based on the gravitational forces between data points in a network. While GFAPC is inspired by the recently proposed affinity propagation clustering (APC) approach, it provides a new definition of the similarity between data points which makes the APC process more convincing and at the same time facilitates the differentiation of data points' importance. The experimental results show that the GFAPC algorithm, with comparable clustering accuracy, is even more efficient than the original APC approach. |
|---|---|
| ISSN: | 1748-3018 1748-3026 |