| 近邻传播半监督聚类算法的并行计算 |
| |
| 引用本文： | 李雪梅,王立宏,宋宜斌.近邻传播半监督聚类算法的并行计算[J].计算机工程与应用,2011,47(7):149-152. |
| |
| 作者姓名： | 李雪梅 王立宏 宋宜斌 |
| |
| 作者单位： | 烟台大学计算机学院,山东,烟台,264005 |
| |
| 摘 要： | 提出了一种基于近邻传播的半监督聚类算法的并行算法PSAP，给出了约束的转换过程并结合实例进行说明。在UCI数据集上的实验表明：PSAP算法的运行时间约为SAP算法运行时间的1/8~1/4，聚类结果同时有提高。
|
| 关 键 词： | 近邻传播 约束变换 并行计算 |
| 修稿时间： | |
Parallel computation of semi-supervised clustering algorithm based on affinity propagation |
| |
| LI Xuemei,WANH Lihong,SONG Yibin.Parallel computation of semi-supervised clustering algorithm based on affinity propagation[J].Computer Engineering and Applications,2011,47(7):149-152. |
| |
| Authors: | LI Xuemei WANH Lihong SONG Yibin |
| |
| Affiliation: | School of Computer Science & Technology,Yantai University,Yantan,Shandong 264005,China |
| |
| 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. |
| |
| Keywords: | affinity propagation constraints transformation parallel computation |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
|
