Abstract:
ABSTRACT: This paper studies the effects on decision tree learning of constructing four types of attribute (conjunctive, disjunctive, M-of-N, and X-of-N representations). To reduce effects of other factors such as tree learning methods, new attribute search strategies, search starting points, evaluation functions, and stopping criteria, a single tree learning algorithm is developed. With different option settings, it can construct four different types of new attribute, but all other factors are fixed. The study reveals that conjunctive and disjunctive representations have very similar performance in terms of prediction accuracy and theory complexity on a variety of concepts, even on DNF and CNF concepts that are usually thought to be suited only to one of the two kinds of representation. In addition, the study demonstrates that the stronger representation power of M-of-N than conjunction and disjunction and the stronger representation power of X-of-N than these three types of new attribute can be reflected in the performance of decision tree learning in terms of higher prediction accuracy and lower theory complexity.
Citations
|
2438
|
Classification and Regression Trees
– Breiman, Friedman, et al.
- 1984
|
|
655
|
UCI Repository of Machine Learning Databases [machine-readable data repository
– Murphy, Aha
- 1992
|
|
509
|
C4.5: Programs for
– Quinlan
- 1993
|
|
418
|
Multi-interval discretization of continuous-valued attributes for classification learning
– Fayyad, Irani
- 1993
|
|
265
|
Inferring decision trees using the minimum description length principle
– Quinlan, Rivest
- 1989
|
|
191
|
Boolean feature discovery in empirical learning
– Pagallo, Haussler
- 1990
|
|
130
|
A Conservation Law for Generalization Performance
– Schaffer
- 1994
|
|
129
|
On changing continuous attributes into ordered discrete attributes
– Catlett
- 1991
|
|
103
|
HypothesisDriven Constructive Induction in AQ17-HCI: A Method and Experiments
– Wnek, Michalski
- 1994
|
|
54
|
Id2-of-3: Constructive induction of m-of-n concepts for discriminators in decision trees
– Murphy, Pazzani
- 1991
|
|
53
|
Lookahead feature construction for learning hard concepts
– Ragavan, Rendell
- 1993
|
|
52
|
A comparative study of ID3 and backpropagation for English text-to-speech mapping
– Dietterich, Hild, et al.
- 1990
|
|
37
|
Feature Construction: An Analytic Framework and an Application to Decision Trees
– Matheus
- 1989
|
|
33
|
For every generalization action, is there really an equal and opposite reaction? Analysis of the conservation law for generalization performance
– Rao, Gordon
- 1995
|
|
29
|
Pattern Recognition as Knowledge-Guided Computer Induction
– Michalski
- 1978
|
|
27
|
Learning Categorical Decision Criteria in Biomedical Domains
– Spackman
- 1988
|
|
25
|
Multistrategy Constructive Induction: AQ17-MCI
– Bloedorn, Michalski, et al.
- 1993
|
|
25
|
Adaptive Decision Tree Algorithms for Learning From Examples
– Pagallo
- 1990
|
|
16
|
de Merckt. Decision trees in numerical attribute spaces
– Van
- 1993
|
|
16
|
A scheme for feature construction and a comparison of empirical methods
– YANG, RENDELL, et al.
- 1991
|
|
14
|
Constructing nominal x-of-n attributes
– Zheng
- 1995
|
|
13
|
Two Algorithms that Learn DNF by Discovering Relevant Features
– Pagallo, Haussler
- 1989
|
|
6
|
An M-of-N rule induction algorithm and its application to DNA domain
– Ting
- 1994
|
|
5
|
Continuous-valued X-of-N attributes versus nominal X-of-N attributes for constructive induction: a case study
– Zheng
- 1995
|
|
