Linear function neurons: Structure and training
Biological Cybernetics
Disjunctive models of boolean category learning
Biological Cybernetics
Scientific discovery: computational explorations of the creative process
Scientific discovery: computational explorations of the creative process
Inferring decision trees using the minimum description length principle
Information and Computation
Boolean Feature Discovery in Empirical Learning
Machine Learning
On changing continuous attributes into ordered discrete attributes
EWSL-91 Proceedings of the European working session on learning on Machine learning
C4.5: programs for machine learning
C4.5: programs for machine learning
Machine Learning
Extracting Refined Rules from Knowledge-Based Neural Networks
Machine Learning
Hypothesis-Driven Constructive Induction in AQ17-HCI: A Method and Experiments
Machine Learning - Special issue on evaluating and changing representation
Data-Driven Constructive Induction
IEEE Intelligent Systems
Automatic Feature Generation for Problem Solving Systems
ML '92 Proceedings of the Ninth International Workshop on Machine Learning
Multivariate Versus Univariate Decision Trees
Multivariate Versus Univariate Decision Trees
On the informativeness of the DNA promoter sequences domain theory
Journal of Artificial Intelligence Research
Constructing nominal X-of-N attributes
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Oblivious decision trees graphs and top down pruning
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Structured Features from Concept Lattices for Unsupervised Learning and Classification
AI '02 Proceedings of the 15th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
CAEP: Classification by Aggregating Emerging Patterns
DS '99 Proceedings of the Second International Conference on Discovery Science
ART: A Hybrid Classification Model
Machine Learning
Constructive induction and genetic algorithms for learning concepts with complex interaction
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Machine learning: a review of classification and combining techniques
Artificial Intelligence Review
A Genetic-Based Feature Construction Method for Data Summarisation
ADMA '08 Proceedings of the 4th international conference on Advanced Data Mining and Applications
Dynamic Aggregation of Relational Attributes Based on Feature Construction
ADBIS '08 Proceedings of the 12th East European conference on Advances in Databases and Information Systems
Expert Systems with Applications: An International Journal
Supervised Machine Learning: A Review of Classification Techniques
Proceedings of the 2007 conference on Emerging Artificial Intelligence Applications in Computer Engineering: Real Word AI Systems with Applications in eHealth, HCI, Information Retrieval and Pervasive Technologies
Evolutionary multi-feature construction for data reduction: A case study
Applied Soft Computing
Genetic programming for attribute construction in data mining
EuroGP'03 Proceedings of the 6th European conference on Genetic programming
Inferring ECA-based rules for ambient intelligence using evolutionary feature extraction
Journal of Ambient Intelligence and Smart Environments
Hi-index | 0.00 |
While many constructive induction algorithms focus on generating new binary attributes, this paper explores novel methods of constructing nominal and numeric attributes. We propose a new constructive operator, X-of-N. An X-of-N representation is a set containing one or more attribute-value pairs. For a given instance, the value of an X-of-N representation corresponds to the number of its attribute-value pairs that are true of the instance. A single X-of-N representation can directly and simply represent any concept that can be represented by a single conjunctive, a single disjunctive, or a single M-of-N representation commonly used for constructive induction, and the reverse is not true. In this paper, we describe a constructive decision tree learning algorithm, called XofN. When building decision trees, this algorithm creates one X-of-N representation, either as a nominal attribute or as a numeric attribute, at each decision node. The construction of X-of-N representations is carried out by greedily searching the space defined by all the attribute-value pairs of a domain. Experimental results reveal that constructing X-of-N attributes can significantly improve the performance of decision tree learning in both artificial and natural domains in terms of higher prediction accuracy and lower theory complexity. The results also show the performance advantages of constructing X-of-N attributes over constructing conjunctive, disjunctive, or M-of-N representations for decision tree learning.