Rule extraction from ensemble methods using aggregated decision trees

Authors:
Md. Ridwan Al Iqbal
Affiliations:
Department of Computer Science, American International University-Bangladesh (AIUB), Banani, Dhaka, Bangladesh
Venue:
ICONIP'12 Proceedings of the 19th international conference on Neural Information Processing - Volume Part II
Year:
2012

Citing 6
Cited 0

C4.5: programs for machine learning

C4.5: programs for machine learning
Bagging predictors

Machine Learning
Optimal linear combinations of neural networks

Neural Networks
Logic Minimization Algorithms for VLSI Synthesis

Logic Minimization Algorithms for VLSI Synthesis
Neural Network Ensembles

IEEE Transactions on Pattern Analysis and Machine Intelligence
Rule Extraction from Recurrent Neural Networks: A Taxonomy and Review

Neural Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Ensemble methods have become very well known for being powerful pattern recognition algorithms capable of achieving high accuracy. However, Ensemble methods produces learners that are not comprehensible or transferable thus making them unsuitable for tasks that require a rational justification for making a decision. Rule Extraction methods can resolve this limitation by extracting comprehensible rules from a trained ensembles of classifiers. In this paper, we present an algorithm called REEMTIC that uses a symbolic learning algorithm (Decision Tree) on each underlying classifier of the ensemble and combines them. Experiments and theoretical analysis show REEMTIC generates highly accurate rules that closely approximates the Ensemble Learned Model.