Bootstrap Methods for the Cost-Sensitive Evaluation of Classifiers
暂无分享,去创建一个
[1] Bojan Cestnik,et al. Estimating Probabilities: A Crucial Task in Machine Learning , 1990, ECAI.
[2] Kai Ming Ting,et al. Boosting Trees for Cost-Sensitive Classifications , 1998, ECML.
[3] Thomas G. Dietterich. Approximate Statistical Tests for Comparing Supervised Classification Learning Algorithms , 1998, Neural Computation.
[4] Thomas G. Dietterich,et al. Learning decision trees for loss minimization in multi-class problems , 1999 .
[5] Igor Kononenko,et al. Cost-Sensitive Learning with Neural Networks , 1998, ECAI.
[6] Pedro M. Domingos. MetaCost: a general method for making classifiers cost-sensitive , 1999, KDD '99.
[7] Ron Kohavi,et al. The Case against Accuracy Estimation for Comparing Induction Algorithms , 1998, ICML.
[8] Gholamreza Nakhaeizadeh,et al. Cost-Sensitive Pruning of Decision Trees , 1994, ECML.
[9] Tom Fawcett,et al. Analysis and Visualization of Classifier Performance: Comparison under Imprecise Class and Cost Distributions , 1997, KDD.
[10] Salvatore J. Stolfo,et al. AdaCost: Misclassification Cost-Sensitive Boosting , 1999, ICML.
[11] D. B. Rosen,et al. How Good were those Probability Predictions? The Expected Recommendation Loss (ERL) Scoring Rule , 1996 .
[12] Andrew P. Bradley,et al. The use of the area under the ROC curve in the evaluation of machine learning algorithms , 1997, Pattern Recognit..
[13] Carla E. Brodley,et al. Pruning Decision Trees with Misclassification Costs , 1998, ECML.
[14] Peter D. Turney. Cost-sensitive learning bibliography , 2000, The Web Conference.
[15] Irving John Good,et al. The Estimation of Probabilities: An Essay on Modern Bayesian Methods , 1965 .
[16] Walter L. Smith. Probability and Statistics , 1959, Nature.