L1 (also referred to as the 1-norm or Lasso) penalty based formulations have been shown to be effective in problem domains when noisy features are present. However, the L1 penalty...
The NIPS 2003 workshops included a feature selection competition organized by the authors. We provided participants with five datasets from different application domains and calle...
Isabelle Guyon, Steve R. Gunn, Asa Ben-Hur, Gideon...
Kernel conditional random fields (KCRFs) are introduced as a framework for discriminative modeling of graph-structured data. A representer theorem for conditional graphical models...
Feature selection is an important aspect of solving data-mining and machine-learning problems. This paper proposes a feature-selection method for the Support Vector Machine (SVM) l...
Kai Quan Shen, Chong Jin Ong, Xiao Ping Li, Einar ...
Background: Selection of relevant genes for sample classification is a common task in most gene expression studies, where researchers try to identify the smallest possible set of ...