期刊名称：International Journal of Innovative Research in Computer and Communication Engineering
印刷版ISSN：2320-9798
电子版ISSN：2320-9801
出版年度：2015
卷号：3
期号：10
DOI：10.15680/IJIRCCE.2015.0310051
出版社：S&S Publications
摘要：Affinity Propagation (AP) is a clustering algorithm based on the concept of message passing. Unlike clustering algorithms such as k-means or k-medoids , AP does not require the number of clusters to be determined or estimated before running the algorithm. This paper deals with how to apply AP in incremental clustering problems. Here we use two clustering algorithms: Incremental AP based on K -Medoids (IAPKM) and Incremental AP based on Nearest Neighbour Assignment (IAPNA). However, a large number of features in the dataset may consume a lot of time. Therefore, we use a binary krill herd algorithm for feature selection, which help to reduce execution time and also increase the accuracy
