一种基于模糊核聚类的谱聚类算法  

A Spectral Clustering Algorithm Based on Fuzzy Kernel Clustering

作　　者：范子静 罗泽[1] 马永征[2] 

机构地区：[1]中国科学院计算机网络信息中心,北京100190 [2]中国互联网络信息中心,北京100190

出　　处：《计算机工程》2017年第11期161-165,172,共6页Computer Engineering

基　　金：国家自然科学基金(61361126011)

摘　　要：谱聚类是对样本拉普拉斯矩阵的特征向量进行聚类,不局限于原始数据的分布形状,可收敛于全局最优解,但不能准确反映样本间的实际关系,而模糊核聚类可利用模糊数学理论确定样本间的模糊关系。为此,在调整相似度度量函数和距离度量函数的基础上,将模糊核聚类融合到谱聚类算法中,提出SC-KFCM算法,利用模糊划分改进谱聚类中的硬划分,根据特征向量间的相似性和关联程度建立模糊隶属关系并对样本进行聚类,从而弥补谱聚类中硬划分部分对聚类结果造成的影响。实验结果表明,SC-KFCM算法在不同分布特点及维数的数据集上均取得了较稳定的聚类结果和较高的聚类精度。Spectral clustering eigenvector of the Laplace matrix is not limited to the distribution shape of the original data and can converge to the global optimal solution,but it cannot accurately reflect the actual relationship between samples. However,fuzzy kernel clustering can use fuzzy mathematics theory to determine the fuzzy relations among samples. For this purpose,this paper merges the fuzzy kernel clustering into spectral clustering algorithm and puts forward SC-KFCM algorithm on the basis of the adjustment of a similarity measure function and distance measurement function,which can make up for the impact that hard part in spectral clustering brings to the clustering results. It uses fuzzy partition to improve hard part in spectral clustering through establishing fuzzy subordinate relations and utilizes the degree of similarity and correlation between eigenvector among clustering samples to improve the hard part in spectral clustering.The experimental results prove that SC-KFCM has more stable clustering results and higher clustering accuracy on data utilizes sets of different distribution characteristic and different dimensions.

关 键 词：聚类分析 谱聚类 距离度量 模糊核聚类 模糊集 隶属度 核函数 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]