247 search results - page 22 / 50 » Superset Learning Based on Generalized Loss Minimization |
SIGECOM
2010
ACM
15 years 2 months ago
2010
ACM
We explore the striking mathematical connections that exist between market scoring rules, cost function based prediction markets, and no-regret learning. We first show that any c...
CVPR
2008
IEEE
16 years 2 days ago
2008
IEEE
To learn a new visual category from few examples, prior knowledge from unlabeled data as well as previous related categories may be useful. We develop a new method for transfer le...
IJPRAI
2010
14 years 8 months ago
2010
: AUC-SVM directly maximizes the area under the ROC curve (AUC) through minimizing its hinge loss relaxation, and the decision function is determined by those support vector sample...
ICML
2001
IEEE
15 years 11 months ago
2001
IEEE
This paper addresses the issue of reducing the storage requirements on Instance-Based Learning algorithms. Algorithms proposed by other researches use heuristics to prune instance...
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
For object category recognition to scale beyond a small number of classes, it is important that algorithms be able to learn from a small amount of labeled data per additional clas...