메뉴 건너뛰기




Volumn 2035, Issue , 2001, Pages 477-487

Optimizing the induction of alternating decision trees

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA MINING; DECISION TREES;

EID: 84942926770     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-45357-1_50     Document Type: Conference Paper
Times cited : (38)

References (9)
  • 1
    • 0003408496 scopus 로고    scopus 로고
    • Irvine CA: University of California, Department of Information and Com- puter Science. [
    • Blake, C. L., Keogh, E., Merz, C.J.: UCI Repository of Machine Learning Data- Bases. Irvine, CA: University of California, Department of Information and Com- puter Science. [http://www.ics.uci.edu/ mlearn/MLRepository.html] (1998).
    • (1998) UCI Repository of Machine Learning Data- Bases
    • Blake, C.L.1    Keogh, E.2    Merz, C.J.3
  • 2
    • 0030211964 scopus 로고    scopus 로고
    • Bagging predictors
    • Breiman L.: Bagging Predictors, Machine Learning, 24(2), 1996.
    • (1996) Machine Learning , vol.24 , pp. 2
    • Breiman, L.1
  • 3
    • 0034250160 scopus 로고    scopus 로고
    • An experimental comparison of three methods for construct- ing ensembles of decision trees: Bagging, boosting, and randomization
    • Dietterich T.G.: An Experimental Comparison of Three Methods for Construct- ing Ensembles of Decision Trees: Bagging, Boosting, and Randomization, Machine Learning, 40(2), 139-158, 2000.
    • (2000) Machine Learning , vol.40 , Issue.2 , pp. 139-158
    • Dietterich, T.G.1
  • 6
    • 84949968753 scopus 로고    scopus 로고
    • Mini boosting decision trees
    • available at
    • Quinlan, J.R.: MiniBoosting Decision Trees. Draft (1999) (available at http://www.cse.unsw.EDU.AU/~quinlan/miniboost.ps).
    • (1999) Draft
    • Quinlan, J.R.1
  • 7
    • 0033281701 scopus 로고    scopus 로고
    • Improved boosting algorithms using confidence-rated predictions
    • Schapire, R.E., Singer, Y.: Improved boosting algorithms using confidence-rated predictions. Machine Learning 37 (3) (1999) 297-336.
    • (1999) Machine Learning , vol.37 , Issue.3 , pp. 297-336
    • Schapire, R.E.1    Singer, Y.2
  • 8
    • 0026187945 scopus 로고
    • The zero-frequency problem: Estimating the probabilities of novel events in adaptive text compression
    • Witten, I.H., Bell, T.C.: The zero-frequency problem: Estimating the probabilities of novel events in adaptive text compression. IEEE Transactions on Information Theory 37(4) (1991) 1085-1094.
    • (1991) IEEE Transactions on Information Theory , vol.37 , Issue.4 , pp. 1085-1094
    • Witten, I.H.1    Bell, T.C.2


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