A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf
.
An efficient extension to mixture techniques for prediction and decision trees
1997
Proceedings of the tenth annual conference on Computational learning theory - COLT '97
We present an efficient method for maintaining mixtures of prunings of a prediction or decision tree that extends the previous methods for "node-based" prunings () to the larger class of edge-based prunings. The method includes an online weight-allocation algorithm that can be used for prediction, compression and classification. Although the set of edge-based prunings of a given tree is much larger than that of node-based prunings, our algorithm has similar space and time complexity to that of
doi:10.1145/267460.267487
dblp:conf/colt/PereiraS97
fatcat:tyl3mtpluratzgoejrbuhv7cqa