Methods of combining multiple classifiers and their applications to handwriting recognition
摘要:
Possible solutions to the problem of combining classifiers can be divided into three categories according to the levels of information available from the various classifiers. Four approaches based on different methodologies are proposed for solving this problem. One is suitable for combining individual classifiers such as Bayesian, k -nearest-neighbor, and various distance classifiers. The other three could be used for combining any kind of individual classifiers. On applying these methods to combine several classifiers for recognizing totally unconstrained handwritten numerals, the experimental results show that the performance of individual classifiers can be improved significantly. For example, on the US zipcode database, 98.9% recognition with 0.90% substitution and 0.2% rejection can be obtained, as well as high reliability with 95% recognition, 0% substitution, and 5% rejection
展开
关键词:
Theoretical or Mathematical/ character recognition/ multiple classifier combination Bayesian classifiers k-nearest-neighbour classifiers handwriting recognition distance classifiers unconstrained handwritten numerals US zipcode database/ C1250B Character recognition
DOI:
10.1109/21.155943
被引量:
年份:
1992






































通过文献互助平台发起求助,成功后即可免费获取论文全文。
相似文献
参考文献
引证文献
引用走势
辅助模式
引用
文献可以批量引用啦~
欢迎点我试用!