Multiclass Alternating Decision Trees

Authors:
Geoffrey Holmes;Bernhard Pfahringer;Richard Kirkby;Eibe Frank;Mark Hall
Affiliations:
-;-;-;-;-
Venue:
ECML '02 Proceedings of the 13th European Conference on Machine Learning
Year:
2002

Citing 8
Cited 14

Improved boosting algorithms using confidence-rated predictions

COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Approximate statistical tests for comparing supervised classification learning algorithms

Neural Computation
Using output codes to boost multiclass learning problems

ICML '97 Proceedings of the Fourteenth International Conference on Machine Learning
The Alternating Decision Tree Learning Algorithm

ICML '99 Proceedings of the Sixteenth International Conference on Machine Learning
Option Decision Trees with Majority Votes

ICML '97 Proceedings of the Fourteenth International Conference on Machine Learning
Reducing multiclass to binary: a unifying approach for margin classifiers

The Journal of Machine Learning Research
Round robin classification

The Journal of Machine Learning Research
Solving multiclass learning problems via error-correcting output codes

Journal of Artificial Intelligence Research

Combining Subclassifiers in Text Categorization: A DST-Based Solution and a Case Study

IEEE Transactions on Knowledge and Data Engineering
A Wrapper Method for Feature Selection in Multiple Classes Datasets

IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient Intelligence
Rotation-based model trees for classification

International Journal of Data Analysis Techniques and Strategies
Learning multi-label alternating decision trees from texts and data

MLDM'03 Proceedings of the 3rd international conference on Machine learning and data mining in pattern recognition
Complex feature alternating decision tree

International Journal of Intelligent Systems Technologies and Applications
Feature selection and classification in multiple class datasets: An application to KDD Cup 99 dataset

Expert Systems with Applications: An International Journal
Building digital ink recognizers using data mining: distinguishing between text and shapes in hand drawn diagrams

IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part I
Technical Section: Using data mining for digital ink recognition: Dividing text and shapes in sketched diagrams

Computers and Graphics
Development of a data mining-based analysis framework for multi-attribute construction project information

Advanced Engineering Informatics
Gene selection for cancer tumor detection using a novel memetic algorithm with a multi-view fitness function

Engineering Applications of Artificial Intelligence
An approach for web service discoverability anti-pattern detection for journal of web engineering

Journal of Web Engineering
Supervised machine learning for grouping sketch diagram strokes

Proceedings of the International Symposium on Sketch-Based Interfaces and Modeling
Application of data mining techniques on EMG registers of hemiplegic patients

ICDM'13 Proceedings of the 13th international conference on Advances in Data Mining: applications and theoretical aspects
A hybrid decision tree classifier

Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

The alternating decision tree (ADTree) is a successful classification technique that combines decision trees with the predictive accuracy of boosting into a set of interpretable classification rules. The original formulation of the tree induction algorithm restricted attention to binary classification problems. This paper empirically evaluates several wrapper methods for extending the algorithm to the multiclass case by splitting the problem into several two-class problems. Seeking a more natural solution we then adapt the multiclass LogitBoost and AdaBoost.MH procedures to induce alternating decision trees directly. Experimental results confirm that these procedures are comparable with wrapper methods that are based on the original ADTree formulation in accuracy, while inducing much smaller trees.