4.6 Article

Research of semi-supervised spectral clustering based on constraints expansion

期刊

NEURAL COMPUTING & APPLICATIONS
卷 22, 期 -, 页码 S405-S410

出版社

SPRINGER
DOI: 10.1007/s00521-012-0911-8

关键词

Semi-supervised learning; Pairwise constraint; Semi-supervised spectral clustering; Distance matrix

资金

  1. National Natural Science Foundation of China [41074003, 60975039]
  2. Opening Foundation of Key Laboratory of Intelligent Information Processing of Chinese Academy of Sciences [IIP2010-1]

向作者/读者索取更多资源

Semi-supervised learning has become one of the hotspots in the field of machine learning in recent years. It is successfully applied in clustering and improves the clustering performance. This paper proposes a new clustering algorithm, called semi-supervised spectral clustering based on constraints expansion (SSCCE). This algorithm expands the known constraints set, changes the similarity relation of the sample points through the density-sensitive path distance, and then combines with semi-supervised spectral clustering to cluster. The experimental results prove that SSCCE algorithm has good clustering effect.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据