SIRUS: Making Random Forests Interpretable

Clément Bénard (1, 2) , Gérard Biau (1) , Sébastien da Veiga (2) , Erwan Scornet (3)

1 LPSM (UMR_8001) - Laboratoire de Probabilités, Statistique et Modélisation
2 Safran Tech
3 CMAP - Centre de Mathématiques Appliquées - Ecole Polytechnique

State-of-the-art learning algorithms, such as random forests or neural networks, are often qualified as "black-boxes" because of the high number and complexity of operations involved in their prediction mechanism. This lack of interpretability is a strong limitation for applications involving critical decisions, typically the analysis of production processes in the manufacturing industry. In such critical contexts, models have to be interpretable, i.e., simple, stable, and predictive. To address this issue, we design SIRUS (Stable and Interpretable RUle Set), a new classification algorithm based on random forests, which takes the form of a short list of rules. While simple models are usually unstable with respect to data perturbation, SIRUS achieves a remarkable stability improvement over cutting-edge methods. Furthermore, SIRUS inherits a predictive accuracy close to random forests, combined with the simplicity of decision trees. These properties are assessed both from a theoretical and empirical point of view, through extensive numerical experiments based on our R/C++ software implementation sirus available from CRAN.

Mots clés: classication; interpretability; random forests; rules; stability

Domaines: Statistiques [math.ST]

Clément Bénard, Gérard Biau, Sébastien da Veiga, Erwan Scornet. SIRUS: Making Random Forests Interpretable. 2019. ⟨hal-02190689v2⟩