基于变精度粗糙集的FCM聚类算法  

An FCM Algorithm based on Variable Precision Rough Sets

作　　者：张佩[1] 张清华[1,2] 

机构地区：[1]重庆邮电大学计算智能重庆市重点实验室,重庆400065 [2]重庆邮电大学理学院,重庆400065

出　　处：《山西大学学报（自然科学版）》2016年第3期342-348,共7页Journal of Shanxi University(Natural Science Edition)

基　　金：国家自然科学基金(61472056);重庆市自然科学基金(cstc2012jjA40047)

摘　　要：传统的模糊C均值聚类(FCM)算法具有简单、稳定和高效等特点,但在噪声点较多的情况下容易受噪声影响,使得算法效率降低。文章结合变精度粗糙集模型,提出一种改进的FCM算法,该算法利用变精度粗糙集模型刻画不确定集合上近似集和下近似集的原理,将经过聚类算法后的类簇边缘范围中的对象根据变精度粗糙集的阈值特性划分为正域、负域、边界域三个部分,使得聚类的准确率得到提升。仿真实验结果表明该算法使得聚类结果更加清晰,在边界域较模糊的情况下聚类准确率比传统FCM算法有一定的提高。The traditional fuzzy C-means algorithm （FCM） is simple, stable and efficient, however, it is easy to be affected by the noise, which makes the efficiency of the algorithm reduced. An improved FCM algorithm based on variable precision rough sets model is introduced. The upper and lower approximation sets of the variable precision rough sets model are used in the algorithm. According to the different threshold of the variable precision rough sets, the objects in the edge range are divided into three regions, positive region, negative region and boundary region,and the accuracy of algorithm is then improveal. The experimental results show that the algorithm makes the clustering results more clear, and the clustering accuracy is better than that of the traditional FCM algorithm in the case of fuzzy boundary region.

关 键 词：FCM聚类算法 变精度粗糙集 上近似集 下近似集 阈值 

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