메뉴 건너뛰기




Volumn 6862 LNCS, Issue , 2011, Pages 471-483

Moderated VFDT in stream mining using adaptive tie threshold and incremental pruning

Author keywords

Data Stream Mining; Hoeffding Bound; Incremental Pruning

Indexed keywords

BUILDING PROCESS; CONTINUOUS DATA; DATA STREAM; DATA STREAM MINING; DECISION-TREE ALGORITHM; HOEFFDING BOUND; INCREMENTAL COMPUTING; INCREMENTAL PRUNING; NEW MODEL; OPEN PROBLEMS; OPTIMAL BALANCE; PRE-PRUNING; SPLITTING NODES; STREAM MINING; STREAMING OPERATIONS; TREE SIZE;

EID: 80052341936     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-23544-3_36     Document Type: Conference Paper
Times cited : (34)

References (7)
  • 1
    • 0001923944 scopus 로고
    • Hoeffding races: Accelerating Model Selection Search for Classification and Function Approximation
    • Maron, O., Moore, A.W. Hoeffding races: Accelerating Model Selection Search for Classification and Function Approximation. In: NIPS, pp. 59-66 (1993)
    • (1993) NIPS , pp. 59-66
    • Maron, O.1    Moore, A.W.2
  • 5
    • 78649934709 scopus 로고    scopus 로고
    • University of California, School of Information and Computer Science, Irvine, CA
    • Frank, A., Asuncion, A.: UCI Machine Learning Repository. University of California, School of Information and Computer Science, Irvine, CA (2010), http://archive.ics.uci.edu/ml
    • (2010) UCI Machine Learning Repository
    • Frank, A.1    Asuncion, A.2


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