Local and global approaches of affinity propagation clustering for large scale data

Computer Science – Learning

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

9 pages

Scientific paper

10.1631/jzus.A0720058

Recently a new clustering algorithm called 'affinity propagation' (AP) has been proposed, which efficiently clustered sparsely related data by passing messages between data points. However, we want to cluster large scale data where the similarities are not sparse in many cases. This paper presents two variants of AP for grouping large scale data with a dense similarity matrix. The local approach is partition affinity propagation (PAP) and the global method is landmark affinity propagation (LAP). PAP passes messages in the subsets of data first and then merges them as the number of initial step of iterations; it can effectively reduce the number of iterations of clustering. LAP passes messages between the landmark data points first and then clusters non-landmark data points; it is a large global approximation method to speed up clustering. Experiments are conducted on many datasets, such as random data points, manifold subspaces, images of faces and Chinese calligraphy, and the results demonstrate that the two approaches are feasible and practicable.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Local and global approaches of affinity propagation clustering for large scale data does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Local and global approaches of affinity propagation clustering for large scale data, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Local and global approaches of affinity propagation clustering for large scale data will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-50748

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.