A new adaptive polynomial neural network
โ Scribed by A. Balestrino; F. Bini Verona
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 404 KB
- Volume
- 37
- Category
- Article
- ISSN
- 0378-4754
No coin nor oath required. For personal study only.
โฆ Synopsis
This paper considers the problem of the construction of nonlinear mapping by using an adaptive polynomial neural network [l], implementing a learning rule. First we apply the method to a two-class pattern recognition problem. We use one high order neuron with a threshold element ranging from -1 to + 1. Positive output means class 1 and negative output means class 2. The main idea of the method proposed is that the weights are adjusted automatically in such a way to move the decision boundary to a place of low pattern density. Once reached the convergence, to improve the generalization ability, we add a growing noise to the data available. The training is performed by a steepest-descent algorithm on the weights.
๐ SIMILAR VOLUMES
We apply the principle of adaptation to optimize the performance of neural networks with (i) noisy retrieval and (ii) disruptive dilution. ## I. Introduction Learning in neural networks can be described as a search procedure in the space of the adjustable synaptic weights. A performance function
A self-organizing neural network model is proposed to generate the skeleton of a pattern. The proposed neural net is topology-adaptive and has a few advantages over other self-organizing models. The model is dynamic in the sense that it grows in size over time. The model is especially designed to pr