Have a personal or library account? Click to login
Generalization of Patterns by Identification with Polynomial Neural Network Cover

Generalization of Patterns by Identification with Polynomial Neural Network

By: Ladislav Zjavka  
Open Access
|Jun 2011

Abstract

Artificial neural networks (ANN) in general classify patterns according to their relationship, they are responding to related patterns with a similar output. Polynomial neural networks (PNN) are capable of organizing themselves in response to some features (relations) of the data. Polynomial neural network for dependence of variables identification (D-PNN) describes a functional dependence of input variables (not entire patterns). It approximates a hyper-surface of this function with multi-parametric particular polynomials forming its functional output as a generalization of input patterns. This new type of neural network is based on GMDH polynomial neural network and was designed by author. D-PNN operates in a way closer to the brain learning as the ANN does. The ANN is in principle a simplified form of the PNN, where the combinations of input variables are missing.

DOI: https://doi.org/10.2478/v10187-010-0017-4 | Journal eISSN: 1339-309X | Journal ISSN: 1335-3632
Language: English
Page range: 120 - 124
Published on: Jun 7, 2011
Published by: Slovak University of Technology in Bratislava
In partnership with: Paradigm Publishing Services
Publication frequency: 6 issues per year

© 2011 Ladislav Zjavka, published by Slovak University of Technology in Bratislava
This work is licensed under the Creative Commons License.

Volume 61 (2010): Issue 2 (March 2010)