Sciweavers

120 search results - page 8 / 24
» Convex Principal Feature Selection
Sort
View
NIPS
2007
13 years 9 months ago
Hierarchical Penalization
Hierarchical penalization is a generic framework for incorporating prior information in the fitting of statistical models, when the explicative variables are organized in a hiera...
Marie Szafranski, Yves Grandvalet, Pierre Morizet-...
ESANN
2006
13 years 9 months ago
Random Forests Feature Selection with K-PLS: Detecting Ischemia from Magnetocardiograms
Random Forests were introduced by Breiman for feature (variable) selection and improved predictions for decision tree models. The resulting model is often superior to AdaBoost and ...
Long Han, Mark J. Embrechts, Boleslaw K. Szymanski...
PKDD
2009
Springer
88views Data Mining» more  PKDD 2009»
14 years 2 months ago
Feature Weighting Using Margin and Radius Based Error Bound Optimization in SVMs
The Support Vector Machine error bound is a function of the margin and radius. Standard SVM algorithms maximize the margin within a given feature space, therefore the radius is fi...
Huyen Do, Alexandros Kalousis, Melanie Hilario
ICML
2006
IEEE
14 years 8 months ago
Optimal kernel selection in Kernel Fisher discriminant analysis
In Kernel Fisher discriminant analysis (KFDA), we carry out Fisher linear discriminant analysis in a high dimensional feature space defined implicitly by a kernel. The performance...
Seung-Jean Kim, Alessandro Magnani, Stephen P. Boy...
CORR
2010
Springer
221views Education» more  CORR 2010»
13 years 5 months ago
Reduction of Feature Vectors Using Rough Set Theory for Human Face Recognition
In this paper we describe a procedure to reduce the size of the input feature vector. A complex pattern recognition problem like face recognition involves huge dimension of input ...
Debotosh Bhattacharjee, Dipak Kumar Basu, Mita Nas...