4.6 Article

Research of semi-supervised spectral clustering based on constraints expansion

Journal

NEURAL COMPUTING & APPLICATIONS
Volume 22, Issue -, Pages S405-S410

Publisher

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

Keywords

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

Funding

  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]

Ask authors/readers for more resources

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.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available