메뉴 건너뛰기




Volumn , Issue , 2012, Pages 778-784

Improved decision tree induction: Prioritized height balanced tree with entropy to find hidden rules

Author keywords

Attribute oriented induction; Concept hierarchy; Data mining query language; Heightbalancepriority algorithm; Information entropy

Indexed keywords

ATTRIBUTE ORIENTED INDUCTION; C4.5 DECISION TREE ALGORITHM; CLASSIFICATION ALGORITHM; CONCEPT HIERARCHIES; DATA MINING QUERIES; DATA SETS; DECISION TREE INDUCTION; HEIGHT-BALANCED TREES; HIDDEN RULES; INFORMATION ENTROPY; LARGE DATABASE; LEVELS OF ABSTRACTION; MULTILEVELS;

EID: 84870697180     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2393216.2393346     Document Type: Conference Paper
Times cited : (1)

References (14)
  • 13
    • 0024627518 scopus 로고
    • Inferring decision trees using the minimum description length principle
    • ACM, 1989
    • J.R. Quinlan and R.L. Rivest, 1989. Inferring Decision Trees Using the Minimum Description Length Principle, Journal of Information and Computation, ACM volume 80, pp. 227- 248, 1989.
    • (1989) Journal of Information and Computation , vol.80 , pp. 227-248
    • Quinlan, J.R.1    Rivest, R.L.2


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