计算机工程与应用 ›› 2011, Vol. 47 ›› Issue (7): 149-152.
• 数据库、信号与信息处理 • 上一篇 下一篇
李雪梅，王立宏，宋宜斌
收稿日期:
修回日期:
出版日期:
发布日期:
LI Xuemei，WANG Lihong，SONG Yibin
Received:
Revised:
Online:
Published:
摘要： 提出了一种基于近邻传播的半监督聚类算法的并行算法PSAP，给出了约束的转换过程并结合实例进行说明。在UCI数据集上的实验表明：PSAP算法的运行时间约为SAP算法运行时间的1/8~1/4，聚类结果同时有提高。
关键词: 近邻传播, 约束变换, 并行计算
Abstract: A parallel semi-supervised clustering algorithm based on affinity propagation（PSAP） is proposed and the transformation of constraints is accomplished and illustrated by an example.Simulating experiments on UCI datasets show that，the runtime of PSAP is about one eighth to one fourth of that of SAP，and the quality of clustering is improved.
Key words: affinity propagation, constraints transformation, parallel computation
李雪梅，王立宏，宋宜斌. 近邻传播半监督聚类算法的并行计算[J]. 计算机工程与应用, 2011, 47(7): 149-152.
LI Xuemei，WANG Lihong，SONG Yibin. Parallel computation of semi-supervised clustering algorithm based on affinity propagation[J]. Computer Engineering and Applications, 2011, 47(7): 149-152.
0 / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://cea.ceaj.org/CN/
http://cea.ceaj.org/CN/Y2011/V47/I7/149
