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, 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. Moreover, the study demonstrates that the stronger representation power of M-of-N than conjunction a...
Conventional algorithms for decision tree induction use an attribute-value representation scheme for...
One subfield of machine learning is the induction of a representation of a concept from positive and...
: An X-of-N is a set containing one or more attribute-value pairs. For a given instance, its value c...
. While many constructive induction algorithms focus on generating new binary attributes, this paper...
We discuss an approach to constructing composite features during the induction of decision trees. Th...
We focus on developing improvements to algorithms that generate decision trees from training data. T...
We focus on developing improvements to algorithms that generate decision trees from training data. T...
One approach to induction is to develop a decision tree from a set of examples. When used with noisy...
Abstract. Decision tree learning represents a well known family of inductive learning algo-rithms th...
This paper shows how a meta-learning technique can be applied to decisions about pruning and represe...
Some apparently simple numeric data sets cause significant problems for existing decision tree induc...
In [7], a new information-theoretic attribute selection method for decision tree induction was intro...
Simple techniques for the development and use of decision tree classiers assume that all attribute v...
The ability to restructure a decision tree efficiently enables a variety of approaches to decision t...
We discuss and test empirically the effects of six dimensions along which existing decision tree ind...
Conventional algorithms for decision tree induction use an attribute-value representation scheme for...
One subfield of machine learning is the induction of a representation of a concept from positive and...
: An X-of-N is a set containing one or more attribute-value pairs. For a given instance, its value c...
. While many constructive induction algorithms focus on generating new binary attributes, this paper...
We discuss an approach to constructing composite features during the induction of decision trees. Th...
We focus on developing improvements to algorithms that generate decision trees from training data. T...
We focus on developing improvements to algorithms that generate decision trees from training data. T...
One approach to induction is to develop a decision tree from a set of examples. When used with noisy...
Abstract. Decision tree learning represents a well known family of inductive learning algo-rithms th...
This paper shows how a meta-learning technique can be applied to decisions about pruning and represe...
Some apparently simple numeric data sets cause significant problems for existing decision tree induc...
In [7], a new information-theoretic attribute selection method for decision tree induction was intro...
Simple techniques for the development and use of decision tree classiers assume that all attribute v...
The ability to restructure a decision tree efficiently enables a variety of approaches to decision t...
We discuss and test empirically the effects of six dimensions along which existing decision tree ind...
Conventional algorithms for decision tree induction use an attribute-value representation scheme for...
One subfield of machine learning is the induction of a representation of a concept from positive and...
: An X-of-N is a set containing one or more attribute-value pairs. For a given instance, its value c...