메뉴 건너뛰기




Volumn 128, Issue 2, 2004, Pages 187-206

Bernstein polynomials and learning theory

Author keywords

Bernstein polynomials; Entropy function; Learning theory; Optimal encoding

Indexed keywords


EID: 3543139501     PISSN: 00219045     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jat.2004.04.010     Document Type: Article
Times cited : (58)

References (14)
  • 3
    • 0000132624 scopus 로고
    • Inverse theorems for Bernstein polynomials
    • Berens H. Lorentz G.G. Inverse theorems for Bernstein polynomials Indiana Univ. Math. J. 21 1972 693-708
    • (1972) Indiana Univ. Math. J. , vol.21 , pp. 693-708
    • Berens, H.1    Lorentz, G.G.2
  • 4
    • 0347059548 scopus 로고
    • K-moduli, moduli of smoothness, and Bernstein polynomials on a simplex
    • Berens H. Xu Y. K-moduli, moduli of smoothness, and Bernstein polynomials on a simplex Indag. Math. 2 1991 411-421
    • (1991) Indag. Math. , vol.2 , pp. 411-421
    • Berens, H.1    Xu, Y.2
  • 5
    • 34547636257 scopus 로고    scopus 로고
    • How to achieve minimax expected Kullback-Leibler distance from an unknown finite distribution
    • N. Cesa-Bianchi, N. Numao, R. Reischuk (Eds.), Proceedings of the 13th International Conference ALT 2002, Springer, Heidelberg
    • Braess D. Forster J. Sauer T. Simon H.U. How to achieve minimax expected Kullback-Leibler distance from an unknown finite distribution in: Cesa-Bianchi N. Numao N. Reischuk R. (Eds.). Algorithmic Learning Theory, Proceedings of the 13th International Conference ALT 2002 2002 380-394 Springer Heidelberg
    • (2002) Algorithmic Learning Theory , pp. 380-394
    • Braess, D.1    Forster, J.2    Sauer, T.3    Simon, H.U.4
  • 6
    • 0015281945 scopus 로고
    • Admissibility properties of Gilbert's encoding for unknown source probabilities
    • Cover T.M. Admissibility properties of Gilbert's encoding for unknown source probabilities IEEE Trans. Inform. Theory 18 1971 216-217
    • (1971) IEEE Trans. Inform. Theory , vol.18 , pp. 216-217
    • Cover, T.M.1
  • 7
    • 0036476991 scopus 로고    scopus 로고
    • Relative expected instantaneous loss bounds
    • Forster J. Warmuth M. Relative expected instantaneous loss bounds J. Comput. System Sci. 65 2002 612-625
    • (2002) J. Comput. System Sci. , vol.65 , pp. 612-625
    • Forster, J.1    Warmuth, M.2
  • 8
    • 0002595447 scopus 로고
    • The lower estimate for linear positive operators. II
    • Knoop H.-P. Zhou X. The lower estimate for linear positive operators. II Resultate Math. 25 1994 315-330
    • (1994) Resultate Math. , vol.25 , pp. 315-330
    • Knoop, H.-P.1    Zhou, X.2
  • 9
    • 0031675931 scopus 로고    scopus 로고
    • Laplace's law of succession and universal encoding
    • Krichevskiy R.E. Laplace's law of succession and universal encoding IEEE Trans. Inform. Theory 44 1 1998 296-303
    • (1998) IEEE Trans. Inform. Theory , vol.44 , Issue.1 , pp. 296-303
    • Krichevskiy, R.E.1
  • 11
    • 0002859272 scopus 로고
    • Sur l'approximation des fonctions convexes d'ordre superieur
    • Popoviciu T. Sur l'approximation des fonctions convexes d'ordre superieur Mathematica 10 1935 49-54
    • (1935) Mathematica , vol.10 , pp. 49-54
    • Popoviciu, T.1
  • 12
    • 0010968550 scopus 로고
    • The genuine Bernstein-Durrmeyer operator on a simplex
    • Sauer T. The genuine Bernstein-Durrmeyer operator on a simplex Results Math. 26 1994 99-130
    • (1994) Results Math. , vol.26 , pp. 99-130
    • Sauer, T.1
  • 13
    • 84856043672 scopus 로고
    • A mathematical theory of communication
    • 379-423
    • Shannon C.E. A mathematical theory of communication Bell System Tech. J. 27 1948 379-423, 623-656
    • (1948) Bell System Tech. J. , vol.27 , pp. 623-656
    • Shannon, C.E.1
  • 14
    • 0000416807 scopus 로고
    • Approximation by Bernstein polynomials
    • Totik V. Approximation by Bernstein polynomials Amer. J. Math. 116 1994 995-1018
    • (1994) Amer. J. Math. , vol.116 , pp. 995-1018
    • Totik, V.1


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