An Evolutionary Algorithm for Learning Interpretable Ensembles of Classifiers

Henry E. L. Cagnini, Alex Alves Freitas, Rodrigo C. Barros

Abstract

Ensembles of classifiers are a very popular type of method for performing classification, due to their usually high predictive accuracy. However, ensembles have two drawbacks. First, ensembles are usually considered a ‘black box’, non-interpretable type of classification model, mainly because typically there are a very large number of classifiers in the ensemble (and often each classifier in the ensemble is a black-box classifier by itself). This lack of interpretability is an important limitation in application domains where a model’s predictions should be carefully interpreted by users, like medicine, law, etc. Second, ensemble methods typically involve many hyper-parameters, and it is difficult for users to select the best settings for those hyper-parameters. In this work we propose an Evolutionary Algorithm (an Estimation of Distribution Algorithm) that addresses both these drawbacks. This algorithm optimizes the hyper-parameter settings of a small ensemble of 5 interpretable classifiers, which allows users to interpret each classifier. In our experiments, the ensembles learned by the proposed Evolutionary Algorithm achieved the same level of predictive accuracy as a well-known Random Forest ensemble, but with the benefit of learning interpretable models (unlike Random Forests).
BibTeX
@inproceedings{cagnini2020evolutionary,
  author = {Henry E. L. Cagnini and Alex Alves Freitas and Rodrigo C. Barros},
  title = {{An Evolutionary Algorithm for Learning Interpretable Ensembles of Classifiers}},
  booktitle = {Bracis},
  year = {2020},
  doi = {10.1007/978-3-030-61377-8\_2},
}

Loading related content...

Figure