A Decision Tree Algorithm for Ordinal Classification

Authors:
Rob Potharst;Jan C. Bioch
Affiliations:
-;-
Venue:
IDA '99 Proceedings of the Third International Symposium on Advances in Intelligent Data Analysis
Year:
1999

Citing 3
Cited 1

Learning and classification of monotonic ordinal concepts

Computational Intelligence
C4.5: programs for machine learning

C4.5: programs for machine learning
Monotonicity Maintenance in Information-Theoretic Machine Learning Algorithms

Machine Learning

Citation-based journal ranks: The use of fuzzy measures

Fuzzy Sets and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In many classification problems the domains of the attributes and the classes are linearly orderded. For such problems the classification rule often needs to be order-preserving or monotone as we call it. Since the known decision tree methods generate non-monotone trees, these methods are not suitable for monotone classification problems. We provide an order-preserving tree-generation algorithm for multiattribute classification problems with k linearly ordered classes, and an algorithm for repairing non-monotone decision trees. The performance of these algorithms is tested on random monotone datasets.