基于最大内聚度基准的加权投票聚类集成  

Weighted voting clustering ensemble based on maximum cohesion

作　　者：陈晓云[1] 陈刚[1] 

机构地区：[1]福州大学数学与计算机科学学院,福州350116

出　　处：《控制与决策》2014年第2期236-240,共5页Control and Decision

基　　金：国家自然科学基金项目(71273053)

摘　　要：提出一种基于投票的聚类集成方法.通过分析聚类结构与聚类准确率的关系,将内聚度最高的聚类成员作为重新标记的基准以实现簇标记的统一;同时,根据数据点在不同聚类成员中与所划分簇中心的距离确定权值,最终实现加权投票.实验结果表明,该算法在准确率和稳定性上均有较大提高.A voting-based clustering ensemble method is presented. By analyzing the relationship between the clustering structure and accuracy, the highest cohesive cluster member is considered as the benchmark of relabel algorithm to unify cluster labels. Then the voting weights are determined by the distance from cluster centers which data points in different cluster members are divide into. The experimental results show that, the proposed algorithm is greatly improved in accuracy and stability.

关 键 词：聚类集成 加权投票 内聚度 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]