Bagging, Boosting, and C4.5
暂无分享,去创建一个
[1] Paul Compton,et al. Inductive knowledge acquisition: a case study , 1987 .
[2] Carla E. Brodley,et al. An Incremental Method for Finding Multivariate Splits for Decision Trees , 1990, ML.
[3] M. Pazzani,et al. ID2-of-3: Constructive Induction of M-of-N Concepts for Discriminators in Decision Trees , 1991 .
[4] Jason Catlett,et al. Megainduction: A Test Flight , 1991, ML.
[5] Wray L. Buntine,et al. Learning classification trees , 1992 .
[6] Larry A. Rendell,et al. Lookahead Feature Construction for Learning Hard Concepts , 1993, International Conference on Machine Learning.
[7] Carla E. Brodley,et al. Addressing the Selective Superiority Problem: Automatic Algorithm/Model Class Selection , 1993 .
[8] Ron Kohavi,et al. Automatic Parameter Selection by Minimizing Estimated Error , 1995, ICML.
[9] Zijian Zheng,et al. Constructing Nominal X-of-N Attributes , 1995, IJCAI.
[10] Thomas G. Dietterich,et al. Solving Multiclass Learning Problems via Error-Correcting Output Codes , 1994, J. Artif. Intell. Res..
[11] Salvatore J. Stolfo,et al. A Comparative Evaluation of Voting and Meta-learning on Partitioned Data , 1995, ICML.
[12] Yoav Freund,et al. Experiments with a New Boosting Algorithm , 1996, ICML.
[13] Yoav Freund,et al. A decision-theoretic generalization of on-line learning and an application to boosting , 1997, EuroCOLT.