Learning internal representations by error propagation
Parallel distributed processing: explorations in the microstructure of cognition, vol. 1
Constraints on tree structure in concept formation
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 2
Self-Organizing Neural Grove and Its Parallel and Distributed Performance
ICONIP '09 Proceedings of the 16th International Conference on Neural Information Processing: Part II
Self-organizing neural grove and its distributed performance
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
Hi-index | 0.98 |
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.