The Difficulty of Reduced Error Pruning of Leveled Branching Programs

Abstract

Induction of decision trees is one of the most successful approaches to supervised machine learning. Branching programs are a generalization of decision trees and, by the boosting analysis, exponentially more efficiently learnable than decision trees. However, this advantage has not been seen to materialize in experiments. Decision trees are easy to… (More)
DOI: 10.1023/B:AMAI.0000018579.44321.6a

Topics

4 Figures and Tables

Slides referencing similar topics