메뉴 건너뛰기




Volumn , Issue , 1999, Pages 564-570

Regularizing AdaBoost

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

EID: 0001102148     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (32)

References (14)
  • 2
    • 0030211964 scopus 로고    scopus 로고
    • Bagging predictors
    • L. Breiman. Bagging predictors. Machine Learning, 26(2):123-140, 1996.
    • (1996) Machine Learning , vol.26 , Issue.2 , pp. 123-140
    • Breiman, L.1
  • 5
    • 34249753618 scopus 로고
    • Support vector network
    • C. Cortes, V. Vapnik. Support vector network. Mach. Learn., 20:273-297, 1995.
    • (1995) Mach. Learn. , vol.20 , pp. 273-297
    • Cortes, C.1    Vapnik, V.2
  • 6
    • 84898989138 scopus 로고    scopus 로고
    • Improved boosting algorithms using confidence-rated predictions
    • R. Schapire, Y. Singer. Improved Boosting Algorithms Using Confidence-rated Predictions. In Proc. of COLT'98.
    • Proc. of COLT'98
    • Schapire, R.1    Singer, Y.2
  • 7
    • 0031638384 scopus 로고    scopus 로고
    • Boosting in the limit: Maximizing the margin of learned ensembles
    • To appear
    • A.J. Grove, D. Schuurmans. Boosting in the limit: Maximizing the margin of learned ensembles. In Proc. 15th Nat. Conf. on AI, 1998. To appear.
    • (1998) Proc. 15th Nat. Conf. on AI
    • Grove, A.J.1    Schuurmans, D.2
  • 8
    • 0002859310 scopus 로고
    • Learning algorithms for classification: A comparism on handwritten digit recognistion
    • Y. LeCun et al. Learning algorithms for classification: A comparism on handwritten digit recognistion. Neural Networks, pages 261-276, 1995.
    • (1995) Neural Networks , pp. 261-276
    • LeCun, Y.1
  • 9
    • 0342749314 scopus 로고    scopus 로고
    • An asymptotic analysis of adaboost in the binary classification case
    • April
    • T. Onoda, G. Ratsch, and K.-R. Müller. An asymptotic analysis of adaboost in the binary classification case. In Proc. of ICANN'98, April 1998.
    • (1998) Proc. of ICANN'98
    • Onoda, T.1    Ratsch, G.2    Müller, K.-R.3
  • 11
    • 0003851811 scopus 로고    scopus 로고
    • August Royal Holloway College, Technical Report NC-TR-1998-021. Submitted to Machine Learning
    • G. Ratsch. Soft Margins for AdaBoost. August 1998. Royal Holloway College, Technical Report NC-TR-1998-021. Submitted to Machine Learning.
    • (1998) Soft Margins for AdaBoost
    • Ratsch, G.1
  • 12
    • 0002595663 scopus 로고    scopus 로고
    • Boosting the margin: A new explanation for the effectiveness of voting methods
    • R. Schapire, Y. Freund, P. Bartlett, W. Lee. Boosting the margin: A new explanation for the effectiveness of voting methods. Mach. Learn., 148-156, 1998.
    • (1998) Mach. Learn. , pp. 148-156
    • Schapire, R.1    Freund, Y.2    Bartlett, P.3    Lee, W.4
  • 13
    • 84956609453 scopus 로고    scopus 로고
    • Adaboosting neural networks: Application to online character recognition
    • Springer
    • H. Schwenk and Y. Bengio. "Adaboosting neural networks: Application to online character recognition. In ICANN'97, LNCS, 1327, 967-972, 1997. Springer.
    • (1997) ICANN'97, LNCS , vol.1327 , pp. 967-972
    • Schwenk, H.1    Bengio, Y.2


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