The entire quantile path of a risk-agnostic SVM classifier

Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence, UAI 2009

Volumn , Issue , 2009, Pages 623-630

  Yu, Jin ^a   Vishwanathan, S V N ^b   Zhang, Jian ^b  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^b PURDUE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSIFICATION (OF INFORMATION);

APRIORI; ASYMMETRIC COSTS; BINARY CLASSIFIERS; CONDITIONAL DISTRIBUTION; MISCLASSIFICATIONS; NUMERICAL EXPERIMENTS; SUPPORT VECTOR MACHINE (SVMS); SVM CLASSIFIERS;

SUPPORT VECTOR MACHINES;

EID: 80053138107     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. A. Asuncion and D. Newman. UCI machine learning repository, 2007.
2. R. Byrd, P. Lu, J. Nocedal, and C. Zhu. A limited memory algorithm for bound constrained optimization. SIAM Journal on Scientific Computing, 16(5): 1190-1208, 1995.
3. A. Conn, N. Gould, and P. Toint. Global convergence of a class of trust region algorithms for optimization with simple bounds. SIAM journal on numerical analysis, 25(2):433-460, 1988.
4. R. O. Duda, P. E. Hart, and D. G. Stork. Pattern Classification and Scene Analysis. John Wiley and Sons, New York, 2001. Second edition.
5. Y. Grandvalet, J. Marithoz, and S. Bengio. A probabilistic interpretation of SVMs with an application to unbalanced classification. In Y. Weiss, B. Schölkopf, and J. Platt, editors, Advances in Neural Information Processing Systems 18, pages 467-474, Cambride, MA, 2006. MIT Press.
6. T. Hastie, S. Rosset, R. Tibshirani, and J. Zhu. The entire regularization path for the support vector machine. JMLR, 5:1391-1415, 2004.
7. C. J. Hsieh, K. W. Chang, C. J. Lin, S. S. Keerthi, and S. Sundararajan. A dual coordinate descent method for large-scale linear SVM. In W. Cohen, A. McCallum, and S. Roweis, editors, ICML, pages 408-415. ACM, 2008.
8. T. Joachims. Training linear SVMs in linear time. In Proc. ACM Conf. Knowledge Discovery and Data Mining (KDD). ACM, 2006.
9. R. Koenker and G. Bassett. Regression quantiles. Econometrica, 46(1):33-50, 1978.
10. Y. Lin. Support vector machines and the bayes rule in classification. Data Mining and Knowledge Discovery, 6(3):259-275, 2002. (Pubitemid 37113866)
11. J. J. Moré and G. Toraldo. Algorithms for bound constrained quadratic programming problems. Numerische Mathematik, 55(4):377-400, 1989.
12. K. Morik, P. Brockhausen, and T. Joachims. Combining statistical learning with a knowledge-based approach - a case study in intensive care monitoring. In Proc. Intl. Conf. Machine Learning, pages 268-277. Morgan Kaufmann, San Francisco CA, 1999
13. J. Nocedal and S. J. Wright. Numerical Optimization. Springer Series in Operations Research. Springer, 1999.
14. J. Platt. Probabilities for SV machines. In A. J. Smola, P. L. Bartlett, B. Schölkopf, and D. Schuurmans, editors, Advances in Large Margin Classifiers, pages 61-73, Cambridge, MA, 2000. MIT Press.
15. P. Sollich. Bayesian methods for support vector ma chines: Evidence and predictive class probabilities. Machine Learning, 46:21-52, 2002. (Pubitemid 34129962)
16. I. Takeuchi, Q. V. Le, T. Sears, and A. J. Smola. Nonparametric quantile estimation. J. Mach. Learn. Res., 7, 2006.
17. K. Veropoulos, C. Campbell, and N. Cristianini. Controlling the sensitivity of support vector machines. In Proceedings of IJCAI Workshop Support Vector Machines, pages 55-60, 1999.