Abstract
A method is proposed to combine the branch-and-bound (BAB) algorithm with the Bayes classifier. Given the input feature vector from an unknown class, the BAB algorithm is efficient for searching for the nearest neighbor ( NN) from among the set of reference vectors. Hence BAB is often used to implement the k– NN classifier. However, it is known that the k– NN classifier is not as accurate as the Bayes classifier, which has the highest recognition rate provided the class statistics are known. Hence it is attractive to combine the BAB algorithm with the Bayes classifier so that the resulting system will inherit improved speed and accuracy. In this article, an extension of the BAB algorithm is proposed so that it can be used to implement the Bayes classifier. Gaussian statistics are assumed in modeling the class conditional densities. A system for recognizing printed Chinese characters is implemented, and satisfactory results are obtained.
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 callMore From: Engineering Applications of Artificial Intelligence
Disclaimer: 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.
