DocumentCode :
3713317
Title :
Towards an interpretable Rules Ensemble algorithm for classification in a categorical data space
Author :
Mohamed Azmi;Abdelaziz Berrado
Author_Institution :
Equipe AMIPS, EMI, Mohammed V University, Rabat, Morocco
fYear :
2015
Firstpage :
1
Lastpage :
6
Abstract :
With the rapid growth of big data technology, classification plays an increasingly important role in decision making in many research areas. Several studies have been made in recent years to improve the accuracy-interpretability of classification models. In this paper, we present and discuss different classification methods, Random Forest, Boosting, CBA (Classification Based on Association) and Rulefit. We discuss the advantages and the limitations of each algorithm and finally we introduce a prototype model that combines some advantages that characterize the presented algorithms.
Keywords :
"Decision trees","Association rules","Vegetation","Prediction algorithms","Boosting","Yttrium","Bagging"
Publisher :
ieee
Conference_Titel :
Intelligent Systems: Theories and Applications (SITA), 2015 10th International Conference on
Type :
conf
DOI :
10.1109/SITA.2015.7358390
Filename :
7358390
Link To Document :
بازگشت