基于投票机制的融合聚类算法  

Custer Fusion Algorithm Based on Majority Voting Mechanism

作　　者：蒋盛益[1,2] 

机构地区：[1]广东外语外贸大学信息学院 [2]广东省信息安全技术重点实验室中山大学,广东广州510275

出　　处：《小型微型计算机系统》2007年第2期306-309,共4页Journal of Chinese Computer Systems

基　　金：国家自然科学基金项目(60503048;60673191)资金;广东外语外贸大学重点项目(GW2005-1-012)资助.

摘　　要：以一趟聚类算法作为划分数据的基本算法,讨论聚类融合问题.通过重复使用一趟聚类算法划分数据,并随机选择阈值和数据输入顺序,得到不同的聚类结果,将这些聚类结果映射为模式间的关联矩阵,在关联矩阵上使用投票机制获得最终的数据划分.在真实数据集和人造数据集上检验了提出的聚类融合算法,并与相关聚类算法进行了对比,实验结果表明,文中提出的算法是有效可行的.Taking the one-pass clustering algorithm as the basic algorithm for grouping data, the issue of clustering ensemble is investigated. Over multiple clusters obtained by random threshold and sequence of data input of the one-pass clustering algorithm, produces a mapping of the clusters into an association matrix between patterns. The final data partition is obtained by voting mechanism over this association matrix. Experimental results of the proposed cluster fusion algorithm on several real and synthetic data sets are compared with clustering results produced by well known clustering algorithms. The experimental results show that the proposed algorithm is effective and practicable.

关 键 词：聚类分析 一趟聚类算法 聚类融合 投票机制 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]