An iterative growing and pruning algorithm for classification tree design

An 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 tree 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.<<ETX>>

[1]  Edward J. Delp,et al.  An Iterative Growing and Pruning Algorithm for Classification Tree Design , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  Marek W. Kurzysnki.  The optimal strategy of a tree classifier , 1983, Pattern Recognit..

[3]  King-Sun Fu,et al.  A method for the design of binary tree classifiers , 1983, Pattern Recognit..

[4]  Jerome H. Friedman,et al.  A Recursive Partitioning Decision Rule for Nonparametric Classification , 1977, IEEE Transactions on Computers.

[5]  I. K. Sethi,et al.  Hierarchical Classifier Design Using Mutual Information , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  Ching Y. Suen,et al.  Analysis and Design of a Decision Tree Based on Entropy Reduction and Its Application to Large Character Set Recognition , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  Marek Kurzynski,et al.  Decision rules for a hierarchical classifier , 1983, Pattern Recognit. Lett..

[8]  Ashok V. Kulkarni.  On the Mean Accuracy of Hierarchical Classifiers , 1978, IEEE Transactions on Computers.

[9]  Ching Y. Suen,et al.  Large Tree Classifier with Heuristic Search and Global Training , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[10]  King-Sun Fu,et al.  A Nonparametric Partitioning Procedure for Pattern Classification , 1969, IEEE Transactions on Computers.

[11]  E. M. Rounds.  A combined nonparametric approach to feature selection and binary decision tree design , 1980, Pattern Recognit..

[12]  Roland T. Chin,et al.  An Automated Approach to the Design of Decision Tree Classifiers , 1982 .

[13]  William S. Meisel,et al.  An Algorithm for Constructing Optimal Binary Decision Trees , 1977, IEEE Transactions on Computers.

[14]  William S. Meisel,et al.  A Partitioning Algorithm with Application in Pattern Classification and the Optimization of Decision Trees , 1973, IEEE Transactions on Computers.

[15]  Jack Sklansky,et al.  Locally Trained Piecewise Linear Classifiers , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[16]  Ishwar K. Sethi,et al.  Efficient decision tree design for discrete variable pattern recognition problems , 1977, Pattern Recognition.

[17]  Leo Breiman,et al.  Classification and Regression Trees , 1984 .

[18]  Marek W. Kurzyski.  Decision rules for a hierarchical classifier , 1983 .

[19]  Ching Y. Suen,et al.  Application of a Multilayer Decision Tree in Computer Recognition of Chinese Characters , 1983, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[20]  Philip H. Swain,et al.  Purdue e-Pubs , 2022 .

[21]  George Nagy,et al.  Decision tree design using a probabilistic model , 1984, IEEE Trans. Inf. Theory.