Please use this identifier to cite or link to this item:
|dc.title||Recognition rule acquisition by an advanced extension matrix algorithm|
|dc.contributor.author||Tan, Chew Lim|
|dc.identifier.citation||Shi, Daming,Tan, Chew Lim,Shu, Wenhao (1999). Recognition rule acquisition by an advanced extension matrix algorithm. Proceedings of the IEEE International Conference on Systems, Man and Cybernetics 3 : III-950. ScholarBank@NUS Repository.|
|dc.description.abstract||An advanced Extension Matrix algorithm is proposed, in which a heuristic search based on the average entropy is used to get the approximate solutions of the minimal complex, as well as a potential function is used to estimate the probability density function of the overlay area between positive and negative examples, so that the non-linear interfaces of the interclass areas may be obtained. The algorithm will be applied to supervised learning for Chinese character recognition to acquire recognition rules, and the implementations upon 751,000 loosely-constrained handwritten Chinese characters indicate that these methodologies can be applied to a practical recognition system with promising results.|
|dc.description.sourcetitle||Proceedings of the IEEE International Conference on Systems, Man and Cybernetics|
|Appears in Collections:||Staff Publications|
Show simple item record
Files in This Item:
There are no files associated with this item.
checked on Nov 24, 2022
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.