Multiple binary decision tree classifiers

Abstract Binary decision trees based on nonparametric statistical models of the data provide a solution to difficult decision problems where there are many classes and many available features related in a complex manner. Unfortunately, the technique requires a very large training set and is often limited by the size of the training set rather than by the discriminatory power of the features. This paper demonstrates that higher classification accuracies can be obtained from the same training set by using a combination of decision trees and by reaching a consensus using Dempster and Shafer's theory of evidence.

[1]  Peter de Souza.  Some decision network designs for pattern classification , 1982, Pattern Recognit..

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

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

[4]  JAMES C. STOFFEL,et al.  A Classifier Design Technique for Discrete Variable Pattern Recognition Problems , 1974, IEEE Transactions on Computers.

[5]  King-Sun Fu,et al.  Automated classification of nucleated blood cells using a binary tree classifier , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  G. H. Landeweerd,et al.  Binary tree versus single level tree classification of white blood cells , 1983, Pattern Recognit..

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

[8]  Xiaobo Li,et al.  Tree classifier design with a permutation statistic , 1986, Pattern Recognit..

[9]  Jeffrey A. Barnett,et al.  Computational Methods for a Mathematical Theory of Evidence , 1981, IJCAI.

[10]  Wolfgang Doster,et al.  A decision theoretic approach to hierarchical classifier design , 1984, Pattern Recognit..

[11]  Padhraic Smyth,et al.  Decision tree design from a communication theory standpoint , 1988, IEEE Trans. Inf. Theory.

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

[13]  Seymour Shlien.  Multifont Character Recognition for Typeset Documents , 1988, Int. J. Pattern Recognit. Artif. Intell..

[14]  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.

[15]  Didier Dubois,et al.  A Tentative Comparison of Numerical Approximate Reasoning Methodologies , 1987, Int. J. Man Mach. Stud..

[16]  K. S. Fu,et al.  An Approach to the Design of a Linear Binary Tree Classifier , 1976 .

[17]  M. Kurzynski.  The optimal strategy of a tree classifier , 1983 .

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

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

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

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

[22]  P. L. Bogler,et al.  Shafer-dempster reasoning with applications to multisensor target identification systems , 1987, IEEE Transactions on Systems, Man, and Cybernetics.

[23]  Richard O. Duda,et al.  Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.

[24]  Theodosios Pavlidis,et al.  On the Recognition of Printed Characters of Any Font and Size , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[25]  M. Terrenoire,et al.  Sample Size Sensitive Entropy , 1982 .