Optimal preference detection based on golden section and genetic algorithm for affinity propagation clustering

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Affinity Propagation Clustering Algorithm is a well-known effective clustering algorithm that outperforms other traditional and classical clustering algorithms, and the selection of related sensitive parameters (preference, damping factor) is a popular research topic. In this paper, a feasible detecting procedure “GS/GA-AP” based on Golden Section and Genetic Algorithm is proposed to address the aforementioned issue. As a default option, preference is given based on golden section for Affinity Propagation. Unsatisfactory clustering result is robust with selection of preference with Genetic Algorithm. One simulation dataset and five standard benchmark datasets are utilized to verify effectiveness of algorithm we proposed, and the experiment results show that GS/GAAP outperforms traditional Affinity Propagation clustering algorithm.

Cite

CITATION STYLE

APA

Jiao, L., Zhang, G., Wang, S., Mehmood, R., & Bie, R. (2015). Optimal preference detection based on golden section and genetic algorithm for affinity propagation clustering. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9204, pp. 253–262). Springer Verlag. https://doi.org/10.1007/978-3-319-21837-3_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free