1055 search results - page 8 / 211 » Convex Factorization Machines |
ALT
2004
Springer
15 years 7 months ago
2004
Springer
The decomposition method is currently one of the major methods for solving the convex quadratic optimization problems being associated with support vector machines. For a special c...
SIAMJO
2008
14 years 10 months ago
2008
This paper concerns a fractional function of the form xT a/ xT Bx, where B is positive definite. We consider the game of choosing x from a convex set, to maximize the function, an...
107
click to vote
IJCNN
2006
IEEE
15 years 4 months ago
2006
IEEE
— In this paper, we show that one-class SVMs can also utilize data covariance in a robust manner to improve performance. Furthermore, by constraining the desired kernel function ...
NIPS
2007
14 years 11 months ago
2007
We present a globally convergent method for regularized risk minimization problems. Our method applies to Support Vector estimation, regression, Gaussian Processes, and any other ...
ML
2007
ACM
14 years 9 months ago
2007
ACM
Classifier calibration is the process of converting classifier scores into reliable probability estimates. Recently, a calibration technique based on isotonic regression has gain...