On the boosting ability of top-down decision tree learning algorithms
暂无分享,去创建一个
[1] Leslie G. Valiant,et al. A theory of the learnable , 1984, STOC '84.
[2] Yoav Freund,et al. Boosting a weak learning algorithm by majority , 1995, COLT '90.
[3] Yoav Freund,et al. Boosting a weak learning algorithm by majority , 1990, COLT '90.
[4] Eyal Kushilevitz,et al. Learning decision trees using the Fourier spectrum , 1991, STOC '91.
[5] J. Ross Quinlan,et al. C4.5: Programs for Machine Learning , 1992 .
[6] Nader H. Bshouty,et al. Exact learning via the Monotone theory , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[7] Leslie G. Valiant,et al. Cryptographic Limitations on Learning Boolean Formulae and Finite Automata , 1993, Machine Learning: From Theory to Applications.
[8] Yishay Mansour,et al. Weakly learning DNF and characterizing statistical query learning using Fourier analysis , 1994, STOC '94.
[9] Alberto Maria Segre,et al. Programs for Machine Learning , 1994 .
[10] Jeffrey C. Jackson,et al. An efficient membership-query algorithm for learning DNF with respect to the uniform distribution , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[11] Robert E. Schapire,et al. Efficient distribution-free learning of probabilistic concepts , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[12] 金田 重郎,et al. C4.5: Programs for Machine Learning (書評) , 1995 .
[13] Yoav Freund,et al. A decision-theoretic generalization of on-line learning and an application to boosting , 1995, EuroCOLT.
[14] Y. Freund. Boosting a Weak Learning Algorithm by Majority to Be Published in Information and Computation , 1995 .
[15] Yoav Freund,et al. Experiments with a New Boosting Algorithm , 1996, ICML.
[16] Thomas G. Dietterich,et al. Applying the Waek Learning Framework to Understand and Improve C4.5 , 1996, ICML.