Next Article in Journal
A Hybrid Course Recommendation System by Integrating Collaborative Filtering and Artificial Immune Systems
Previous Article in Journal
Designing a Framework to Improve Time Series Data of Construction Projects: Application of a Simulation Model and Singular Spectrum Analysis
Article Menu

Export Article

Open AccessArticle
Algorithms 2016, 9(3), 46; doi:10.3390/a9030046

Affinity Propagation Clustering Using Path Based Similarity

1,†
,
1,†
and
1,2,*
1
College of Computer and Information Science, Southwest University, Chongqing 400715, China
2
Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, Jilin University, Changchun 130012, China
Current address: College of Computer and Information Science, Southwest University, Beibei, Chongqing 400715, China
*
Author to whom correspondence should be addressed.
Academic Editor: Javier Del Ser Lorente
Received: 11 June 2016 / Revised: 12 July 2016 / Accepted: 18 July 2016 / Published: 21 July 2016
View Full-Text   |   Download PDF [1035 KB, uploaded 21 July 2016]   |  

Abstract

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. View Full-Text
Keywords: clustering; affinity propagation; path-based similarity; complex structure clustering; affinity propagation; path-based similarity; complex structure
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Jiang, Y.; Liao, Y.; Yu, G. Affinity Propagation Clustering Using Path Based Similarity. Algorithms 2016, 9, 46.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top