Constraint scores for semi-supervised feature selection: A comparative study

Mariam Kallakech (1) , Philippe Biela (1) , Ludovic Macaire (1) , Denis Hamad (2)

1 LAGIS-SI
2 LISIC - Laboratoire d'Informatique Signal et Image de la Côte d'Opale

Recent feature selection scores using pairwise constraints (must-link and cannot-link) have shown better performances than the unsupervised methods and comparable to the supervised ones. However, these scores use only the pairwise constraints and ignore the available information brought by the unlabeled data. Moreover, these constraint scores strongly depend on the given must-link and cannot-link subsets built by the user. In this paper, we address these problems and propose a new semi-supervised constraint score that uses both pairwise constraints and local properties of the unlabeled data. Experiments using Kendall's coefficient and accuracy rates, show that this new score is less sensitive to the given constraints than the previous scores while providing similar performances.

Domaines: Apprentissage [cs.LG]

Mariam Kallakech, Philippe Biela, Ludovic Macaire, Denis Hamad. Constraint scores for semi-supervised feature selection: A comparative study. Pattern Recognition Letters, 2011, 32 (5), pp.656-665. ⟨10.1016/j.patrec.2010.12.014⟩. ⟨hal-00732484⟩