메뉴 건너뛰기




Volumn 30, Issue 1, 2002, Pages 1-50

Empirical margin distributions and bounding the generalization error of combined classifiers

Author keywords

Boosting; Combined classifier; Concentration inequalities; Empirical process; Gaussian process; Generalization error; Margin; Neural network; Rademacher process

Indexed keywords


EID: 0036104545     PISSN: 00905364     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (482)

References (37)
  • 2
    • 0001347323 scopus 로고
    • Complexity regularization with applications to artificial neural networks
    • (G. Roussas, ed.) Kluwer, Dordrecht
    • BARRON, A. (1991a). Complexity regularization with applications to artificial neural networks. In Nonparametric Functional Estimation and Related Topics (G. Roussas, ed.) 561-576. Kluwer, Dordrecht.
    • (1991) Nonparametric Functional Estimation and Related Topics , pp. 561-576
    • Barron, A.1
  • 5
    • 0032028728 scopus 로고    scopus 로고
    • The sample complexity of pattern classification with neural networks: The size of the weights is more important than the size of the network
    • BARTLETT, P. (1998). The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network. IEEE Trans. Inform. Theory 44 525-536.
    • (1998) IEEE Trans. Inform. Theory , vol.44 , pp. 525-536
    • Bartlett, P.1
  • 6
    • 0002094343 scopus 로고    scopus 로고
    • Generalization performance of support vector machines and other pattern classifiers
    • (B. Schölkopf, C. Burges and A. J. Smola, eds.) MIT Press
    • BARTLETT, P. and SHAWE-TAYLOR, J. (1999). Generalization performance of support vector machines and other pattern classifiers. In Advances in Kernel Methods: Support Vector Learning (B. Schölkopf, C. Burges and A. J. Smola, eds.) 43-54. MIT Press.
    • (1999) Advances in Kernel Methods: Support Vector Learning , pp. 43-54
    • Bartlett, P.1    Shawe-Taylor, J.2
  • 9
    • 0030211964 scopus 로고    scopus 로고
    • Bagging predictors
    • BREIMAN, L. (1996). Bagging predictors. Machine Learning 24 123-140.
    • (1996) Machine Learning , vol.24 , pp. 123-140
    • Breiman, L.1
  • 10
    • 34249753618 scopus 로고
    • Support vector networks
    • CORTES, C. and VAPNIK, V. (1995). Support vector networks. Machine Learning 20 273-297.
    • (1995) Machine Learning , vol.20 , pp. 273-297
    • Cortes, C.1    Vapnik, V.2
  • 15
    • 58149321460 scopus 로고
    • Boosting a weak learning algorithm by majority
    • FREUND, Y. (1995). Boosting a weak learning algorithm by majority. Inform, and Comput. 121 256-285.
    • (1995) Inform, and Comput. , vol.121 , pp. 256-285
    • Freund, Y.1
  • 17
    • 0003591748 scopus 로고    scopus 로고
    • Greedy function approximation: A gradient boosting machine
    • Dept. Statistics, Stanford Univ.
    • FRIEDMAN, J. (1999). Greedy function approximation: a gradient boosting machine. Technical report, Dept. Statistics, Stanford Univ.
    • (1999) Technical Report
    • Friedman, J.1
  • 18
    • 0034164230 scopus 로고    scopus 로고
    • Additive logistic regression: A statistical view of boosting
    • FRIEDMAN, J., HASTIE, T. and TIBSHIRANI, R. (2000). Additive logistic regression: a statistical view of boosting. Ann. Statist. 28 337-374.
    • (2000) Ann. Statist. , vol.28 , pp. 337-374
    • Friedman, J.1    Hastie, T.2    Tibshirani, R.3
  • 19
    • 0008978860 scopus 로고    scopus 로고
    • Oracle inequalities and nonparametric function estimation
    • JOHNSTONE, I. M. (1998). Oracle inequalities and nonparametric function estimation. In Doc. Math. (Extra Volume) 3 267-278.
    • (1998) Doc. Math. (Extra Volume) , vol.3 , pp. 267-278
    • Johnstone, I.M.1
  • 20
    • 0035397715 scopus 로고    scopus 로고
    • Rademacher penalties and structural risk minimization
    • To appear
    • KOLTCHINSKII, V. (2001). Rademacher penalties and structural risk minimization. IEEE Trans. Inform. Theory. To appear.
    • (2001) IEEE Trans. Inform. Theory
    • Koltchinskii, V.1
  • 21
    • 0001166808 scopus 로고    scopus 로고
    • Rademacher processes and bounding the risk of function learning
    • (E. Giné, D. Mason and J. Wellner, eds.) Birkhäuser, Boston
    • KOLTCHINSKII, V. and PANCHENKO, D. (2000). Rademacher processes and bounding the risk of function learning. In High Dimensional Probability II (E. Giné, D. Mason and J. Wellner, eds.) 444-459. Birkhäuser, Boston.
    • (2000) High Dimensional Probability II , pp. 444-459
    • Koltchinskii, V.1    Panchenko, D.2
  • 25
    • 0033870982 scopus 로고    scopus 로고
    • Improved generalization through explicit optimization of margins
    • MASON, L., BARTLETT, P. and BAXTER, J. (1999). Improved generalization through explicit optimization of margins. Machine Learning 38 243-255.
    • (1999) Machine Learning , vol.38 , pp. 243-255
    • Mason, L.1    Bartlett, P.2    Baxter, J.3
  • 26
    • 0002550596 scopus 로고    scopus 로고
    • Functional gradient techniques for combining hypotheses
    • (A. J. Smola, P. Bartlett, B. Schölkopf and D. Schurmans, eds.) MIT Press
    • MASON, L., BAXTER, J., BARTLETT, P. and FREAN, M. (2000). Functional gradient techniques for combining hypotheses. In Advances in Large Margin Classifiers (A. J. Smola, P. Bartlett, B. Schölkopf and D. Schurmans, eds.) MIT Press.
    • (2000) Advances in Large Margin Classifiers
    • Mason, L.1    Baxter, J.2    Bartlett, P.3    Frean, M.4
  • 27
    • 0034345597 scopus 로고    scopus 로고
    • About the constants in Talagrand's concentration inequalities for empirical processes
    • MASSART, P. (2000). About the constants in Talagrand's concentration inequalities for empirical processes. Ann. Probab. 28 863-885.
    • (2000) Ann. Probab. , vol.28 , pp. 863-885
    • Massart, P.1
  • 28
    • 0043114239 scopus 로고
    • On the Glivenko-Cantelli theorem
    • SAZONOV, V. V. (1963). On the Glivenko-Cantelli theorem. Theory Probab. Appl. 8 282-285.
    • (1963) Theory Probab. Appl. , vol.8 , pp. 282-285
    • Sazonov, V.V.1
  • 29
    • 0032280519 scopus 로고    scopus 로고
    • Boosting the margin: A new explanation for the effectiveness of voting methods
    • SCHAPIRE, R., FREUND, Y., BARTLETT, P. and LEE, W. S. (1998). Boosting the margin: A new explanation for the effectiveness of voting methods. Ann. Statist. 26 1651-1686.
    • (1998) Ann. Statist. , vol.26 , pp. 1651-1686
    • Schapire, R.1    Freund, Y.2    Bartlett, P.3    Lee, W.S.4
  • 30
    • 0030522124 scopus 로고    scopus 로고
    • A new look at independence
    • TALAGRAND, M. (1996a). A new look at independence. Ann. Probab. 24 1-34.
    • (1996) Ann. Probab. , vol.24 , pp. 1-34
    • Talagrand, M.1
  • 31
    • 0030489977 scopus 로고    scopus 로고
    • New concentration inequalities in product spaces
    • TALAGRAND, M. (1996b). New concentration inequalities in product spaces. Invent. Math. 126 505-563.
    • (1996) Invent. Math. , vol.126 , pp. 505-563
    • Talagrand, M.1
  • 32
    • 0009148982 scopus 로고    scopus 로고
    • Rigorous results for the Hopfield model with many patterns
    • TALAGRAND, M. (1998). Rigorous results for the Hopfield model with many patterns. Probab. Theory Related Fields 110 177-276.
    • (1998) Probab. Theory Related Fields , vol.110 , pp. 177-276
    • Talagrand, M.1
  • 37
    • 0029341524 scopus 로고
    • Sup-norm approximation bounds for networks through probabilistic methods
    • YUKICH, J., STINCHCOMBE, H. and WHITE, H. (1995). Sup-norm approximation bounds for networks through probabilistic methods. IEEE Trans. Inform. Theory 41 1021-1027.
    • (1995) IEEE Trans. Inform. Theory , vol.41 , pp. 1021-1027
    • Yukich, J.1    Stinchcombe, H.2    White, H.3


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