Issue No. 02 - February (1991 vol. 13)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.67645
<p>A critical issue in classification tree design-obtaining right-sized trees, i.e. trees which neither underfit nor overfit the data-is addressed. Instead of stopping rules to halt partitioning, the approach of growing a large tree with pure terminal nodes and selectively pruning it back is used. A new efficient iterative method is proposed to grow and prune classification trees. This method divides the data sample into two subsets and iteratively grows a tree with one subset and prunes it with the other subset, successively interchanging the roles of the two subsets. The convergence and other properties of the algorithm are established. Theoretical and practical considerations suggest that the iterative free growing and pruning algorithm should perform better and require less computation than other widely used tree growing and pruning algorithms. Numerical results on a waveform recognition problem are presented to support this view.</p>
pattern recognition; estimation theory; Bayes methods; pruning algorithm; classification tree design; right-sized trees; stopping rules; terminal nodes; iterative method; waveform recognition problem; Bayes methods; estimation theory; iterative methods; pattern recognition; trees (mathematics)
S. Gelfand, E. Delp and C. Ravishankar, "An Iterative Growing and Pruning Algorithm for Classification Tree Design," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 13, no. , pp. 163-174, 1991.