articleDec 5, 2005Closed access

Laplacian Score for Feature Selection

University of Chicago · University of Illinois Urbana-Champaign

Abstract

In supervised learning scenarios, feature selection has been studied widely in the literature. Selecting features in unsupervised learning scenarios is a much harder problem, due to the absence of class labels that would guide the search for relevant information. And, almost all of previous unsupervised feature selection methods are “wrapper ” techniques that require a learning algorithm to evaluate the candidate feature subsets. In this paper, we propose a “filter ” method for feature selection which is independent of any learning algorithm. Our method can be performed in either supervised or unsupervised fashion. The proposed method is based on the observation that, in many real world classification…

Citation impact

1,772
total citations
FWCI
5.97
Percentile
100%
References
6
Citations per year

Authors

3

Topics & keywords

Keywords
  • Artificial intelligence
  • Computer science
  • Feature selection
  • Pattern recognition (psychology)
  • Feature (linguistics)
  • Machine learning
  • Unsupervised learning
  • Locality
No related works found for this paper.