Affinity propagation clustering using path based similarity (Q1736814): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: UCI-ml / rank | |||
Normal rank |
Revision as of 06:42, 28 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Affinity propagation clustering using path based similarity |
scientific article |
Statements
Affinity propagation clustering using path based similarity (English)
0 references
26 March 2019
0 references
Summary: Clustering is a fundamental task in data mining. Affinity propagation clustering (APC) is an effective and efficient clustering technique that has been applied in various domains. APC iteratively propagates information between affinity samples, updates the responsibility matrix and availability matrix, and employs these matrices to choose cluster centers (or exemplars) of respective clusters. However, since it mainly uses negative Euclidean distance between exemplars and samples as the similarity between them, it is difficult to identify clusters with complex structure. Therefore, the performance of APC deteriorates on samples distributed with complex structure. To mitigate this problem, we propose an improved APC based on a path-based similarity (APC-PS). APC-PS firstly utilizes negative Euclidean distance to find exemplars of clusters. Then, it employs the path-based similarity to measure the similarity between exemplars and samples, and to explore the underlying structure of clusters. Next, it assigns non-exemplar samples to their respective clusters via that similarity. Our empirical study on synthetic and UCI datasets shows that the proposed APC-PS significantly outperforms original APC and other related approaches.
0 references
clustering
0 references
affinity propagation
0 references
path-based similarity
0 references
complex structure
0 references