.png){kind=icon}
.png){kind=icon}
Return
Clustering by propagating probabilities between data points
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2016.01.034.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we propose a graph-based clustering algorithm called probability propagation, which is able to identify clusters having spherical shapes as well as clusters having non-spherical shapes. Given a set of objects, the proposed algorithm uses local densities calculated from a kernel function and a bandwidth to initialize the probability of one object choosing another object as its attractor and then propagates the probabilities until the set of attractors become stable. Experiments on both synthetic data and real data show that the proposed method performs very well as expected. (C) 2016 Elsevier B.V. All rights reserved.
Keywords:
Affinity propagation
Data clustering
Graph-based clustering
Markov clustering
Probability propagation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.6
Papers:
1.4W
Citations:
4.8W