Efficiency of self-generating neural networks applied to pattern recognition

Self-generating neural networks (SGNNs) have been in the spotlight of the fields of neural networks algorithm research for the sake of their efficiency. In practice, this neural network is implemented as a self-generating neural tree (SGNT) which is based on a hierarchical clustering algorithm. In this paper, we present the superior performance of the SGNT when it is applied to character recognition problems. Basically, the SGNT algorithm is generated as a kind of competitive learning algorithm. Therefore, it is natural to have a competent performance at the area of clustering or classification. However, our experimental results show that the SGNN method is very efficient to solve even pattern recognition problems, especially when they include a noisy signal problem.

[1]  P. Schönemann.  On artificial intelligence , 1985, Behavioral and Brain Sciences.

[2]  Patrick K. Simpson,et al.  Neural Networks Theory, Technology and Applications , 1995 .

[3]  James L. McClelland,et al.  Parallel distributed processing: explorations in the microstructure of cognition, vol. 1: foundations , 1986 .

[4]  Jirí Benes,et al.  On neural networks , 1990, Kybernetika.

[5]  B. Freisleben,et al.  Controlling airline seat allocations with neural networks , 1993, [1993] Proceedings of the Twenty-sixth Hawaii International Conference on System Sciences.

[6]  Pat Langley,et al.  Constraints on Tree Structure in Concept Formation , 1991, IJCAI.

[7]  A. Jennings,et al.  Self-generating vs. self-organizing, what's different? , 1993, IEEE International Conference on Neural Networks.

[8]  Geoffrey E. Hinton,et al.  Learning internal representations by error propagation , 1986 .

[9]  Teuvo Kohonen,et al.  Self-Organizing Maps , 2010 .