On Expanded and Improved Affinity Propagation Clustering Algorithm

Abstract:

Article Preview

Facing to the shortcoming of Affinity Propagation algorithm (AP), we present two expanded and improved AP algorithms. In the two algorithms, the AP algorithm based on Grid Cell (APGC) is an effective extension of AP algorithm on the level of grid cells, and the AP clustering algorithm based on Near neighbour Sampling (APNS) is trying to make some improving in time and space complexity. From some simulated comparison experiments of three algorithms, we know that APGC and APNS algorithms have evident improving than AP algorithm in time and space complexity. They can not only get a good clustering quality for massive data sets, but also filtrate noises and isolates well. So we can say they are two effective clustering algorithms with much applied prospect. At last, several research directions are presented.

Info:

Periodical:

Edited by:

Zhixiang Hou

Pages:

753-756

DOI:

10.4028/www.scientific.net/AMM.48-49.753

Citation:

X. Q. Chen "On Expanded and Improved Affinity Propagation Clustering Algorithm", Applied Mechanics and Materials, Vols. 48-49, pp. 753-756, 2011

Online since:

February 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.