Downloads: 127 | Views: 295

M.Tech / M.E / PhD Thesis | Computer Science & Engineering | India | Volume 4 Issue 12, December 2015 | Popularity: 6.8 / 10

Rate This Article!      

Streaming Data Clustering by Incremental Affinity Propagation

Jismy Muhammed

Abstract: This paper introdused based on clustering. Affinity Propagation (AP) clustering has been successfully used in a lot of clustering problems. This paper considers how to apply AP in incremental clustering problems in streams of data. First, we point out the difficulties in Incremental Affinity Propagation (IAP) clustering, and then propose two strategies to solve them. Two IAP clustering algorithms are proposed. They are IAP clustering based on K-Medoids (IAPKM) and IAP clustering based on Nearest Neighbor Assignment (IAPNA). Traditional AP clustering is also implemented to provide benchmark performance. Experimental results show that IAPKM and IAPNA can achieve comparable clustering performance with traditional AP clustering on all the data sets. Popular labeled data sets, real world time series and a video, datastreams are used to test the performance of IAPKM and IAPNA. Both the effectiveness and the efficiency make IAPKM and IAPNA able to be well used in incremental clustering tasks.

Keywords: Affinity propagation, incremental clustering, K-medoids, nearest neighbor assignment

Edition: Volume 4 Issue 12, December 2015

Pages: 108 - 111

DOI: https://www.doi.org/10.21275/NOV151831

Make Sure to Disable the Pop-Up Blocker of Web Browser

Click to Cite this Article

Similar Articles