On the Path to an Ideal ROC Curve: Considering Cost Asymmetry in Learning Classifiers
暂无分享,去创建一个
[1] N. Bleistein,et al. Asymptotic Expansions of Integrals , 1975 .
[2] Gene H. Golub,et al. Matrix computations , 1983 .
[3] David Avis,et al. How good are convex hull algorithms? , 1995, SCG '95.
[4] Alexander J. Smola,et al. Learning with kernels , 1998 .
[5] John C. Platt,et al. Fast training of support vector machines using sequential minimal optimization, advances in kernel methods , 1999 .
[6] Margaret S. Pepe,et al. Receiver Operating Characteristic Methodology , 2000 .
[7] Trevor Hastie,et al. The Elements of Statistical Learning , 2001 .
[8] I. Maros. Computational Techniques of the Simplex Method , 2002 .
[9] Michael I. Jordan,et al. Large Margin Classifiers: Convex Loss, Low Noise, and Convergence Rates , 2003, NIPS.
[10] Peter A. Flach. The Geometry of ROC Space: Understanding Machine Learning Metrics through ROC Isometrics , 2003, ICML.
[11] Michael I. Jordan,et al. Computing regularization paths for learning multiple kernels , 2004, NIPS.
[12] Tom Fawcett,et al. Robust Classification for Imprecise Environments , 2000, Machine Learning.
[13] Robert Tibshirani,et al. The Entire Regularization Path for the Support Vector Machine , 2004, J. Mach. Learn. Res..
[14] Eric Horvitz,et al. Considering Cost Asymmetry in Learning Classifiers , 2006, J. Mach. Learn. Res..
[15] Stephen P. Boyd,et al. Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.