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: | X.-F. Chen, S.-T. Wang, F.-L. Chung, S.-Q. Cao |
---|---|
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 |
Similar Items
-
Affinity Propagation: Clustering Data by Passing Messages
by: Dueck, Delbert
Published: (2009) -
Affinity Propagation: Clustering Data by Passing Messages
by: Dueck, Delbert
Published: (2009) -
Distributed Clustering in Cognitive Radio Ad Hoc Networks Using Soft-Constraint Affinity Propagation
by: J.Z. Zhang, et al.
Published: (2012-09-01) -
Semisupervised Clustering for Networks Based on Fast Affinity Propagation
by: Mu Zhu, et al.
Published: (2013-01-01) -
Affinity Propagation Clustering Using Path Based Similarity
by: Yuan Jiang, et al.
Published: (2016-07-01)