99 search results - page 1 / 20 » Feature Selection by Transfer Learning with Linear Regulariz... |
PKDD
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. This paper presents a novel feature selection method for classification of high dimensional data, such as those produced by microarrays. It includes a partial supervisio...
ICML
2009
IEEE
14 years 5 months ago
2009
IEEE
This paper addresses feature selection techniques for classification of high dimensional data, such as those produced by microarray experiments. Some prior knowledge may be availa...
UAI
2008
13 years 5 months ago
2008
Identifying co-varying causal elements in very high dimensional feature space with internal structures, e.g., a space with as many as millions of linearly ordered features, as one...
JMLR
2010
12 years 11 months ago
2010
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...
ICML
2010
IEEE
13 years 5 months ago
2010
IEEE
Approximate dynamic programming has been used successfully in a large variety of domains, but it relies on a small set of provided approximation features to calculate solutions re...