1736 search results - page 156 / 348 » String Extension Learning |
158
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
A new procedure for learning cost-sensitive SVM classifiers is proposed. The SVM hinge loss is extended to the cost sensitive setting, and the cost-sensitive SVM is derived as the...
173
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
We propose a new dimensionality reduction method, the elastic embedding (EE), that optimises an intuitive, nonlinear objective function of the low-dimensional coordinates of the d...
182
click to vote
ML
2000
ACM
15 years 6 months ago
2000
ACM
MultiBoosting is an extension to the highly successful AdaBoost technique for forming decision committees. MultiBoosting can be viewed as combining AdaBoost with wagging. It is abl...
176
click to vote
ML
2002
ACM
15 years 6 months ago
2002
ACM
Matching Pursuit algorithms learn a function that is a weighted sum of basis functions, by sequentially appending functions to an initially empty basis, to approximate a target fu...
217
click to vote
JMLR
2012
13 years 9 months ago
2012
We consider the task of devising large-margin based surrogate losses for the learning to rank problem. In this learning to rank setting, the traditional hinge loss for structured ...