On Expanded and Improved Affinity Propagation Clustering Algorithm

Xin Quan Chen

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

Paper Titles

New Delay-Dependent Stability Criteria for Systems with Interval Time-Varying Delay
p.734

Noisy Immune Optimization for Chance-Constrained Programming Problems
p.740

Nonlinear Time Series Prediction Using High Precision Neural Network
p.745

Obstacle Detection for Patrol Robot Using Bumblebee2 Stereo Vision System
p.749

On Expanded and Improved Affinity Propagation Clustering Algorithm
p.753

On Synchronous Balancing System of Huge-Scale Hydraulic Press’s Moving Beam Based on Fuzzy Self-Tuning PID Controller
p.757

On the Study of Automatic NC-Code Programming Based on DXF Files
p.767

Online Monitoring ICE Powers Based on the Crankshaft Angular Vibration
p.773

Optimal Design of Integral Steering Linkage Based on Matlab/Simulink
p.779

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 48-49On Expanded and Improved Affinity Propagation...

On Expanded and Improved Affinity Propagation Clustering Algorithm

Abstract:

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.

You might also be interested in these eBooks

Measuring Technology and Mechatronics Automation

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 48-49)

Pages:

753-756

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.48-49.753

Citation:

Cite this paper

Online since:

February 2011

Authors:

Xin Quan Chen

Keywords:

Affinity Propagation, Dissimilarity Measure, Grid Cell, Near Neighbour Sampling

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Tan P.N., Steinbach. M, Kumar V, in: Introduction to data mining [M]. Pearson Education, (2006).

Google Scholar

[2] Ester, H. -P. Kriegel, J. Sander, X. Xu, in: A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise [C]. The 2nd KDD, Portland, Oregon, USA, (1996).

Google Scholar

[3] Wang W., Yang J., Muntz R. STING, in: a statistical information grid approach to spatial data mining [C]. The 23rd VLDB. Athens: Morgan Kaufmann, 1997, 186-195.

Google Scholar

[4] Agrawal R., Gehrke J., et al, in: Automatic subspace clustering of high dimensional data for data mining applications [C]. In ACM SIGMOD ICMD. Seattle: ACM Press, 1998. 94-105.

DOI: 10.1145/276305.276314

Google Scholar

[5] Brendan J. Frey, Delbert Dueck, in: Clustering by Passing Messages Between Data Points [J]. Science, 2007, 315(16): 972-976.

DOI: 10.1126/science.1136800

Google Scholar

[6] Chen Xinquan, in: Clustering Based on Near Neighbour Point Set [EB/OL], http: /www. paper. edu. cn, No: 200912-254, (2009).

Google Scholar