The Strength of Weak Learnability
Machine Learning
C4.5: programs for machine learning
C4.5: programs for machine learning
Bottom-up induction of oblivious read-once decision graphs
ECML-94 Proceedings of the European conference on machine learning on Machine Learning
Boosting a weak learning algorithm by majority
Information and Computation
On learning bounded-width branching programs
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
A decision-theoretic generalization of on-line learning and an application to boosting
Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
On the boosting ability of top-down decision tree learning algorithms
Journal of Computer and System Sciences
On Learning Programs and Small Depth Circuits
EuroCOLT '97 Proceedings of the Third European Conference on Computational Learning Theory
Boosting Using Branching Programs
COLT '00 Proceedings of the Thirteenth Annual Conference on Computational Learning Theory
Oblivious decision trees graphs and top down pruning
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
| Hi-index | 0.00 |
Branching programs are a generalization of decision trees. From the viewpoint of boosting theory the former appear to be exponentially more efficient. However, earlier experience demonstrates that such results do not necessarily translate to practical success. In this paper we develop a practical version of Mansour and McAllester's [13] algorithm for branching program boosting. We test the algorithm empirically with real-world and synthetic data. Branching programs attain the same prediction accuracy level as C4.5. Contrary to the implications of the boosting analysis, they are not significantly smaller than the corresponding decision trees. This further corroborates the earlier observations on the way in which boosting analyses bear practical significance.