Constraint Score: A new filter method for feature selection with pairwise constraints

  • Zhang D
  • Chen S
  • Zhou Z
  • 41

    Readers

    Mendeley users who have this article in their library.
  • 118

    Citations

    Citations of this article.

Abstract

Feature selection is an important preprocessing step in mining high-dimensional data. Generally, supervised feature selection methods with supervision information are superior to unsupervised ones without supervision information. In the literature, nearly all existing supervised feature selection methods use class labels as supervision information. In this paper, we propose to use another form of supervision information for feature selection, i.e. pairwise constraints, which specifies whether a pair of data samples belong to the same class (must-link constraints) or different classes (cannot-link constraints). Pairwise constraints arise naturally in many tasks and are more practical and inexpensive than class labels. This topic has not yet been addressed in feature selection research. We call our pairwise constraints guided feature selection algorithm as Constraint Score and compare it with the well-known Fisher Score and Laplacian Score algorithms. Experiments are carried out on several high-dimensional UCI and face data sets. Experimental results show that, with very few pairwise constraints, Constraint Score achieves similar or even higher performance than Fisher Score with full class labels on the whole training data, and significantly outperforms Laplacian Score. © 2007 Elsevier Ltd. All rights reserved.

Author-supplied keywords

  • Constraint Score
  • Feature selection
  • Filter method
  • Fisher Score
  • Laplacian Score
  • Pairwise constraints

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • Daoqiang Zhang

  • Songcan Chen

  • Zhi Hua Zhou

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free