Considering cost asymmetry in learning classifiers

Journal of Machine Learning Research

Volumn 7, Issue , 2006, Pages 1713-1741

  Bach, Francis R ^a   Heckerman, David ^b   Horvitz, Eric ^b  

^a PSL RESEARCH UNIVERSITY   (France)

^b MICROSOFT RESEARCH   (United States)

Author keywords

Linear classification; Receiver operating characteristic (ROC) analysis; Support vector machines

Indexed keywords

BINARY SEQUENCES; COMPUTATIONAL COMPLEXITY; COSTS; LEARNING SYSTEMS; PARAMETER ESTIMATION; PERSONNEL TRAINING; SET THEORY; VECTORS;

LINEAR CLASSIFICATION; RECEIVER OPERATING CHARACTERISTIC (ROC) ANALYSIS; SUPPORT VECTOR MACHINE (SVM);

CLASSIFICATION (OF INFORMATION);

EID: 33747350759     PISSN: 15337928     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (23)

1. D. Avis, D. Bremner, and R. Seidel. How good are convex hull algorithms ? In Computational Geometry: Theory and Applications, volume 7, 1997.
2. F. R. Bach, D. Heckerman, and E. Horvitz. On the path to an ideal ROC curve: considering cost asymmetry in learning classifiers. In Workshop on Artificial Intelligence and Statistics (AISTATS), 2005a.
3. F. R. Bach, R. Thibaux, and M. I. Jordan. Computing regularization paths for learning multiple kernels. In Advances in Neural Information Processing Systems, 17. MIT Press, 2005b.
4. P. L. Bartlett, M. I. Jordan, and J. D. McAuliffe. Large margin classifiers: convex loss, low noise, and convergence rates. In Advances in Neural Information Processing Systems, 16. MIT Press, 2004.
5. C.L. Blake and C.J. Merz. UCI repository of machine learning databases, 1998.
6. N. Bleistein and R. A. Handelsman. Asymptotic Expansions of Integrals. Dover, 1986.
7. S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, 2003.
8. P. A. Flach. The geometry of ROC space: understanding machine learning metrics through ROC isometrics. In International Conference on Machine Learning (ICML), 2003.
9. G. H. Golub and C. F. Van Loan. Matrix Computations. Johns Hopkins University Press, 1996.
10. T. Hastie, S. Rosset, R. Tibshirani, and J. Zhu. The entire regularization path for the support vector machine. Journal of Machine Learning Research, 5:1391-1415, 2005.
11. T. Hastie, R. Tibshirani, and J. Friedman. The Elements of Statistical Learning. Springer-Verlag, 2001.
12. M. Hollander and D. A. Wolfe. Nonparametric statistical inference. John Wiley & Sons, 1999.
13. R. Kohavi and G. John. Wrappers for feature subset selection. Artificial Intelligence, 97(1-2): 273-324, 1997.
14. I. Maros. Computational Techniques of the Simplex Method. Klüwer Academic Publishers, 2002.
15. A. Y. Ng. Preventing overfitting of cross-validation data. In International Conference on Machine Learning (ICML), 1997.
16. M. S. Pepe. Receiver operating characteristic methodology. Journal of the American Statistical Association, 95(449):308-311, 2000.
17. J. Platt. Fast training of support vector machines using sequential minimal optimization. In Advances in Kernel Methods: Support Vector Learning. MIT Press, 1998.
18. F. Provost and T. Fawcett. Robust classification for imprecise environments. Machine Learning Journal, 42(3):203-231, 2001.
19. K. Scheinberg. An efficient implementation of an active set method for SVM. Journal of Machine Learning Research, to appear, 2006.
20. B. Schökopf and A. J. Smola. Learning with Kernels. MIT Press, 2002.
21. J. Shawe-Taylor and N. Cristianini. Kernel Methods for Pattern Analysis. Cambridge University Press, 2004.
22. S. Tong and D. Koller. Restricted Bayes optimal classifiers. In. American Conference on Artificial Intelligence (AAAI-00), 2000.
23. T. Zhang. Statistical behavior and consistency of classification methods based on convex risk minimization. Annals of Statistics, 32:56-85, 2004.