首页 | 官方网站   微博 | 高级检索  
     

基于密度自适应邻域相似图的半监督谱聚类
引用本文:刘友超,张曦煌.基于密度自适应邻域相似图的半监督谱聚类[J].计算机应用研究,2020,37(9):2604-2609.
作者姓名:刘友超  张曦煌
作者单位:江南大学 物联网工程学院,江苏 无锡214122;江南大学 物联网工程学院,江苏 无锡214122
摘    要:谱聚类是基于谱图划分理论的一种聚类算法,传统的谱聚类算法属于无监督学习算法,只能利用单一数据来进行聚类。针对这种情况,提出一种基于密度自适应邻域相似图的半监督谱聚类(DAN-SSC)算法。DAN-SSC算法在传统谱聚类算法的基础上结合了半监督学习的思想,很好地解决了传统谱聚类算法无法充分利用所有数据,不得不对一些有标签数据进行舍弃的问题;将少量的成对约束先验信息扩散至整个空间,使其能更好地对聚类过程进行指导。实验结果表明,DAN-SSC算法具有可行性和有效性。

关 键 词:谱聚类  密度自适应邻域  相似图  半监督学习
收稿时间:2019/4/16 0:00:00
修稿时间:2020/7/28 0:00:00

Semi-supervised spectral clustering based on density adaptive neighbor similarity graph
Liu Youchao and Zhang Xihuang.Semi-supervised spectral clustering based on density adaptive neighbor similarity graph[J].Application Research of Computers,2020,37(9):2604-2609.
Authors:Liu Youchao and Zhang Xihuang
Affiliation:School of Internet of Things Engineering,Jiangnan University,
Abstract:The spectral clustering is a clustering algorithm based on the theory of spectral partitioning. The traditional spectral clustering algorithm belongs to unsupervised learning algorithms and can only utilize a single type of data to cluster. Based on the situation, this paper proposed a semi-supervised spectral clustering algorithm based on density adaptive neighbor similarity graph(DAN-SSC). DAN-SSC algorithm combined the idea of semi-supervised learning on the basis of the traditional spectral clustering algorithm, it solved the problem that the traditional spectral clustering algorithm couldn''t fully utilize all the data and had to abandon some labeled data. It also spread a small amount of pairwise constrained prior information to the entire space and made it guide the process of clustering better. The results of experiments show that the proposed algorithm is feasible and effective.
Keywords:spectral clustering  density adaptive neighbor  similarity graph  semi-supervised learning
本文献已被 万方数据 等数据库收录!
点击此处可从《计算机应用研究》浏览原始摘要信息
点击此处可从《计算机应用研究》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号