Reducing decision tree fragmentation through attribute value grouping: A comparative study

Authors:
K. M. Ho;P. D. Scott
Affiliations:
Department of Computer Science, University of Essex, Colchester, CO4 3SQ, UK. E-mail: {hokokx, scotp}@essex.ac.uk;Department of Computer Science, University of Essex, Colchester, CO4 3SQ, UK. E-mail: {hokokx, scotp}@essex.ac.uk
Venue:
Intelligent Data Analysis
Year:
2000

Citing 13
Cited 1

Optimal Partitioning for Classification and Regression Trees

IEEE Transactions on Pattern Analysis and Machine Intelligence
C4.5: programs for machine learning

C4.5: programs for machine learning
Bottom-up induction of oblivious read-once decision graphs

ECML-94 Proceedings of the European conference on machine learning on Machine Learning
Branching on attribute values in decision tree generation

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Machine learning, neural and statistical classification

Machine learning, neural and statistical classification
Transforming rules and trees

Advances in knowledge discovery and data mining
Data-Driven Constructive Induction

IEEE Intelligent Systems
Induction of Decision Trees

Machine Learning
On Changing Continuous Attributes into Ordered Discrete Attributes

EWSL '91 Proceedings of the European Working Session on Machine Learning
Forming Categories in Exploratory Data Analysis and Data Mining

IDA '97 Proceedings of the Second International Symposium on Advances in Intelligent Data Analysis, Reasoning about Data
Simplifying decision trees: A survey

The Knowledge Engineering Review
Improved use of continuous attributes in C4.5

Journal of Artificial Intelligence Research
On biases in estimating multi-valued attributes

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2

Rough sets approach to symbolic value partition

International Journal of Approximate Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

Discovery of multivalued dependencies from database relations is viewed as a search in a hypothesis space defined according to the generalisation relationship among multivalued dependencies. Two algorithms for the discovery of multivalued dependencies ...