Sciweavers

13 search results - page 2 / 3
» Robust boosting and its relation to bagging
Sort
View
PAMI
2006
206views more  PAMI 2006»
13 years 8 months ago
MILES: Multiple-Instance Learning via Embedded Instance Selection
Multiple-instance problems arise from the situations where training class labels are attached to sets of samples (named bags), instead of individual samples within each bag (called...
Yixin Chen, Jinbo Bi, James Ze Wang
NIPS
2007
13 years 10 months ago
Boosting Algorithms for Maximizing the Soft Margin
We present a novel boosting algorithm, called SoftBoost, designed for sets of binary labeled examples that are not necessarily separable by convex combinations of base hypotheses....
Manfred K. Warmuth, Karen A. Glocer, Gunnar Rä...
MCS
2009
Springer
14 years 3 months ago
Improved Uniformity Enforcement in Stochastic Discrimination
There are a variety of methods for inducing predictive systems from observed data. Many of these methods fall into the field of study of machine learning. Some of the most effec...
Matthew Prior, Terry Windeatt
KDD
2005
ACM
182views Data Mining» more  KDD 2005»
14 years 9 months ago
Making holistic schema matching robust: an ensemble approach
The Web has been rapidly "deepened" by myriad searchable databases online, where data are hidden behind query interfaces. As an essential task toward integrating these m...
Bin He, Kevin Chen-Chuan Chang
ECCV
2006
Springer
14 years 7 days ago
Comparing Ensembles of Learners: Detecting Prostate Cancer from High Resolution MRI
While learning ensembles have been widely used for various pattern recognition tasks, surprisingly, they have found limited application in problems related to medical image analysi...
Anant Madabhushi, Jianbo Shi, Michael D. Feldman, ...