本文已被：浏览 1756次 下载 4785次
Received:November 03, 2009 Revised:December 06, 2009
Received:November 03, 2009 Revised:December 06, 2009
中文摘要: 针对Science杂志上提出的仿射传播（Affinity propagation）聚类产生指定类数的聚类结果时效率较低的问题，提出了基于多网格策略的快速算法。该算法采用多网格搜索策略来减少调用仿射传播算法的次数，改进偏向参数的上界以缩小搜索范围。新方法大幅度地提高了仿射传播聚类在指定类数下的速度性能。实验结果表明新方法十分有效，在运行时间上比现有方法减少了22%－90%。
中文关键词: 快速聚类 指定类数的聚类 affinity propagation
Abstract: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.
文章编号： 中图分类号： 文献标志码：
基金项目:福建省教育厅项目(JA09043)
| Author Name | Affiliation |
| WANG Kai-Jun | 福建师范大学 数学与计算机学院 福建 福州350108 |
| ZHENG Jie |
| Author Name | Affiliation |
| WANG Kai-Jun | 福建师范大学 数学与计算机学院 福建 福州350108 |
| ZHENG Jie |
引用文本：
王开军,郑捷.指定类数下仿射传播聚类的快速算法①.计算机系统应用,2010,19(7):207-209
WANG Kai-Jun,ZHENG Jie.Fast Algorithm of Affinity Propagation Clustering under Given Number of Clusters.COMPUTER SYSTEMS APPLICATIONS,2010,19(7):207-209
王开军,郑捷.指定类数下仿射传播聚类的快速算法①.计算机系统应用,2010,19(7):207-209
WANG Kai-Jun,ZHENG Jie.Fast Algorithm of Affinity Propagation Clustering under Given Number of Clusters.COMPUTER SYSTEMS APPLICATIONS,2010,19(7):207-209
