Learning through changes: an empirical study of dynamic behaviors of probability estimation trees
暂无分享,去创建一个
Kun Zhang | Jing Peng | Bill P. Buckles | Zujia Xu | Jing Peng | B. Buckles | Kun Zhang | Zujia Xu
[1] Kai Ming Ting,et al. Maximizing Tree Diversity by Building Complete-Random Decision Trees , 2005, PAKDD.
[2] M. Degroot,et al. Assessing Probability Assessors: Calibration and Refinement. , 1981 .
[3] Catherine Blake,et al. UCI Repository of machine learning databases , 1998 .
[4] Carla E. Brodley,et al. Pruning Decision Trees with Misclassification Costs , 1998, ECML.
[5] Wei Fan,et al. On the Optimality of Probability Estimation by Random Decision Trees , 2004, AAAI.
[6] C. Ling,et al. Decision Tree with Better Ranking , 2003, ICML.
[7] Foster J. Provost,et al. Learning When Training Data are Costly: The Effect of Class Distribution on Tree Induction , 2003, J. Artif. Intell. Res..
[8] Gregory Piatetsky-Shapiro,et al. Estimating campaign benefits and modeling lift , 1999, KDD '99.
[9] D. J. Newman,et al. UCI Repository of Machine Learning Database , 1998 .
[10] Philip S. Yu,et al. Is random model better? On its accuracy and efficiency , 2003, Third IEEE International Conference on Data Mining.
[11] Pedro M. Domingos,et al. Tree Induction for Probability-Based Ranking , 2003, Machine Learning.
[12] A. H. Murphy. A New Vector Partition of the Probability Score , 1973 .
[13] Tom Fawcett,et al. ROC Graphs: Notes and Practical Considerations for Data Mining Researchers , 2003 .