메뉴 건너뛰기




Volumn , Issue , 2003, Pages 601-607

Skewing: An efficient alternative to lookahead for decision tree induction

Author keywords

[No Author keywords available]

Indexed keywords

DECISION TREE INDUCTION; DECISION TREE LEARNERS; PARITY FUNCTIONS; RUNTIMES; SUBFUNCTIONS; TIME COMPLEXITY;

EID: 84880788892     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (22)

References (10)
  • 3
    • 0030211964 scopus 로고    scopus 로고
    • Bagging predictors
    • L. Breiman. Bagging predictors. Machine Learning. 24(2): 123-140, 1996. (Pubitemid 126724382)
    • (1996) Machine Learning , vol.24 , Issue.2 , pp. 123-140
    • Breiman, L.1
  • 4
    • 0036931049 scopus 로고    scopus 로고
    • Data perturbation for escaping local maxima in learning
    • G. Elidan, M. Ninio, N. Friedman, and D. Schuurmans. Data perturbation for escaping local maxima in learning. In AAAI-02/IAAI-02, pages 132-139, 2002.
    • (2002) AAAI-02/IAAI-02 , pp. 132-139
    • Elidan, G.1    Ninio, M.2    Friedman, N.3    Schuurmans, D.4
  • 5
    • 0031211090 scopus 로고    scopus 로고
    • A decision-theoretic generalization of on-line learning and an application to boosting
    • Y. Freund and R. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55.119-139, 1997.
    • (1997) Journal of Computer and System Sciences , vol.55 , pp. 119-139
    • Freund, Y.1    Schapire, R.2
  • 6
    • 0002219642 scopus 로고    scopus 로고
    • Learning bayesian network structure from massive datasets: The "sparse candidate" algorithm
    • Nir Friedman, Iftach Nachman, and Dana Peer. Learning bayesian network structure from massive datasets: The "sparse candidate" algorithm. In UAI-99, pages 206-215, 1999.
    • (1999) UAI-99 , pp. 206-215
    • Friedman, N.1    Nachman, I.2    Peer, D.3
  • 7
    • 0005971872 scopus 로고
    • Generating better decision trees
    • S. Norton. Generating better decision trees. In IJCAI-89, pages 800-805, 1989.
    • (1989) IJCAI-89 , pp. 800-805
    • Norton, S.1
  • 8
    • 0001857179 scopus 로고
    • Learning efficient classification procedures and their application to chess end games
    • R.S. Michalski, J.G. Carbonell, and T.M. Mitchell, editors, chapter 15, Morgan Kaufmann Publishers
    • J.R. Quinlan. Learning efficient classification procedures and their application to chess end games. In R.S. Michalski, J.G. Carbonell, and T.M. Mitchell, editors, Machine Learning I, chapter 15, pages 463-482. Morgan Kaufmann Publishers, 1983.
    • (1983) Machine Learning I , pp. 463-482
    • Quinlan, J.R.1


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