Sciweavers

99 search results - page 7 / 20
» Feature Selection by Transfer Learning with Linear Regulariz...
Sort
View
NIPS
2001
13 years 9 months ago
Global Coordination of Local Linear Models
High dimensional data that lies on or near a low dimensional manifold can be described by a collection of local linear models. Such a description, however, does not provide a glob...
Sam T. Roweis, Lawrence K. Saul, Geoffrey E. Hinto...
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...
SDM
2008
SIAM
117views Data Mining» more  SDM 2008»
13 years 9 months ago
A Feature Selection Algorithm Capable of Handling Extremely Large Data Dimensionality
With the advent of high throughput technologies, feature selection has become increasingly important in a wide range of scientific disciplines. We propose a new feature selection ...
Yijun Sun, Sinisa Todorovic, Steve Goodison
JMLR
2011
192views more  JMLR 2011»
13 years 2 months ago
Minimum Description Length Penalization for Group and Multi-Task Sparse Learning
We propose a framework MIC (Multiple Inclusion Criterion) for learning sparse models based on the information theoretic Minimum Description Length (MDL) principle. MIC provides an...
Paramveer S. Dhillon, Dean P. Foster, Lyle H. Unga...
ICCV
2007
IEEE
14 years 9 months ago
Linear Predictors for Fast Simultaneous Modeling and Tracking
An approach for fast tracking of arbitrary image features with no prior model and no offline learning stage is presented. Fast tracking is achieved using banks of linear displacem...
Liam Ellis, Nicholas Dowson, Jiri Matas, Richard B...