基于改进流形距离的粗糙集k-means聚类算法  

Rough k-means clustering algorithm based on improved manifold distance

作　　者：欧慧[1] 夏卓群[1] 武志伟[1] 

机构地区：[1]长沙理工大学计算机与通信工程学院,长沙410114

出　　处：《计算机工程与应用》2016年第14期84-89,共6页Computer Engineering and Applications

基　　金：湖南省自然科学基金(No.14JJ7043);湖南省教育厅资助重点项目(No.14A004)

摘　　要：针对现有的基于流形距离的聚类算法对"绝对流形"数据集较"相对流形"数据集聚类效果佳和参数ρ在较大范围内变化时,聚类性能较差等问题,提出基于改进流形距离的粗糙集k-means聚类算法。该算法通过用属性划分和最大最小距离选择初始聚类中心,以改进的流形距离和粗糙集优化k-means,并结合终止判断条件以达到解决边界数据聚类问题和提升聚类效果的目的。仿真结果表明:该算法对"绝对流形"和"相对流形"数据集聚类效果均有较好改善,且参数变化对聚类性能影响较大。“Absolute manifold”dataset has better performance than the“relative manifold”one, the sick clustering perfor-mance while the parameter ρvaries with a wide range, which are the defects exited in clustering algorithm based on the manifold distance. To resolve these problems, a rough k-means clustering algorithm based on the improved manifold distance is proposed. In this algorithm, boundary data clustering problem and the clustering performance has been resolved and improved by choosing clustering center with attribute partitioning and the max-min distance method, optimizing k-means with the improved manifold distance and rough set and combining the termination of judgement conditions. The simulation results show that this algorithm can effectively improve both on the“absolute manifold”and“relative manifold”dataset clustering, and the variation of parameters has a greater impact of the clustering performance.

关 键 词：K-MEANS算法 最大最小距离 改进流形距离 粗糙集 适应度函数 

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