A new adaptive polynomial neural network

A. Balestrino and F. Bini Verona

Mathematics and Computers in Simulation (MATCOM), 1994, vol. 37, issue 2, 189-194

Abstract: This paper considers the problem of the construction of nonlinear mapping by using an adaptive polynomial neural network [1], 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.

Date: 1994
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0378475494900175
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:37:y:1994:i:2:p:189-194

DOI: 10.1016/0378-4754(94)90017-5

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().