메뉴 건너뛰기




Volumn 18, Issue 1, 2005, Pages 91-102

Function approximation on non-Euclidean spaces

Author keywords

Feed forward neural networks; Function approximation; Invariants; Non metric spaces; Regularization

Indexed keywords

APPROXIMATION SCHEMES; NON-EUCLIDEAN SPACES; NON-METRIC SPACES; THEORETICAL FOUNDATIONS;

EID: 11844302947     PISSN: 08936080     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.neunet.2004.09.003     Document Type: Article
Times cited : (16)

References (28)
  • 2
    • 0027211408 scopus 로고
    • A convergent generator of neural networks
    • P. Courrieu A convergent generator of neural networks Neural Networks 6 1993 835 844
    • (1993) Neural Networks , vol.6 , pp. 835-844
    • Courrieu, P.1
  • 3
    • 0028201982 scopus 로고
    • Three algorithms for estimating the domain of validity of feedforward neural networks
    • P. Courrieu Three algorithms for estimating the domain of validity of feedforward neural networks Neural Networks 7 1994 169 174
    • (1994) Neural Networks , vol.7 , pp. 169-174
    • Courrieu, P.1
  • 4
    • 0002226296 scopus 로고    scopus 로고
    • The Hyperbell algorithm for global optimization: A random walk using Cauchy densities
    • P. Courrieu The Hyperbell algorithm for global optimization: a random walk using Cauchy densities Journal of Global Optimization 10 1997 37 55
    • (1997) Journal of Global Optimization , vol.10 , pp. 37-55
    • Courrieu, P.1
  • 5
    • 0035131890 scopus 로고    scopus 로고
    • Two methods for encoding clusters
    • P. Courrieu Two methods for encoding clusters Neural Networks 14 2001 175 183
    • (2001) Neural Networks , vol.14 , pp. 175-183
    • Courrieu, P.1
  • 6
    • 0036887496 scopus 로고    scopus 로고
    • Straight monotonic embedding of data sets in Euclidean spaces
    • P. Courrieu Straight monotonic embedding of data sets in Euclidean spaces Neural Networks 15 2002 1185 1196
    • (2002) Neural Networks , vol.15 , pp. 1185-1196
    • Courrieu, P.1
  • 7
    • 7244261986 scopus 로고    scopus 로고
    • Inverse discrimination time as a perceptual distance for alphabetic characters
    • Courrieu, P., Farioli, F., & Grainger, J. Inverse discrimination time as a perceptual distance for alphabetic characters. Visual Cognition, 11(7), 601-919.
    • Visual Cognition , vol.11 , Issue.7 , pp. 601-919
    • Courrieu, P.1    Farioli, F.2    Grainger, J.3
  • 10
    • 0024866495 scopus 로고
    • On the approximate realization of continuous mappings by neural networks
    • K.-I. Funahashi On the approximate realization of continuous mappings by neural networks Neural Networks 2 1989 183 192
    • (1989) Neural Networks , vol.2 , pp. 183-192
    • Funahashi, K.-I.1
  • 11
    • 0024991997 scopus 로고
    • Networks and the best approximation property
    • F. Girosi, and T. Poggio Networks and the best approximation property Biological Cybernetics 63 1990 169 176
    • (1990) Biological Cybernetics , vol.63 , pp. 169-176
    • Girosi, F.1    Poggio, T.2
  • 12
    • 0027812765 scopus 로고
    • Some new results on neural network approximation
    • K. Hornik Some new results on neural network approximation Neural Networks 6 1993 1069 1072
    • (1993) Neural Networks , vol.6 , pp. 1069-1072
    • Hornik, K.1
  • 13
    • 44049112575 scopus 로고
    • Genetic algorithms and very fast simulated reannealing: A comparison
    • L. Ingber, and B. Rosen Genetic algorithms and very fast simulated reannealing: a comparison Mathematical and Computer Modelling 16 1992 87 100
    • (1992) Mathematical and Computer Modelling , vol.16 , pp. 87-100
    • Ingber, L.1    Rosen, B.2
  • 14
    • 0025857963 scopus 로고
    • Arbitrary nonlinearity is sufficient to represent all functions by neural networks: A theorem
    • V.Y. Kreinovich Arbitrary nonlinearity is sufficient to represent all functions by neural networks: a theorem Neural Networks 4 1991 381 383
    • (1991) Neural Networks , vol.4 , pp. 381-383
    • Kreinovich, V.Y.1
  • 15
    • 0027262895 scopus 로고
    • Multilayer feedforward networks with a nonpolynomial activation function can approximate any function
    • M. Leshno, V.Y. Lin, A. Pinkus, and S. Schocken Multilayer feedforward networks with a nonpolynomial activation function can approximate any function Neural Networks 6 1993 861 867
    • (1993) Neural Networks , vol.6 , pp. 861-867
    • Leshno, M.1    Lin, V.Y.2    Pinkus, A.3    Schocken, S.4
  • 16
    • 0016494974 scopus 로고
    • An extension of the string to string correction problem
    • R. Lowrance, and R.A. Wagner An extension of the string to string correction problem JACM 22 2 1975 177 183
    • (1975) JACM , vol.22 , Issue.2 , pp. 177-183
    • Lowrance, R.1    Wagner, R.A.2
  • 17
    • 34250122797 scopus 로고
    • Interpolation of scattered data: Distance matrices and conditionally positive definite functions
    • C.A. Micchelli Interpolation of scattered data: distance matrices and conditionally positive definite functions Constructive Approximation 2 1986 11 22
    • (1986) Constructive Approximation , vol.2 , pp. 11-22
    • Micchelli, C.A.1
  • 18
    • 0004293209 scopus 로고
    • Prentice-Hall Englewood Cliffs, NJ
    • R.E. Moore Interval analysis 1966 Prentice-Hall Englewood Cliffs, NJ
    • (1966) Interval analysis
    • Moore, R.E.1
  • 20
    • 0030206316 scopus 로고    scopus 로고
    • A relaxation algorithm for estimating the domain of validity of feedforward neural networks
    • M. Pelillo A relaxation algorithm for estimating the domain of validity of feedforward neural networks Neural Processing Letters 3 1996 113 121
    • (1996) Neural Processing Letters , vol.3 , pp. 113-121
    • Pelillo, M.1
  • 21
    • 0025490985 scopus 로고
    • Networks for approximation and learning
    • T. Poggio, and F. Girosi Networks for approximation and learning Proceedings of the IEEE 78 9 1990 1481 1497
    • (1990) Proceedings of the IEEE , vol.78 , Issue.9 , pp. 1481-1497
    • Poggio, T.1    Girosi, F.2
  • 24
    • 0022471098 scopus 로고
    • Learning representations by back-propagating errors
    • D.E. Rumelhart, G.E. Hinton, and R.J. Williams Learning representations by back-propagating errors Nature 323 1986 533 536
    • (1986) Nature , vol.323 , pp. 533-536
    • Rumelhart, D.E.1    Hinton, G.E.2    Williams, R.J.3
  • 25
    • 0017930815 scopus 로고
    • Dynamic programming algorithm optimization for spoken word recognition
    • H. Sakoe, and S. Chiba Dynamic programming algorithm optimization for spoken word recognition IEEE Transactions on ASSP 26 1 1978 194 200
    • (1978) IEEE Transactions on ASSP , vol.26 , Issue.1 , pp. 194-200
    • Sakoe, H.1    Chiba, S.2
  • 26
    • 0015960104 scopus 로고
    • The string to string correction problem
    • R.A. Wagner, and M.J. Fischer The string to string correction problem JACM 21 1 1974 168 173
    • (1974) JACM , vol.21 , Issue.1 , pp. 168-173
    • Wagner, R.A.1    Fischer, M.J.2
  • 27
    • 0035185327 scopus 로고    scopus 로고
    • Interpolation by radial basis functions on Sobolev space
    • J. Yoon Interpolation by radial basis functions on Sobolev space Journal of Approximation Theory 112 2001 1 15
    • (2001) Journal of Approximation Theory , vol.112 , pp. 1-15
    • Yoon, J.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.