|
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;
ALTERNATING DECISION TREES;
AVERAGE-CASE COMPLEXITY;
KNOWLEDGE DISCOVERY IN DATABASE;
LINEAR COMPLEXITY;
MULTIPLE-PATH;
ORIGINAL ALGORITHMS;
PERFORMANCE CHARACTERISTICS;
PERFORMANCE ENHANCING;
HEURISTIC METHODS;
|
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)
|