.png){kind=icon}
.png){kind=icon}
Return
Subspace clustering using affinity propagation
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2014.11.003.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper proposes a subspace clustering algorithm by introducing attribute weights in the affinity propagation algorithm. A new step is introduced to the affinity propagation process to iteratively update the attribute weights based on the current partition of the data. The relative magnitude of the attribute weights can be used to identify the subspaces in which clusters are embedded. Experiments on both synthetic data and real data show that the new algorithm outperforms the affinity propagation algorithm in recovering clusters from data. (C) 2014 Elsevier Ltd. All rights reserved.
Keywords:
Data clustering
Subspace clustering
Affinity propagation
Attribute weighting
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.6
Papers:
1.3W
Citations:
4.5W