Optimizing the Induction of Alternating Decision Trees


The alternating decision tree brings comprehensibility to the performance enhancing capabilities of boosting. A single interpretable tree is induced wherein knowledge is distributed across the nodes and multiple paths are traversed to form predictions. The complexity of the algorithm is quadratic in the number of boosting iterations and this makes it… (More)
DOI: 10.1007/3-540-45357-1_50


5 Figures and Tables

Cite this paper

@inproceedings{Pfahringer2001OptimizingTI, title={Optimizing the Induction of Alternating Decision Trees}, author={Bernhard Pfahringer and Geoff Holmes and Richard Kirkby}, booktitle={PAKDD}, year={2001} }