A Graph Based Subspace Semi-supervised Learning Framework for Dimensionality Reduction

Authors:
Wuyi Yang;Shuwu Zhang;Wei Liang
Affiliations:
Digital Content Technology Research Center, Institute of Automation, Chinese Academy of Sciences, Beijing, China 100190;Digital Content Technology Research Center, Institute of Automation, Chinese Academy of Sciences, Beijing, China 100190;Digital Content Technology Research Center, Institute of Automation, Chinese Academy of Sciences, Beijing, China 100190
Venue:
ECCV '08 Proceedings of the 10th European Conference on Computer Vision: Part II
Year:
2008

Citing 0
Cited 3

Local margin based semi-supervised discriminant embedding for visual recognition

Neurocomputing
Image categorization using directed graphs

ECCV'10 Proceedings of the 11th European conference on computer vision conference on Computer vision: Part III
Semi-supervised classification based on random subspace dimensionality reduction

Pattern Recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

The key to the graph based semi-supervised learning algorithms for classification problems is how to construct the weight matrix of the p-nearest neighbor graph. A new method to construct the weight matrix is proposed and a graph based Subspace Semi-supervised Learning Framework (SSLF) is developed. The Framework aims to find an embedding transformation which respects the discriminant structure inferred from the labeled data, as well as the intrinsic geometrical structure inferred from both the labeled and unlabeled data. By utilizing this framework as a tool, we drive three semi-supervised dimensionality reduction algorithms: Subspace Semi-supervised Linear Discriminant Analysis (SSLDA), Subspace Semi-supervised Locality Preserving Projection (SSLPP), and Subspace Semi-supervised Marginal Fisher Analysis (SSMFA). The experimental results on face recognition demonstrate our subspace semi-supervised algorithms are able to use unlabeled samples effectively.