Abstract
Abstract : A two-step procedure for nonparametric multiclass classifier design is described. A multiclass recursive partioning algorithm is given which generated a single binary decision tree for classifying all classes. The algorithm minimizes the Bayes risk at each node. A tree termination algorithm is given which optimally terminates binary decision trees. The algorithm yields the unique tree with fewest nodes which minimizes the Bayes risk. Tree generation and termination are based on the training and test samples, respectively.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
