Semi-supervised classification based on random subspace dimensionality reduction

作者:

Highlights:

摘要

Graph structure is vital to graph based semi-supervised learning. However, the problem of constructing a graph that reflects the underlying data distribution has been seldom investigated in semi-supervised learning, especially for high dimensional data. In this paper, we focus on graph construction for semi-supervised learning and propose a novel method called Semi-Supervised Classification based on Random Subspace Dimensionality Reduction, SSC-RSDR in short. Different from traditional methods that perform graph-based dimensionality reduction and classification in the original space, SSC-RSDR performs these tasks in subspaces. More specifically, SSC-RSDR generates several random subspaces of the original space and applies graph-based semi-supervised dimensionality reduction in these random subspaces. It then constructs graphs in these processed random subspaces and trains semi-supervised classifiers on the graphs. Finally, it combines the resulting base classifiers into an ensemble classifier. Experimental results on face recognition tasks demonstrate that SSC-RSDR not only has superior recognition performance with respect to competitive methods, but also is robust against a wide range of values of input parameters.

论文关键词:Graph construction,Semi-supervised classification,Random subspaces,Dimensionality reduction,Ensembles of classifiers

论文评审过程:Received 24 January 2011, Revised 20 April 2011, Accepted 20 August 2011, Available online 30 August 2011.

论文官网地址:https://doi.org/10.1016/j.patcog.2011.08.024