Universality and Complexity of Approximation of Multivariable Functions by Feedforward Networks.
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F02%3A06020234" target="_blank" >RIV/67985807:_____/02:06020234 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Universality and Complexity of Approximation of Multivariable Functions by Feedforward Networks.
Original language description
A theoretical framework for investigation of approximation capabilities of feed-forward networks is presented in the context of nonlinear approximation theory. Some recent results of universal approximation property and estimates of network complexity, measured by the number of hidden units, are described.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA201%2F00%2F1482" target="_blank" >GA201/00/1482: Approximation of functions by decision trees and its application in data analysis</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2002
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Soft Computing and Industry. Recent Applications.
ISBN
1-85233-539-4
ISSN
—
e-ISSN
—
Number of pages
12
Pages from-to
13-24
Publisher name
Springer
Place of publication
London
Event location
On the Internet [XX]
Event date
Oct 10, 2001
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—