Efficient semi-supervised feature selection by an ensemble approach
Résumé
Constrained Laplacian Score (CLS) is a recently proposed method for semi-supervised feature selection. It presented an outperforming performance comparing to other methods in the state of the art. This is because CLS exploits both unsupervised and supervised parts of data for selecting the most relevant features. However, the choice of the little supervision information (represented by pairwise constraints) is still a critical issue. In fact, constraints are proven to have some noise which may deteriorate the learning performance. In this paper we try to override any negative e ects of constraints set by the variation of their sources. This is done by an ensemble technique using both a resampling of data (bagging) and a random subspace strategy. The proposed approach generates a global ranking of features by aggregating multiple Constraint Laplacian Scores on di erent views of the available labeled and unlabeled data . We validate our approach by empirical experiments over high-dimensional datasets and compare it with other representative methods.