%0 Journal Article
%T Fast Algorithm of Affinity Propagation Clustering under Given Number of Clusters<br>指定类数下仿射传播聚类的快速算法①
%A WANG Kai-Jun
%A ZHENG Jie
%A <br>王开军
%A 郑捷
%J 计算机系统应用
%D 2010
%I 
%X To enhance the low efficiency of producing the clustering result with given number of clusters by Affinity propagation clustering (AP), the fast multi-grid searching method is proposed. The proposed method uses multi-grid searching to reduce the calling times of AP, and improves the upper bound of preference parameter to reduce the searching scope, so that it can largely enhance the speed performance of AP under given number of clusters. The experimental results show that the proposed method is very effective and reduces the running time by 22%-90%, compared with the existing method.
%K fast clustering
%K clustering under given number of clusters
%K affinity propagation<br>快速聚类
%K 指定类数的聚类
%K affinity
%K propagation
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=D4F6864C950C88FFCE5B6C948A639E39&aid=338C0A62F8BEEF0CA2A18A6F29699811&yid=140ECF96957D60B2&vid=2A8D03AD8076A2E3&iid=94C357A881DFC066&sid=334E2BB8B9A55ABB&eid=79D2EF35F60110C2&journal_id=1003-3254&journal_name=计算机系统应用&referenced_num=0&reference_num=7