Michael Kearns
- 1.In Machine Learning: Proceedings of the International Conference. Morgan Kaufmann, 1982-1995.Google Scholar
- 2.A. Blum, M. Furst, J. Jackson, M. Kearns, Y. Mansour, and S. Rudich. Weakly learning DNF and characterizing statistical query learning using Fourier analysis. In Proceedings of the 26th ACM Symposium on the Theory of Cornputing. ACM Press, New York, NY, 1994. Google ScholarDigital Library
- 3.L. Breiman, J. H. Friedman, R. A. Olshen, and C. J. Stone. Classification and Regression Trees. Wadsworth International Group, 1984.Google Scholar
- 4.N. Bshouty and Y. Mansour. Simple learning algorithms for decision trees and multivariate polynomials. In Proceedings of the 36th IEEE Symposium on the Foundations of Computer Science, pages 304-311. IEEE Computer Society Press, Los Alamitos, CA, 1995. Google ScholarDigital Library
- 5.N. H. Bshouty. Exact learning via the monotone theory. In Proceedings of the 34th IEEE Symposium on the Foundations of Computer Science, pages 302-311. IEEE Computer Society Press, Los Alamitos, CA, 1993.Google ScholarDigital Library
- 6.W. Buntine and T. Niblett. A further comparison of splitting roles for decision-tree induction. Machine Learning, 8:75-86, 1992. Google ScholarDigital Library
- 7.T. Dietterich, M. Keams, and Y. Mansour. Applying the weak learning framework to understand and improve C4.5. Unpublished manuscript, 1996.Google Scholar
- 8.Y. Freund and R. Schapire. Some experiments with a new boosting algorithm. Unpublished manuscript, 1996.Google Scholar
- 9.Yoav Freund. Boosting a weak learning algorithm by majority. Information and Computation, 121 (2):256--285, September 1995. Google ScholarDigital Library
- 10.Yoav Freund and Robert E. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. In Second European Conference on Computational Learning Theory, pages 23-37. Springer-Verlag, 1995. Google ScholarDigital Library
- 11.J. Jackson. An efficient membership query algorithm for learning DNF with respect to the uniform distribution. In Proceedings of the 35th IEEE Symposium on the Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 1994.Google ScholarDigital Library
- 12.M. Keams and L. G. Valiant. Cryptographic limitations on learning boolean formulae and finite automata. Journal of the ACM, 41 (1):67-95, 1994. Google ScholarDigital Library
- 13.E. Kushilevitz and Y. Mansour. Learning decision trees using the Fourier spectrum. In Proc. of the 23rd Symposium on Theory of Computing, pages 455-464. ACM Press, New York, NY, 1991. Google ScholarDigital Library
- 14.J. Mingers. An empirical comparison of selection measures for decision-tree induction. Machine Learning, 3:319-342, 1989. Google ScholarDigital Library
- 15.J.R. Quinlan. C4.5: Programs for Machine Learning. Morgan Kaufmann, 1993. Google ScholarDigital Library
- 16.R. E. Schapire. The strength of weak leamability. Machine Learning, 5(2): 197-227, 1990. Google ScholarDigital Library
- 17.L. G. Valiant. A theory of the learnable. Communications of the ACM, 27(l l):l134-1142, 1984. Google ScholarDigital Library
Index Terms
- On the boosting ability of top-down decision tree learning algorithms
Recommendations
Top-down decision tree learning as information based boosting
We consider a boosting technique that can be directly applied to multiclass classification problems. Although many boosting algorithms have been proposed so far, most of them are developed essentially for binary classification problems, and in order to ...
Top-Down Decision Tree Boosting and Its Applications
Progress in Discovery Science, Final Report of the Japanese Discovery Science ProjectTop-down algorithms such as C4.5 and CART for constructing decision trees are known to perform boosting, with the procedure of choosing classification rules at internal nodes regarded as the base learner. In this work, by introducing a notion of pseudo-...
On the Boosting Ability of Top-Down Decision Tree Learning Algorithms
We analyze the performance of top down algorithms for decision tree learning, such as those employed by the widely used C4.5 and CART software packages. Our main result is a proof that such algorithms areboostingalgorithms. By this we mean that if the ...
Comments