基于共享近邻的自适应谱聚类  

Adaptive Spectral Clustering Based on Shared Nearest Neighbors

作　　者：刘馨月[1,2] 李静伟[2] 于红[1,2] 尤全增[2] 林鸿飞[1] 

机构地区：[1]计算机科学与技术学院大连理工大学,辽宁大连116024 [2]软件学院大连理工大学,辽宁大连116620

出　　处：《小型微型计算机系统》2011年第9期1876-1880,共5页Journal of Chinese Computer Systems

基　　金：国家自然科学基金项目(60873180)资助

摘　　要：谱聚类是一种极具竞争力的聚类算法.相似度定义对谱聚类算法的性能有至关重要的影响.本文用两点的共享近邻数目表征局部密度,从而获知隐含的簇结构信息.将这一信息与自调节的高斯核函数结合,提出了基于共享近邻的自适应相似度及相应的谱聚类算法.它满足聚类假设的要求,具有局部密度的自适应性,能有效识别数据点之间的内在联系.典型人工和真实数据集上的实验结果证明了算法的有效性.Spectral clustering has become one of the most popular modem clustering algorithms in recent years. Similarity measurement is crucial to the performance of spectral clustering. Through exploiting the information about local density embedded in the shared nearest neighbors, a novel similarity measure and its corresponding spectral clustering, namely adaptive spectral clustering based on shared nearest neighbors is proposed in this paper. The proposed similarity measure satisfies the clustering assumption , and can obtain different values with respect to different local densities. So it can detect the intrinsic structure of the cluster embedded in the data sets more accurately. Experimental results on both synthetic and real data sets show that it＇s an effective and feasible way to improve the performance of spectral clustering.

关 键 词：聚类 谱聚类 相似度度量 共享近邻 

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