Sciweavers

13 search results - page 1 / 3
» Model Selection by Bootstrap Penalization for Classification
Sort
View
COLT
2004
Springer
13 years 8 months ago
Model Selection by Bootstrap Penalization for Classification
We consider the binary classification problem. Given an i.i.d. sample drawn from the distribution of an X
Magalie Fromont
BMCBI
2011
12 years 8 months ago
Elastic SCAD as a novel penalization method for SVM classification tasks in high-dimensional data
Background: Classification and variable selection play an important role in knowledge discovery in highdimensional data. Although Support Vector Machine (SVM) algorithms are among...
Natalia Becker, Grischa Toedt, Peter Lichter, Axel...
COLT
2004
Springer
13 years 8 months ago
Oracle Bounds and Exact Algorithm for Dyadic Classification Trees
This paper introduces a new method using dyadic decision trees for estimating a classification or a regression function in a multiclass classification problem. The estimator is bas...
Gilles Blanchard, Christin Schäfer, Yves Roze...
JMLR
2010
104views more  JMLR 2010»
12 years 11 months ago
Increasing Feature Selection Accuracy for L1 Regularized Linear Models
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...
Abhishek Jaiantilal, Gregory Z. Grudic
ECCV
2006
Springer
14 years 6 months ago
Sampling Representative Examples for Dimensionality Reduction and Recognition - Bootstrap Bumping LDA
Abstract. We present a novel method for dimensionality reduction and recognition based on Linear Discriminant Analysis (LDA), which specifically deals with the Small Sample Size (S...
Hui Gao, James W. Davis