Spectral clustering: A semi-supervised approach

Authors:
Weifu Chen;Guocan Feng
Affiliations:
School of Mathematics and Computational Science, Sun Yat-sen University, 510275 Guangzhou, China and Guangdong Province Key Laboratory of Computational Science, Guangzhou, China;School of Mathematics and Computational Science, Sun Yat-sen University, 510275 Guangzhou, China and Guangdong Province Key Laboratory of Computational Science, Guangzhou, China
Venue:
Neurocomputing
Year:
2012

Citing 21
Cited 0

Min-cut clustering

Mathematical Programming: Series A and B
Data clustering: a review

ACM Computing Surveys (CSUR)
Normalized Cuts and Image Segmentation

IEEE Transactions on Pattern Analysis and Machine Intelligence
A Database for Handwritten Text Recognition Research

IEEE Transactions on Pattern Analysis and Machine Intelligence
Constrained K-means Clustering with Background Knowledge

ICML '01 Proceedings of the Eighteenth International Conference on Machine Learning
From Instance-level Constraints to Space-Level Constraints: Making the Most of Prior Knowledge in Data Clustering

ICML '02 Proceedings of the Nineteenth International Conference on Machine Learning
A Min-max Cut Algorithm for Graph Partitioning and Data Clustering

ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Segmentation by Grouping Junctions

CVPR '98 Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
Laplacian Eigenmaps for dimensionality reduction and data representation

Neural Computation
Segmentation Using Eigenvectors: A Unifying View

ICCV '99 Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2
Cluster ensembles --- a knowledge reuse framework for combining multiple partitions

The Journal of Machine Learning Research
Multiclass Spectral Clustering

ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
Cluster Analysis for Gene Expression Data: A Survey

IEEE Transactions on Knowledge and Data Engineering
Spectral Segmentation with Multiscale Graph Decomposition

CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02
Learning Spectral Clustering, With Application To Speech Separation

The Journal of Machine Learning Research
A tutorial on spectral clustering

Statistics and Computing
Weighted Graph Cuts without Eigenvectors A Multilevel Approach

IEEE Transactions on Pattern Analysis and Machine Intelligence
Spectral learning

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
A regularized formulation for spectral clustering with pairwise constraints

IJCNN'09 Proceedings of the 2009 international joint conference on Neural Networks
Flexible constrained spectral clustering

Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Semi-supervised Graph Learning: Near Strangers or Distant Relatives

ICPR '10 Proceedings of the 2010 20th International Conference on Pattern Recognition

Quantified Score

Hi-index	0.01

Visualization

Abstract

Recently, graph-based spectral clustering algorithms have been developing rapidly, which are proposed as discrete combinatorial optimization problems and approximately solved by relaxing them into tractable eigenvalue decomposition problems. In this paper, we first review the current existing spectral clustering algorithms in a unified-framework way and give a straightforward explanation about spectral clustering. We also present a novel model for generalizing the unsupervised spectral clustering to semi-supervised spectral clustering. Under this model, prior information given by some instance-level constraints can be generalized to space-level constraints. We find that (undirected) graph built on the enlarged prior information is more meaningful, hence the boundaries of the clusters are more correct. Experimental results based on toy data, real-world data and image segmentation demonstrate the advantages of the proposed model.