A k-Nearest Neighbour Method for Managing the Evolution of a Learning Base
ICCIMA '01 Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications（2001）
摘要
A character recognition system with continuous learning seeks to constantly enhance its baserepresentation models in order to provide the best recognition rate.The method we arepresenting enables the system to enhance its base with models, which are performant inrecognition.This method also enables to get rid of models regularly doubtable in efficiency when it comes to interpretation of the characters studied.This rule is similar to the one used in the "Death by suffocation" game of life of Conway.We based ourselves on the theory of k-nearest neighbours to develop a new approach we named å -adaptive neighbourhood.It makes an adjustment of classes possible, according to confidence rate in each model of the learning base.These rates which are practically represented as weights are taken into account by the stage of the recognition system during the character recognition phase.The use of weight as a model selection factor, useful for recognition, enables the system to manage the evolution of the learning base.
更多查看译文
关键词
recognition system,k-nearest neighbour,learning base,character recognition system,best recognition rate,k-nearest neighbour method,character recognition phase,confidence rate,adaptive neighbourhood,baserepresentation model,model selection factor,continuous learning,model selection,tellurium,error correction,optical feedback,prototypes,learning artificial intelligence,information processing,information analysis,data mining
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要