Summary of Affinity Propagation

Abstract:

Article Preview

Affinity Propagation(AP)is a new clustering algorithm, which is based on the similarity matrix between pairs of data points and messages are exchanged between data points until clustering result emerges. It is efficient and fast , and it can solve the clustering on large data sets. But the traditional Affinity Propagation has many limitations, this paper introduces the Affinity Propagation, and analyzes in depth the advantages and limitations of it, focuses on the improvements of the algorithm — improve the similarity matrix, adjust the preference and the damping-factor, combine with other algorithms. Finally, discusses the development of Affinity Propagation.

Info:

Periodical:

Advanced Materials Research (Volumes 268-270)

Edited by:

Feng Xiong

Pages:

811-816

DOI:

10.4028/www.scientific.net/AMR.268-270.811

Citation:

Y. Zhou and Y. Xing, "Summary of Affinity Propagation", Advanced Materials Research, Vols. 268-270, pp. 811-816, 2011

Online since:

July 2011

Authors:

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.