메뉴 건너뛰기




Volumn 45, Issue 7, 1999, Pages 2285-2292

Minimax nonparametric classification - Part II: Model selection for adaptation

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; CONVERGENCE OF NUMERICAL METHODS; ERROR ANALYSIS; GRAPH THEORY; INTERPOLATION; MATHEMATICAL MODELS; NEURAL NETWORKS; PROBABILITY;

EID: 0033356514     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.796369     Document Type: Article
Times cited : (13)

References (22)
  • 1
    • 0000501656 scopus 로고
    • Information theory and an extension of the maximum likelihood principle
    • B. N. Petrov and F. Csaki, Eds. Budapest, Hungary: Akademia Kiado
    • H. Akaike, "Information theory and an extension of the maximum likelihood principle," in Proc. 2nd Int. Symp. Infoormation Theory, B. N. Petrov and F. Csaki, Eds. Budapest, Hungary: Akademia Kiado, 1973, pp. 267-281.
    • (1973) Proc. 2nd Int. Symp. Infoormation Theory , pp. 267-281
    • Akaike, H.1
  • 2
    • 0001347323 scopus 로고
    • Complexity regularization with application to artificial neural networks
    • G. Roussas, Ed. Dordrecht, The Netherlands: Kluwer
    • A. R. Barron, "Complexity regularization with application to artificial neural networks," in Nonparametric Functional Estimation and Related Topics, G. Roussas, Ed. Dordrecht, The Netherlands: Kluwer, 1991, pp. 561-576.
    • (1991) Nonparametric Functional Estimation and Related Topics , pp. 561-576
    • Barron, A.R.1
  • 3
    • 0002678121 scopus 로고
    • Neural net approximation
    • K. Narendra, Ed. New Haven, CT: Yale Univ., May
    • _, "Neural net approximation," in Proc. Yale Worksh. Adaptive Learning Syst., K. Narendra, Ed. New Haven, CT: Yale Univ., May 1992.
    • (1992) Proc. Yale Worksh. Adaptive Learning Syst.
  • 4
    • 0027599793 scopus 로고
    • Universal approximation bounds for superpositions of a sigmoidal function
    • _, "Universal approximation bounds for superpositions of a sigmoidal function," IEEE Trans. Inform. Theory, vol. 39, pp. 930-945, 1993.
    • (1993) IEEE Trans. Inform. Theory , vol.39 , pp. 930-945
  • 5
    • 0001325515 scopus 로고
    • Approximation and estimation bounds for artificial neural networks
    • _, "Approximation and estimation bounds for artificial neural networks," Machine Learning, vol. 14, pp. 115-133, 1994.
    • (1994) Machine Learning , vol.14 , pp. 115-133
  • 7
    • 0026190366 scopus 로고
    • Minimum complexity density estimation
    • A. R. Barron, and T. M. Cover, "Minimum complexity density estimation," IEEE Trans. Inform. Theory, vol. 37, pp. 1034-1054, 1991.
    • (1991) IEEE Trans. Inform. Theory , vol.37 , pp. 1034-1054
    • Barron, A.R.1    Cover, T.M.2
  • 10
    • 0002786665 scopus 로고
    • Spline approximation by quasi-interpolents
    • C. de Boor and G. J. Fix, "Spline approximation by quasi-interpolents," J. Approx. Theory, vol. 8, pp. 19-45, 1973.
    • (1973) J. Approx. Theory , vol.8 , pp. 19-45
    • De Boor, C.1    Fix, G.J.2
  • 11
    • 0024053797 scopus 로고
    • Automatic pattern recognition: A study of the probability of error
    • L. Devroye, "Automatic pattern recognition: A study of the probability of error," IEEE Trans. Pattern Anal. Machine Intell., vol. 10, pp. 530-543, 1988.
    • (1988) IEEE Trans. Pattern Anal. Machine Intell. , vol.10 , pp. 530-543
    • Devroye, L.1
  • 13
    • 0032022221 scopus 로고    scopus 로고
    • Radial basis function networks and complexity regularization in function learning
    • A. Krzyzak and T. Linder, "Radial basis function networks and complexity regularization in function learning," IEEE Trans. Neural Networks, vol. 9, pp. 247-256, 1998.
    • (1998) IEEE Trans. Neural Networks , vol.9 , pp. 247-256
    • Krzyzak, A.1    Linder, T.2
  • 14
    • 33749932014 scopus 로고    scopus 로고
    • Adaptive model selection using empirical complexities
    • submitted for publication
    • G. Lugosi and A. Nobel, "Adaptive model selection using empirical complexities," Ann. Statist., 1996, submitted for publication.
    • (1996) Ann. Statist.
    • Lugosi, G.1    Nobel, A.2
  • 15
    • 0029307575 scopus 로고
    • Nonparametric estimation via empirical risk minimization
    • G. Lugosi and K. Zeger, "Nonparametric estimation via empirical risk minimization," IEEE Trans. Inform. Theory, vol. 41, pp. 677-687, 1995.
    • (1995) IEEE Trans. Inform. Theory , vol.41 , pp. 677-687
    • Lugosi, G.1    Zeger, K.2
  • 16
    • 0029754587 scopus 로고    scopus 로고
    • Concept learning using complexity regularization
    • _, "Concept learning using complexity regularization," IEEE Trans. Inform. Theory, vol. 42, pp. 48-54, 1996.
    • (1996) IEEE Trans. Inform. Theory , vol.42 , pp. 48-54
  • 18
    • 0346862811 scopus 로고
    • The use of polynomial splines and their tensor products in multivariate function estimation
    • C. J. Stone, "The use of polynomial splines and their tensor products in multivariate function estimation," Ann. Statist., vol. 22, pp. 118-184, 1994.
    • (1994) Ann. Statist. , vol.22 , pp. 118-184
    • Stone, C.J.1
  • 19
    • 0031672252 scopus 로고    scopus 로고
    • An asymptotic property of model selection criteria
    • Y. Yang and A. R. Barron, "An asymptotic property of model selection criteria," IEEE Trans. Inform. Theory, vol. 44, pp. 95-116, 1998.
    • (1998) IEEE Trans. Inform. Theory , vol.44 , pp. 95-116
    • Yang, Y.1    Barron, A.R.2
  • 20
    • 0033233737 scopus 로고    scopus 로고
    • Information-theoretic determination of minimax rates of convergence
    • _, "Information-theoretic determination of minimax rates of convergence," accepted by Ann. Statist., 1999.
    • (1999) Ann. Statist.


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