메뉴 건너뛰기




Volumn 292, Issue 2, 2003, Pages 447-464

Top-down decision tree learning as information based boosting

Author keywords

[No Author keywords available]

Indexed keywords

CLASSIFICATION (OF INFORMATION); DECISION THEORY; INFORMATION THEORY; LEARNING ALGORITHMS; TREES (MATHEMATICS);

EID: 0037467653     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00181-0     Document Type: Conference Paper
Times cited : (19)

References (14)
  • 1
    • 0012372245 scopus 로고    scopus 로고
    • Improving algorithms for boosting
    • J.A. Aslam, Improving algorithms for boosting, in: Proc. 13th COLT, 2000, pp. 200-207.
    • (2000) Proc. 13th COLT , pp. 200-207
    • Aslam, J.A.1
  • 3
    • 58149321460 scopus 로고
    • Boosting a weak learning algorithm by majority
    • Freund Y. Boosting a weak learning algorithm by majority. Inform. and Comput. 121(2):1995;256-285.
    • (1995) Inform. and Comput. , vol.121 , Issue.2 , pp. 256-285
    • Freund, Y.1
  • 5
    • 0031211090 scopus 로고    scopus 로고
    • A decision-theoretic generalization of on-line learning and an application to boosting
    • Freund Y., Schapire R.E. A decision-theoretic generalization of on-line learning and an application to boosting. J. Comput. Systems Sci. 55(1):1997;119-139.
    • (1997) J. Comput. Systems Sci. , vol.55 , Issue.1 , pp. 119-139
    • Freund, Y.1    Schapire, R.E.2
  • 7
    • 0033075132 scopus 로고    scopus 로고
    • On the boosting ability of top-down decision tree learning algorithms
    • Kearns M., Mansour Y. On the boosting ability of top-down decision tree learning algorithms. J. Comput. Systems Sci. 58(1):1999;109-128.
    • (1999) J. Comput. Systems Sci. , vol.58 , Issue.1 , pp. 109-128
    • Kearns, M.1    Mansour, Y.2
  • 8
    • 0002623242 scopus 로고    scopus 로고
    • Boosting using branching programs
    • Y. Mansour, D. McAllester, Boosting using branching programs, in: Proc. 13th COLT, 2000, pp. 220-224.
    • (2000) Proc. 13th COLT , pp. 220-224
    • Mansour, Y.1    McAllester, D.2
  • 11
    • 0025448521 scopus 로고
    • The strength of weak learnability
    • Schapire R.E. The strength of weak learnability. Mach. Learning. 5(2):1990;197-227.
    • (1990) Mach. Learning , vol.5 , Issue.2 , pp. 197-227
    • Schapire, R.E.1
  • 12
    • 0002595663 scopus 로고    scopus 로고
    • Boosting the margin: A new explanation for the effectiveness of voting methods
    • Morgan Kaufmann, Los Altos, CA
    • R.E. Schapire, Y. Freund, P. Bartlett, W.S. Lee, Boosting the margin: a new explanation for the effectiveness of voting methods, in: Proc. 14th Internat. Conf. on Machine Learning, Morgan Kaufmann, Los Altos, CA, 1997, pp. 322-330.
    • (1997) Proc. 14th Internat. Conf. on Machine Learning , pp. 322-330
    • Schapire, R.E.1    Freund, Y.2    Bartlett, P.3    Lee, W.S.4
  • 14
    • 0012417189 scopus 로고
    • Mutual information gaining algorithm and its relation to PAC-learning algorithm
    • Proc. 5th Internat. Workshop on Algorithmic Learning Theory, Springer, Berlin
    • E. Takimoto, I. Tajika, A. Maruoka, Mutual information gaining algorithm and its relation to PAC-learning algorithm, in: Proc. 5th Internat. Workshop on Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence, Vol. 872, Springer, Berlin, 1994, pp. 547-559.
    • (1994) Lecture Notes in Artificial Intelligence , vol.872 , pp. 547-559
    • Takimoto, E.1    Tajika, I.2    Maruoka, A.3


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