메뉴 건너뛰기




Volumn 1, Issue , 2004, Pages 632-636

Forest trees for on-line data

Author keywords

Data Streams; Hybrid Forest of Trees

Indexed keywords

ADAPTIVE SYSTEMS; ALGORITHMS; APPROXIMATION THEORY; DATA MINING; DATA STRUCTURES; DECISION MAKING; FUNCTIONS; PARAMETER ESTIMATION; PROBLEM SOLVING;

EID: 2442562542     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/967900.968033     Document Type: Conference Paper
Times cited : (65)

References (15)
  • 2
    • 0041382385 scopus 로고    scopus 로고
    • Random forests
    • University of Berkeley
    • Leo Breiman. Random forests. Technical report, University of Berkeley, 2002.
    • (2002) Technical Report
    • Breiman, L.1
  • 8
    • 0030231557 scopus 로고    scopus 로고
    • Efficient incremental induction of decision trees
    • Dimitrios Kalles and Tim Morris. Efficient incremental induction of decision trees. Machine Learning, 24(3):231-242, 1996.
    • (1996) Machine Learning , vol.24 , Issue.3 , pp. 231-242
    • Kalles, D.1    Morris, T.2
  • 9
    • 22444454265 scopus 로고    scopus 로고
    • Combining classifiers: A theoretical framework
    • J. Kittler. Combining classifiers: A theoretical framework. Pattern analysis and Applications, Vol. 1, No. 1, 1998.
    • (1998) Pattern Analysis and Applications , vol.1 , Issue.1
    • Kittler, J.1
  • 11
    • 0031312210 scopus 로고    scopus 로고
    • Split selection methods for classification trees
    • W.-Y. Loh and Y.-S. Shih. Split selection methods for classification trees. Statistica Sinica, 1997.
    • (1997) Statistica Sinica
    • Loh, W.-Y.1    Shih, Y.-S.2
  • 15
    • 0031246271 scopus 로고    scopus 로고
    • Decision tree induction based on efficient tree restructuring
    • P. Utgoff, N. Berkman, and J. Clouse. Decision tree induction based on efficient tree restructuring. Machine Learning, 29(1):5-44, 1997.
    • (1997) Machine Learning , vol.29 , Issue.1 , pp. 5-44
    • Utgoff, P.1    Berkman, N.2    Clouse, J.3


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