Sciweavers

1860 search results - page 38 / 372
» Boosting Methods for Regression
Sort
View
DEXAW
2010
IEEE
196views Database» more  DEXAW 2010»
13 years 10 months ago
Direct Optimization of Evaluation Measures in Learning to Rank Using Particle Swarm
— One of the central issues in Learning to Rank (L2R) for Information Retrieval is to develop algorithms that construct ranking models by directly optimizing evaluation measures ...
Ósscar Alejo, Juan M. Fernández-Luna...
IJCAI
2003
13 years 11 months ago
Constructing Diverse Classifier Ensembles using Artificial Training Examples
Ensemble methods like bagging and boosting that combine the decisions of multiple hypotheses are some of the strongest existing machine learning methods. The diversity of the memb...
Prem Melville, Raymond J. Mooney
EJASMP
2011
13 years 1 months ago
Phoneme and Sentence-Level Ensembles for Speech Recognition
We address the question of whether and how boosting and bagging can be used for speech recognition. In order to do this, we compare two different boosting schemes, one at the pho...
Christos Dimitrakakis, Samy Bengio
CVPR
2009
IEEE
14 years 1 months ago
Efficiently training a better visual detector with sparse eigenvectors
Face detection plays an important role in many vision applications. Since Viola and Jones [1] proposed the first real-time AdaBoost based object detection system, much effort has ...
Sakrapee Paisitkriangkrai, Chunhua Shen, Jian Zhan...
KDD
2007
ACM
148views Data Mining» more  KDD 2007»
14 years 10 months ago
Scalable look-ahead linear regression trees
Most decision tree algorithms base their splitting decisions on a piecewise constant model. Often these splitting algorithms are extrapolated to trees with non-constant models at ...
David S. Vogel, Ognian Asparouhov, Tobias Scheffer