Skip to Main Content
In the tree classifier with top-down search, a global decision is made via a series of local decisions. Although this approach gains in classification efficiency, it also gives rise to error accumulation which can be very harmful when the number of classes is very large. To overcome this difficulty, a new tree classifier with the following characteristics is proposed: 1) fuzzy logic search is used to find all ``possible correct classes,'' and some similarity measures are used to determine the ``most probable class''; 2) global training is applied to generate extended terminals in order to enhance the recognition rate; 3) both the training and search algorithms have been given a lot of flexibility, to provide tradeoffs between error and rejection rates, and between the recognition rate and speed. A computer simulation of the decision trees for the recognition of 3200 Chinese character categories yielded a very high recognition rate of 99.93 percent and a very high speed of 861 samples/s, when the program was written in a high level language and run on a large multiuser time-sharing computer.