Sciweavers

4 search results - page 1 / 1
» Classification Methods with Reject Option Based on Convex Ri...
Sort
View
JMLR
2010
105views more  JMLR 2010»
12 years 11 months ago
Classification Methods with Reject Option Based on Convex Risk Minimization
In this paper, we investigate the problem of binary classification with a reject option in which one can withhold the decision of classifying an observation at a cost lower than t...
Ming Yuan, Marten H. Wegkamp
JMLR
2006
107views more  JMLR 2006»
13 years 4 months ago
Consistency of Multiclass Empirical Risk Minimization Methods Based on Convex Loss
The consistency of classification algorithm plays a central role in statistical learning theory. A consistent algorithm guarantees us that taking more samples essentially suffices...
Di-Rong Chen, Tao Sun
ICPR
2008
IEEE
14 years 6 months ago
Multiple kernel learning from sets of partially matching image features
Abstract: Kernel classifiers based on Support Vector Machines (SVM) have achieved state-ofthe-art results in several visual classification tasks, however, recent publications and d...
Guo ShengYang, Min Tan, Si-Yao Fu, Zeng-Guang Hou,...
ESANN
2004
13 years 6 months ago
Sparse LS-SVMs using additive regularization with a penalized validation criterion
This paper is based on a new way for determining the regularization trade-off in least squares support vector machines (LS-SVMs) via a mechanism of additive regularization which ha...
Kristiaan Pelckmans, Johan A. K. Suykens, Bart De ...