68 search results - page 5 / 14 » On the Margin Explanation of Boosting Algorithms |
COLT
2008
Springer
13 years 9 months ago
2008
Springer
Boosting algorithms build highly accurate prediction mechanisms from a collection of lowaccuracy predictors. To do so, they employ the notion of weak-learnability. The starting po...
ICML
2004
IEEE
14 years 8 months ago
2004
IEEE
The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
We introduce a novel approach to incorporating domain knowledge into Support Vector Machines to improve their example efficiency. Domain knowledge is used in an Explanation Based ...
ALT
2006
Springer
14 years 4 months ago
2006
Springer
Abstract. We propose a thresholded ensemble model for ordinal regression problems. The model consists of a weighted ensemble of confidence functions and an ordered vector of thres...
CVPR
2010
IEEE
14 years 6 days ago
2010
IEEE
The design of robust classifiers, which can contend with the noisy and outlier ridden datasets typical of computer vision, is studied. It is argued that such robustness requires l...