Number of the records: 1
Complexity of Gaussian-Radial-Basis Networks Approximating Smooth Functions
- 1.
SYSNO ASEP 0315078 Document Type J - Journal Article R&D Document Type Journal Article Subsidiary J Článek ve WOS Title Complexity of Gaussian-Radial-Basis Networks Approximating Smooth Functions Title Složitost Gaussovských radiálních sítí Author(s) Kainen, P.C. (US)
Kůrková, Věra (UIVT-O) RID, SAI, ORCID
Sanguineti, M. (IT)Source Title Journal of Complexity. - : Elsevier - ISSN 0885-064X
Roč. 25, č. 1 (2009), s. 63-74Number of pages 12 s. Language eng - English Country US - United States Keywords Gaussian-radial-basis-function networks ; rates of approximation ; model complexity ; variation norms ; Bessel and Sobolev norms ; tractability of approximation Subject RIV IN - Informatics, Computer Science R&D Projects GA201/08/1744 GA ČR - Czech Science Foundation (CSF) CEZ AV0Z10300504 - UIVT-O (2005-2011) UT WOS 000262046900005 EID SCOPUS 56949103612 DOI 10.1016/j.jco.2008.08.001 Annotation Estimates in terms of smoothness are derived for approximation rates by Gaussian radial-basis networks. Workplace Institute of Computer Science Contact Tereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800 Year of Publishing 2009
Number of the records: 1