Implementation of Multi-valued Logic Based on Bi-threshold Neural Networks
ISNN '07 Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks
A novel modular neural network for imbalanced classification problems
Pattern Recognition Letters
Study of parametric relation in ant colony optimization approach to traveling salesman problem
ICIC'06 Proceedings of the 2006 international conference on Computational Intelligence and Bioinformatics - Volume Part III
Ant colony system for optimizing vehicle routing problem with time windows (VRPTW)
ICIC'06 Proceedings of the 2006 international conference on Computational Intelligence and Bioinformatics - Volume Part III
Recognition of leaf images based on shape features using a hypersphere classifier
ICIC'05 Proceedings of the 2005 international conference on Advances in Intelligent Computing - Volume Part I
Methods of decreasing the number of support vectors via k-mean clustering
ICIC'05 Proceedings of the 2005 international conference on Advances in Intelligent Computing - Volume Part I
Improvements to the conventional layer-by-layer BP algorithm
ICIC'05 Proceedings of the 2005 international conference on Advances in Intelligent Computing - Volume Part II
| Hi-index | 0.00 |
This paper proposes new modified constrained learning neural root finders (NRFs) of polynomial constructed by backpropagation network (BPN). The technique is based on the relationships between the roots and the coefficients of polynomial as well as between the root moments and the coefficients of the polynomial. We investigated different resulting constrained learning algorithms (CLAs) based on the variants of the error cost functions (ECFs) in the constrained BPN and derived a new modified CLA (MCLA), and found that the computational complexities of the CLA and the MCLA based on the root-moment method (RMM) are the order of polynomial, and that the MCLA is simpler than the CLA. Further, we also discussed the effects of the different parameters with the CLA and the MCLA on the NRFs. In particular, considering the coefficients of the polynomials involved in practice to possibly be perturbed by noisy sources, thus, we also evaluated and discussed the effects of noises on the two NRFs. Finally, to demonstrate the advantage of our neural approaches over the nonneural ones, a series of simulating experiments are conducted.