betaFeedback

WorksMathematics

Interpreting Random Forests: Comparing Surrogate Models and Rule Extraction Methods

Abstract

Random forests (RFs) often achieve high prediction performance, but their ensemble structure can be difficult to interpret. Surrogate models and rule extraction methods offer interpretable approximations, yet guidance on selecting an appropriate method for a specific research question remains limited. We compared 12 methods for interpreting RFs, with a decision tree as a prediction-oriented reference, across 11 simulation settings and 67 benchmark datasets for regression and classification. Evaluation addressed prediction and structural similarity to the RF, model complexity, prediction performance, and runtime. Simulations additionally assessed explainability using known effect and noise variables. No method performed best across all objectives. For regression, SLIM provided the strongest general performance for prediction similarity or performance on test data, while a linear model offered a simpler global interpretation of linear effects when performance was comparable. For classification, inTrees achieved the strongest overall benchmark performance, with CTree and OC-CART providing useful alternatives. ART consistently produced the most compact representations. NH and SIRUS offered strong structural similarity for regression, while MRT most closely reproduced RF variable usage in the classification simulations, illustrating that prediction-oriented rankings do not necessarily identify the best structural explanation. Outcome-type restrictions, runtime limits, and method-specific failures reduced result availability for several approaches and should be considered alongside performance when selecting a method. Method selection should therefore be guided by the outcome type, anticipated data structure, and intended interpretability objective. Prediction similarity alone is insufficient for explaining an RF and should be considered jointly with structural similarity and model complexity.

Introduction

Random forests (RFs) are widely used for prediction on tabular data because they can represent nonlinear effects and complex interactions while requiring few assumptions about the functional relationship between variables and outcome [6, 7]. However, their ensemble structure makes it difficult to understand how predictions arise. This limits their use when the variables and decision structures underlying a prediction are of substantive interest or when the results of the model must be transparently communicated.

Therefore, many methods have been proposed to explain complex prediction models [15, 39]. Surrogate models approximate the predictions of a black-box model with an interpretable model, whereas rule extraction methods derive or build a smaller set of decision rules. Both approaches can provide an interpretable global representation of an RF, but differ in their structural assumptions and optimization targets. Some methods primarily aim to reproduce RF predictions, others preserve variables or decision structures used by the forest, and others prioritize compactness.

This variety makes selecting the most appropriate one challenging in practice. A method that closely reproduces RF predictions may rely on different variables and consequently provide a misleading explanation of the RF decision process. Conversely, a structurally similar representation may have low prediction similarity or be too complex to interpret. Method choice may also be guided by the outcome type, continuous or categorical, and by the form of the prediction function, such as an approximately linear relationship, subgroup effects or interactions, or a more complex nonlinear pattern. For empirical data, this structure is generally unknown.

Existing comparisons of such approaches cover only selected method classes, small numbers of data sets, or a limited range of performance criteria, and therefore provide insufficient guidance for choosing a method for a specific application [1, 19]. Haddouchi and Berrado [16] provided a theoretical taxonomy of RF interpretation methods rather than an empirical comparison. Aria et al. [1] compared the two rule extraction methods inTrees and NodeHarvest across six binary classification data sets and found a small overall prediction performance advantage of inTrees. Herbinger et al. [19] compared four model-based tree methods (SLIM, GUIDE, MOB, and CTree) on three simulated regression scenarios and showed that the preferred surrogate method depends on the balance between prediction similarity and interpretability, with results also affected by hyperparameter choices.

Addressing these limitations requires systematic comparisons across a broad range of practically relevant settings to establish when existing methods perform well. This is the purpose of phase III methodological research in the framework proposed by Heinze et al. [18], to which the present study contributes. This study extends previous contributions by comparing 12 different surrogate models and rule extraction methods for RFs, with a decision tree fitted directly to the observed outcomes included as a prediction-oriented reference model, hereafter referred to as the decision tree. The evaluation combines 11 simulation settings with known linear, nonlinear, subgroup, interaction, and noise structures and 67 heterogeneous benchmark data sets for regression and classification. The methods are assessed jointly with respect to agreement with the RF predictions and the variables used by the RF, model complexity, prediction of the observed outcome, and runtime. In the simulation settings, explainability is evaluated by checking which effect and noise variables are used in the interpretable models.

The aim is to determine which methods should be preferred for different data structures and analytical objectives. By combining controlled simulations with a broad empirical comparison, the study distinguishes findings tied to known mechanisms from patterns that generalize across applications. Hence, it provides practical guidance for selecting an interpretable RF approximation method while explicitly accounting for the trade-off between prediction performance, similarity, and interpretability.

Interpretable methods

Interpretability refers to the extent to which a model and the reasons underlying its predictions can be understood by an intended user [39]. It depends on the purpose of the explanation and may concern either individual predictions or the global prediction function. Common post-hoc approaches such as variable importance measures [7], partial dependence plots [11], individual conditional expectation curves [13], and SHAP values [36] describe selected aspects of a model, but do not provide an interpretable prediction model.

In contrast, this study focuses on approaches that construct such an interpretable model representing either the prediction function or the decision structure of an RF. This model supports both global interpretation, e.g., identifying the variables used, and local interpretation, such as explaining how an individual prediction was obtained. The considered approaches are divided into surrogate models, which fit an interpretable model to approximate the RF, and rule extraction methods, which construct an interpretable rule set from decision structures. The approaches considered here include both methods specifically developed for model interpretation and general prediction methods used as interpretable surrogates. Their interpretability depends not only on compactness but also on whether they reproduce the predictions and relevant decisions of the RF. The following sections describe their underlying principles, structural assumptions, and main limitations. The criteria and procedure used to select the methods included in this study are described in § 4.

Surrogate models

One established strategy for explaining complex machine learning models is the use of interpretable surrogate models [3, 15, 23, 39]. A surrogate model is an interpretable prediction model that approximates a complex machine learning model [39]. If the surrogate achieves high similarity to the black-box model, it can be interpreted in its place, enabling both local explanations of individual predictions and global insights into the variables and structures underlying the prediction process [15, 24, 39, 41].

Surrogate modeling is generally model-agnostic and can therefore be applied to different types of black-box models [15, 39]. However, some approaches are designed for specific model classes [3] (Laabs, Kronziel, et al. 2024) or restricted to particular outcome types, such as regression or classification.

In this work, we focus on RFs as the underlying black-box model because of their strong prediction performance on tabular data [14]. We thus primarily consider tree-based surrogate approaches, whose hierarchical decision structure is intuitive to interpret and structurally similar to that of an RF [37]. As a complementary comparison, we additionally consider a linear regression model as a common surrogate model [39], which is likewise interpretable but relies on a fundamentally different model structure and set of assumptions.

The surrogate approaches considered in this study are grouped into two categories: oracle coaching and representative trees. Oracle coaching fits an interpretable model to the RF predictions, whereas representative tree approaches either select an existing tree from the RF (MRT) or construct a new tree to represent the RF (ART).

Oracle Coaching

Oracle coaching represents a naive approach to surrogate modeling. It trains an interpretable model on the predictions of an accurate black-box model, referred to as the oracle, instead of on the true observed outcomes [24, 23]. As any model can be used to serve as an oracle, this method is model agnostic. The resulting model aims to reproduce the oracle’s decision function by generating similar predictions while retaining the transparent structure of the chosen model. Similarity is therefore established only at the prediction level. High prediction similarity does not imply that the surrogate and the oracle rely on similar decision structures.

Training decision trees and linear models on black-box predictions is an established approach to construct interpretable surrogates [23, 39]. Following the same principle, GUIDE, MOB, SLIM, and CTree have also been investigated as surrogate models [19]. The methods described below were applied using the oracle coaching principle.

Linear Model (LM) A linear regression model was used as the interpretable model as proposed by Molnar (2022). It approximates the RF predictions through an additive linear combination of the variables and was used only for regression tasks in this study. The number of variables can be reduced through forward selection, which starts with an intercept-only model and sequentially adds the variable that most improves a chosen model selection criterion until no further improvement is achieved. A limitation of this application is that it captures only linear main effects and cannot represent nonlinear effects or interactions unless corresponding terms are explicitly included.

The remaining models used for oracle coaching are tree-based. They recursively partition the variable space but differ in the models fitted within their nodes, the criteria for selecting splitting variables and split points, and the rules for stopping tree growth or pruning.

Classification and regression tree (OC-CART) A single decision tree was used as the interpretable model and trained on the RF predictions [24, 23]. This surrogate is referred to as OC-CART. The tree was built using the classification and regression tree (CART) algorithm, which recursively partitions the variable space through binary splits and assigns a constant prediction to each terminal node [6]. CART jointly selects the splitting variable and split point by searching for the greatest reduction in node impurity, measured, for example, by the Gini index for classification or the variance of the response for regression. The reduction is calculated as the impurity of the parent node minus the weighted average impurity of the two child nodes, with weights corresponding to their proportions of observations. Because variables with more possible split points offer more opportunities to achieve a large impurity reduction, this selection procedure can favor such variables [35]. Splitting continues until no further admissible split is available, for example, because a split would leave fewer than the required minimum number of training observations in a child node or because the node is pure, meaning that all observations have the same class in classification or the same response value in regression. For prediction, an observation follows the splits from the root to a terminal node, which assigns a constant value for regression or a class label for classification. Although the classical CART algorithm uses pruning, which removes splits from an initially grown tree, to determine the final tree size, the models in this study were fitted without pruning for comparable model complexity.

Generalized, Unbiased Interaction Detection and Estimation (GUIDE) GUIDE approximates the RF predictions with a tree that is constructed differently from conventional trees such as CART [34]. Originally developed as a regular prediction model, GUIDE has also been used as an interpretable surrogate fitted to model predictions [19], an approach adopted here using RF predictions as the response. In the implementation used here, GUIDE fits linear main effects models within the nodes, so that each terminal node provides a local linear approximation of the RF predictions. At each node, the split variable and the split point are determined in two separate steps to reduce the selection bias of conventional tree algorithms. First, statistical tests assess the association between the signs of the residuals of the fitted node model and each candidate variable, with additional tests for pairwise interactions. Numerical splitting variables are grouped into categories for these tests. GUIDE thus identifies variables associated with systematic overprediction or underprediction by the current node model. The split variable is then selected based on the minimal p value. After selecting the variable, GUIDE evaluates potential split points by fitting models in the two resulting child nodes and selects the split point that minimizes their combined residual sum of squares. Splitting stops when the improvement in model fit falls below the threshold defined by the improvement criterion or when further splitting would violate growth constraints, such as minimum node-size requirements. For prediction, an observation follows the splits from the root to a terminal node, where the corresponding linear main effects model generates its prediction using the observation’s variable values. Evaluating many potential split points can be computationally demanding. Moreover, accurately approximating the RF predictions may require many splits, making the resulting tree difficult to interpret. Although GUIDE supports both regression and classification in general, the R implementation used in this study is restricted to regression.

Surrogate Locally-Interpretable Models (SLIM). SLIM approximates the RF predictions by combining a tree with interpretable main effects models within its nodes (Hu et al., 2020). SLIM was specifically developed as an interpretable surrogate model fitted to the predictions of a complex machine learning model (Hu et al., 2020). In this study, RF predictions serve as the response as in Herbinger et al. [19]. Similar to CART, the tree partitions the variable space through binary splits. SLIM jointly selects the splitting variable and split point. Candidate splits are evaluated by fitting a separate main effects model in each of the two subgroups resulting from a candidate split. The residual sums of squares of both models are added, and the variable and split point with the smallest combined value are selected. Splitting stops when the reduction in the residual sum of squares achieved by the best candidate split falls below a specified threshold. Tree growth can also be restricted by a maximum tree depth, a maximum number of splits, or a minimum number of observations required in each terminal node. For prediction, an observation follows the splits from the root to a terminal node, where the corresponding main effects model generates its prediction using the observation’s variable values. SLIM may therefore require fewer splits than OC-CART to approximate a complex prediction function or to display a linear relationship. However, it assumes that the RF predictions can be represented adequately by a main effects model within each subgroup. Strong local interactions or irregular effects may reduce prediction similarity or require a large tree. Evaluating models for many candidate splits can also result in a high runtime [19].

Model-Based Recursive Partitioning (MOB). MOB combines recursive partitioning with parametric statistical models [44]. MOB was originally developed to model observed outcomes but has also been used as a surrogate model [19]. In this study, it is used as a surrogate model and is fitted to RF predictions. Each node contained an intercept-only model, which estimates a single constant rather than regression coefficients for the variables. First, MOB estimates the constant as the mean RF prediction among all training observations in the current node and calculates their deviations from this mean. All available variables were considered as candidate splitting variables. It then tests whether the common mean is appropriate across the values of each candidate splitting variable. These parameter instability tests use model scores, which are proportional to the deviations from the node mean in this configuration. For numerical variables, observations are ordered by their values, and cumulative scores are examined for systematic patterns. For categorical variables, scores are aggregated within categories, and a chi-squared test assesses whether they differ systematically between categories. If no significant instability remains after Bonferroni correction across the candidate splitting variables, the node is not split. Otherwise, MOB selects the variable with the smallest p value. For the selected variable, MOB then compares binary splits that satisfy the specified constraints, such as the minimum number of observations required in each child node. Each candidate split yields two child-node means. The split that minimizes the combined sum of squared deviations from these means is selected. The procedure is repeated within each child node until no significant instability is detected or further splitting would violate growth constraints, such as minimum node-size requirements. For prediction, an observation follows the splits from the root to a terminal node and receives the mean RF prediction of the training observations within that node. As in OC-CART, predictions are therefore constant within each terminal node, which may require many splits to approximate complex RF prediction functions.

Conditional Inference Tree (CTree) CTree constructs a decision tree using statistical hypothesis tests for recursive partitioning (Hothorn et al., [20]). In this study, CTree was used as a surrogate model by fitting it to RF predictions rather than the observed outcomes it was originally designed to predict. It partitions the variable space through binary splits and assigns a constant prediction to each terminal node. At each node, CTree tests the independence of the RF predictions and each candidate splitting variable using conditional inference tests. In the implementation used here, quadratic test statistics are evaluated using their asymptotic null distributions, and p values are adjusted across candidate variables using Bonferroni correction. If no significant association remains, the node is not split. Otherwise, the variable with the smallest p value is selected. For the selected variable, CTree then compares binary splits that satisfy the specified constraints, such as minimum child-node sizes. The procedure is repeated within each child node until no significant association is detected or further splitting would violate growth constraints. For prediction, an observation follows the splits from the root to a terminal node. For regression, it receives the mean RF prediction of the training observations within that node. For classification, it receives the most frequent RF-predicted class within that node. Separating variable selection from split-point selection reduces the preference of CART for variables with many possible split points. However, constant predictions within terminal nodes may require many splits to approximate complex RF prediction functions.

Representative Trees

Most Representative Tree (MRT) The MRT approach was developed to provide an interpretable representation of a tree ensemble by selecting one of its existing trees as a surrogate (Banerjee et al., [3]). For each tree of the RF, the pairwise distance to all other trees is calculated and the tree with the smallest mean distance is selected as the MRT. This distance can be based on structural features such as split variables and their positions (Banerjee et al., [3]; Laabs, Westenberger, & König, [29]) or on another tree distance measure. Because MRT selects an existing tree, it retains that tree’s splits and terminal-node predictions. No additional split selection or stopping rule is required. For prediction, an observation follows the selected tree’s splits from the root to a terminal node and receives its prediction. The selected tree provides a direct but highly compressed view of the RF. However, it may be deep and difficult to interpret because trees in an RF are commonly grown with few restrictions. Splits based on noise variables may also occur at any tree depth and lead to misleading interpretations.

Artificial Representative Tree (ART) ART was developed as an interpretable surrogate for RFs, extending the MRT approach by constructing a new representative tree through minimization of a tree-based distance measure rather than selecting an existing tree (Laabs, Kronziel, et al., [28]). Starting at the root, the algorithm evaluates candidate splitting variables and split points by calculating the distance between each resulting candidate tree and the RF. It selects the split that yields the smallest distance. As in the MRT method, the distance can be based on the split variables used, for example. Tree growth stops when further splitting increases the distance or leaves it unchanged without a sufficient improvement in prediction performance. Growth can also be restricted by requiring a minimum number of training observations in each terminal node. For prediction, an observation follows the splits from the root to a terminal node. The node predicts the mean observed outcome for regression or the most frequent observed class for classification among its training observations. The construction is designed to achieve structural similarity and does not directly optimize prediction similarity. In addition, the algorithm evaluates one split at a time rather than combinations of several splits and may consequently fail to identify the globally optimal tree.

Rule extraction

Rule-based models are supervised machine learning methods that generate predictions based on individual rules or sets of rules [4, 12]. A rule combines several conditions, such as if age>65age > 65 and weight>50weight > 50, and assigns a prediction to observations satisfying them. Predictions are typically derived from the training observations satisfying these conditions, such as the majority class in classification or the mean outcome in regression, analogous to terminal nodes in CART. Multiple rules can be combined to form a complete prediction model [4, 12]. Such approaches can serve as stand-alone prediction models or be used to explain complex machine learning models through rule extraction [15, 39]. In contrast to surrogate modeling, which approximates a black-box model with an interpretable prediction model, rule extraction represents its decision logic through explicit, human-readable rules [15].

Rule extraction is particularly suitable for RFs because each path from the root node to a terminal node in an individual tree represents a decision rule [7, 12]. Individual rules may be easy to understand, but their aggregation across many trees makes the overall RF difficult to interpret. Rule extraction methods therefore aim to identify, generate, or select a smaller set of representative rules that capture important decision mechanisms of the RF while remaining interpretable [4]. In this work, we focus exclusively on rule extraction methods applicable to RFs that yield interpretable prediction models. We distinguish methods that extract rules directly from the RF trees from those that learn rules by fitting models to RF predictions.

Rules extracted from RF trees

Interpretable Trees (inTrees) inTrees was developed to interpret tree ensembles by extracting, simplifying, and selecting decision rules [8]. It extracts candidate rules from paths in the trees of a fitted RF. Each rule consists of conditions on variable values and applies to observations that satisfy all of these conditions. The rules are evaluated according to their prediction error, coverage, and length. Coverage is the proportion of training observations satisfying a rule, and length is the number of conditions it contains. Rule predictions and errors are calculated using the observed outcomes. inTrees removes redundant conditions and constructs an ordered rule list by iteratively selecting rules with low prediction error, favoring rules that cover a larger proportion of observations and have fewer conditions in case of ties, and re-evaluating the remaining rules on observations not yet covered. For prediction, its rules are evaluated in sequence, and the first rule satisfied by an observation determines its prediction. A default prediction is assigned if none of the selected rules applies. Although individual rules may be easy to interpret, long rules or a large rule list can make the complete model difficult to understand. Moreover, extracting rules from the RF does not guarantee that the resulting model reproduces its predictions.

Rules learned from RF predictions

Stable and Interpretable Rule Set (SIRUS) SIRUS was originally proposed as an interpretable prediction method based on RFs [4]. In this study, it is used as a surrogate by fitting it to RF predictions rather than observed outcomes. SIRUS constructs its own forest using the original variables and the predictions of the RF to be explained as training responses. It therefore learns new trees rather than extracting rules from the original RF. Numerical split points in this new forest are restricted to empirical quantiles to increase the recurrence of the same decision paths across trees. Rules are extracted from paths leading to both intermediate splitting nodes and terminal nodes. Rules whose frequency across the trees exceeds a specified threshold are retained, and redundant rules that can be expressed as linear combinations of more frequent rules are removed. The frequency threshold controls the size of the rule set. Each rule divides the training observations into those that satisfy its conditions and those that do not. Each rule returns the mean prediction among training observations that satisfy the conditions if they are met. Otherwise, it returns the mean prediction among training observations that do not satisfy them. The final SIRUS prediction is obtained by multiplying each rule’s output by its weight, summing these weighted outputs across all selected rules, and adding an intercept. For regression, the weights are estimated jointly by ridge regression with non-negative coefficients. The focus on stable and recurring rules can improve reproducibility but may omit less frequent structures that contribute to the predictions.

Node Harvest (NH) NH was originally proposed as an interpretable prediction method based on a collection of potentially overlapping nodes [37]. In this study, it was used as an RF surrogate by training its own trees and estimating node predictions and weights using RF predictions rather than observed outcomes. NH first grows its own RF using the original variables and the predictions of the RF to be explained as training responses. Candidate rules are derived from both internal and terminal nodes of this newly fitted forest. Each rule consists of the conditions along the path from the root to the corresponding node. Its prediction is the mean prediction among the training observations satisfying all of its conditions. The number and complexity of candidate rules can be restricted, for example, by specifying the size of the initial rule collection, a minimum number of observations satisfying each rule, or a maximum number of conditions per rule. The final predictions are weighted averages of the node means across all selected nodes covering an observation. The node weights are estimated by solving a quadratic optimization problem that minimizes squared prediction error, subject to nonnegative weights and the constraint that the weights of nodes covering each training observation sum to one. Only rules with positive weights contribute to the final prediction model. For a new observation, NH identifies all selected rules whose conditions are satisfied. It multiplies their predictions by their respective weights, adds these contributions, and divides by the sum of the weights of the matching rules. The selected rules can overlap and do not form a single hierarchical partition. This allows flexible representations, but a large collection of overlapping rules may make the complete model difficult to interpret.

RuleFit RuleFit combines decision rules with linear variable effects to construct an interpretable prediction model [12]. In this study, it was used as a surrogate by fitting it to RF predictions rather than observed outcomes. The implementation used here first grows its own collection of conditional inference trees using the original variables and the predictions of the RF to be explained as training responses. Candidate rules are extracted from paths leading to internal and terminal nodes of these newly fitted trees. Each rule is represented by a binary indicator that equals one when an observation satisfies all its conditions and zero otherwise. A regression model is then fitted using these binary variables together with linear terms for the original variables. For regression tasks, this is a linear regression model. For classification, it is a logistic or multinomial regression model. The coefficients are estimated jointly using the least absolute shrinkage and selection operator (LASSO) [42]. The penalty shrinks coefficients towards zero and sets some to zero. The final model therefore consists of an intercept, the retained linear terms, and the retained rule indicators with their estimated coefficients, which can be positive or negative. Model complexity can be controlled through the number and depth of the trees used to generate candidate rules and through the strength of the regularization penalty. For prediction, the retained rule indicators are evaluated for a new observation. For regression, their weighted contributions and those of the retained linear terms are added to the intercept. For classification, the resulting linear predictors are transformed into class probabilities. Although the final model is linear in its coefficients, the rule indicators allow it to represent nonlinear relationships and interactions between the original variables. A large number of retained terms or strongly overlapping rules can nevertheless make the complete model difficult to interpret.

Similarities and differences between interpretation methods

The methods considered here provide interpretable representations of an RF but differ in the information they use and the models they produce. An overview is provided in Table A.1.

RF access and training targets Oracle coaching approaches learn from RF predictions without requiring access to the forest’s internal structure. The surrogate model approaches LM, OC-CART, GUIDE, SLIM, MOB, and CTree use this approach in this study. SIRUS, NH, and RuleFit follow the same principle here, although their final models are rule-based. These methods therefore focus on achieving high prediction similarity without considering structural similarity.

MRT, ART, and inTrees instead use parts of the original splits from the fitted forest itself. MRT selects an existing tree, ART constructs a representative tree using distances to the RF, and inTrees extracts rules from its decision paths. Accessing the RF structure does not necessarily mean that RF predictions are used as the training response.

Original purpose The methods differ in their original purpose. SLIM, MRT, ART, and inTrees were developed to provide interpretable representations of existing prediction models or tree ensembles [3, 8] (Hu et al. 2020; Laabs, Kronziel, et al. 2024).

Linear regression, CART, GUIDE, MOB, and CTree were originally developed to model observed outcomes rather than explain another fitted model. SIRUS, NH, and RuleFit were also proposed as prediction methods, but explicitly aimed to combine prediction performance with interpretability [4, 12, 37]. In this study, these prediction methods serve as RF surrogates by using RF predictions as their training responses.

Model structure and prediction The resulting models range from a global linear model to individual trees, trees with local models, and collections of rules. LM predicts through an intercept and the sum of variable values multiplied by their regression coefficients.

OC-CART, CTree, MOB, MRT, and ART provide decision trees with constant predictions within each terminal node. GUIDE and SLIM instead evaluate a local regression model in the terminal node reached by an observation, using its variable values and the locally estimated intercept and coefficients.

inTrees uses the prediction of the first matching rule, with a default prediction if none matches. SIRUS multiplies each selected rule’s output, including its else value when the conditions are not satisfied, by its estimated non-negative weight and adds these contributions to an intercept. NH computes a weighted average of the predictions of matching rules, dividing their weighted sum by the total weight of those rules.

RuleFit adds the coefficients of satisfied rule indicators and the contributions of retained linear predictor terms to an intercept. For classification, its linear variables are transformed into class probabilities.

Tree growth and rule construction The tree-building algorithms differ in how they select splitting variables and split points. OC-CART and SLIM jointly search for the combination that most improves model fit.

GUIDE, MOB, and CTree first select a variable through statistical testing and then determine its split point. Their tests use different information: GUIDE examines residual signs, MOB assesses parameter instability using model scores, and CTree tests associations between the response and candidate splitting variables. After variable selection, GUIDE and MOB minimize the combined residual sum of squares of the child-node models, whereas CTree maximizes a standardized separation statistic.

Representative-tree approaches use a different objective: MRT selects a tree according to its average distance to the other RF trees, and ART evaluates candidate splits according to the distance between the resulting tree and the RF.

inTrees extracts rules from the original RF and selects them based on prediction error, coverage, and length. SIRUS, NH, and RuleFit generate rules from newly fitted trees. SIRUS selects frequently recurring rules, NH selects rules through non-negative weight optimization, and RuleFit uses LASSO to select rules and linear terms.

Complexity control Model complexity is controlled at different stages. Tree growth can be restricted by minimum node sizes, maximum depth, a maximum number of splits, or a required improvement in the objective. MOB and CTree additionally use significance-based stopping.

As MRT inherits the complexity of the selected RF tree, it is not possible to control its complexity directly without modifying the algorithm or the underlying RF itself.

For rule-based models, complexity can be reduced by removing conditions, filtering redundant rules, applying frequency thresholds, or estimating sparse rule coefficients or weights. SIRUS primarily selects rules through their occurrence frequency, while RuleFit uses LASSO regularization and NH retains rules with positive optimization weights. The common complexity restrictions imposed in this study are additional implementation choices rather than inherent properties of all methods.

Related work

Haddouchi and Berrado [16] provided a broad overview and taxonomy of methods for interpreting RFs, including surrogate models and rule extraction methods. They organized existing approaches along several dimensions of interpretability and thereby offered conceptual guidance for selecting tools according to the aspect of an RF that should be explained. However, their work was a theoretical review rather than an empirical comparison and therefore did not establish how the methods perform across different data structures or objectives.

Aria et al. [1] combined a theoretical overview of methods for interpreting tree ensembles with an empirical comparison of inTrees and NH, which they characterized as the two main approaches to rule extraction. Their evaluation was based on six benchmark data sets for binary classification from the University of California, Irvine (UCI) Machine Learning Repository (https://archive.ics.uci.edu/). Performance was assessed using the confusion matrix to calculate accuracy, precision, sensitivity, specificity, the geometric mean, F1 score, Youden’s index, balanced accuracy, and Cohen’s kappa. A selection of these measures is also used in the present evaluation. These measures characterize prediction performance, but do not evaluate model complexity, interpretability, or similarity to the original RF. Although the two methods yielded similar results, inTrees showed a small overall performance advantage and was therefore recommended by the authors.

Herbinger et al. [19] investigated surrogate modeling more directly by comparing SLIM, GUIDE, MOB, and CTree. As part of their work, they provided R implementations of SLIM and GUIDE. The four methods were evaluated in a simulation study modeling main effects. This included three scenarios with smooth linear, categorical linear, and mixed linear effects. The evaluation considered prediction similarity to the underlying model, measured by the coefficient of determination R2R^2, interpretability, represented by the number of terminal nodes, and stability, quantified by the Rand index. A selection of these measures is also used in the present evaluation. Their results showed that hyperparameter choices substantially influenced the performance for SLIM and GUIDE, while MOB and CTree were less sensitive to the evaluated settings. All four approaches could contribute to model interpretation, while the preferred method depended on the desired balance between similarity and interpretability.

In summary, the existing studies either provide a broad theoretical taxonomy, compare a limited set of rule extraction methods using prediction performance measures, or focus on a specific class of surrogate models in controlled simulation settings. To the best of our knowledge, no previous study has conducted a comprehensive empirical comparison of both surrogate modeling and rule extraction methods across multiple data sets while jointly considering prediction performance, similarity, interpretability, complexity, and stability. The present study is designed to address this gap.

Comparison study design

The methods for the comparison study were selected from the three studies discussed above. We initially considered all methods mentioned by Aria et al. [1], Haddouchi and Berrado [16], or Herbinger et al. [19], as well as subsequent extensions of these methods identified through literature search. This initial set was then restricted according to the selection process shown in Figure 1. To be eligible, a method had to produce an independent prediction model and had to be applicable to RFs, either as a model agnostic approach or as a method developed specifically for RFs. Since the comparison was conducted in R, an existing R implementation was also required. Furthermore, the RFs in this study were fitted using the R package ranger, providing a computationally efficient implementation (Wright & Ziegler, [43]). Therefore, only methods that supported ranger objects directly or could be applied after converting the fitted model were included. In addition to the selected interpretation methods, a decision tree based on the CART algorithm by Breiman et al. [6] was included as a reference model. Its structural similarity to the interpretable models considered in this study makes it a useful baseline, particularly for assessing prediction performance. An overview of all included methods, their abbreviations, implementations (including the software version), and their applicability to regression and classification tasks is provided in Table A.2.

Figure 1. A flowchart showing the selection of methods for the comparison study. Starting with 66 methods from publications + 5 additional methods. 13 methods included in analysis. Excluded methods (n=56n = 56): 34 non-prediction methods; 22 methods not implemented in RR.

The data sets were selected with the aim of ensuring a fair and representative comparison. For each included method, we reviewed the data-generating processes and empirical data sets used in its original publication. Where feasible, simulation scenarios were reconstructed, and publicly available benchmark data sets were included. Some data sets were identified in more than one publication. Data sets were excluded if they were not publicly available or could not be identified reliably from the description in the corresponding publication. We also excluded data sets intended for outcomes other than regression or classification. Further exclusions concerned data sets that consisted almost entirely of missing values when the original publication did not provide sufficient information about their handling, as well as data sets for which the most frequent outcome category accounted for no more than 20% of the observations. The complete data set selection process is summarized in Figure 2. The final analysis included 78 Starting with 66 methods from publications + 5 additional methods

Figure 2. A flowchart showing the selection of data sets for the comparison study. Starting with 131 data sets. 90 after duplicates have been merged. 78 data sets included in analysis. Excluded data sets (n=12n = 12): 3 non-publicly available data sets; 3 data sets consisting almost entirely of missing values; 2 data sets with survival outcomes; 1 data set that could not be found; 1 data set without usable file format; 1 data set with ≤20%\leq20\% frequency of largest outcome class; 1 data set with at least 50% missing values outcome.

13 methods included in analysis

Excluded methods (n=56n = 56) – 34 non-prediction methods – 22 methods not implemented in RR

Starting with 131 data sets

90 after duplicates have been merged

78 data sets included in analysis

Excluded data sets (n=12n = 12) – 3 non-publicly available data sets – 3 data sets consisting almost entirely of missing values – 2 data sets with survival outcomes – 1 data set that could not be found – 1 data set without usable file format – 1 data set with ≤20%\leq20\% frequency of largest outcome class – 1 data set with at least 50% missing values outcome

data sets, comprising 42 classification data sets and 36 regression data sets (see Table A.3). After preprocessing, sample sizes ranged from 55 to 577,601 observations and from 2 to 440 variables. The comparison study was implemented in RR, using version 4.3.0.

Comparison using simulated data

Aim

The simulation study was designed to provide a controlled comparison of surrogate model and rule extraction methods under data-generating mechanisms originally used to introduce or evaluate the respective methods. The major advantage of simulated data is that they provide comprehensive knowledge of the characteristics of the variables and their functional relationship with the outcome. This enables us to evaluate not only the prediction performance, but also the accuracy with which each method recovers the known signal structure.

Data simulation

We implemented eleven simulation settings, comprising three classification and eight regression settings. The data-generating mechanisms were based on simulation designs reported in the original publications of ART, the CART algorithm, inTrees, NH, and RuleFit ([6, 8, 12, 37] (Laabs, Kronziel, et al. 2024)). All simulated data sets could therefore be generated anew in each repetition. Two additional synthetic data sets originating from the waveform simulation described by Breiman et al. [6] were included as fixed benchmark data sets rather than regenerated in each repetition. Waveform version 1, also used by Johansson et al. [24] and Deng [8], was obtained from UCI, whereas version 2 was obtained from OpenML. See Table A.3 for details regarding the data sets.

Simulation Digit recognition / Digit recognition noisy

The digit-recognition simulation was a multiclass classification problem in which the outcome classes corresponded to the digits 0–9 (Breiman et al., [6]). Each digit was represented by seven binary variables encoding its correct seven-segment display pattern. Variables were drawn from patterns, which were inverted with a probability of 10% in order to add noise to the data. We considered one scenario without additional noise variables and one scenario with 17 additional independently Bernoulli-distributed noise variables (called digit recognition noisy), resulting in p=7p = 7 and p=24p = 24, respectively. Each scenario comprised 200 training and 5000 test observations.

Simulation XOR-problem

The XOR-problem was a binary classification problem (Deng, [8]). For each observation, exactly 10 of the p=20p = 20 categorical variables were randomly assigned the value 1, while the remaining variables took the value 0. The outcome was determined by an exclusive-or rule. Consequently, X3,…,X20X_{3}, \ldots, X_{20} had no direct effect on the outcome. No data split into training and test sets was specified in (Deng, [8]). Therefore, we used 100 observations for training as in (Deng, [8]) and added 100 observations for testing.

Simulation few large effects

This simulation represented an additive regression problem with a small number of large effects (Laabs, Kronziel, et al., 2024). All p=100p = 100 variables were independent binary variables. The continuous outcome was based on additive effects of five variables, each with an effect size β=2\beta= 2, and additional standard normally distributed noise. The remaining variables were noise variables. The training and test samples each contained 1000 observations (n=2000n = 2000 in total).

Simulation many small effects

This simulation represented an additive regression problem with many small effects (Laabs, Kronziel, et al., 2024). All p=100p = 100 variables were independent binary variables. The continuous outcome was based on additive effects of the first 50 variables, each with an effect size β=0.2\beta= 0.2, and additional standard normally distributed noise. The remaining 50 variables were noise variables. The training and test samples each comprised 1,000 observations (n=2000n = 2000 in total).

Simulation correlated variables

This simulation examined additive effects in the presence of correlated variables (Laabs, Kronziel, et al., 2024). Ten independent binary variables were generated alongside five blocks of five correlated binary variables. Within each block, each pairwise correlation was set to 0.3. The continuous outcome was based on additive effects of five of the ten independent signal variables and the first variable in each of the five correlation blocks, resulting in ten influential variables with an effect size β=2\beta= 2, plus standard normally distributed noise. Independent binary noise variables were added to obtain p=100p = 100. The training and test samples each comprised 1000 observations (n=2000n = 2000 in total).

Simulation interaction effects

In this simulation, additive and interaction effects for a continuous regression outcome were both used to simulate the outcome (Laabs, Kronziel, et al., 2024). All p=100p = 100 variables were independent binary variables. The outcome was based on additive effects of the first five variables and five pairwise interactions involving the next ten variables. All effects had size β=2\beta= 2, and standard normally distributed noise was added. The training and test samples each comprised 1000 observations (n=2000n = 2000 in total).

Simulation continuous variables

The last simulation used to introduce ARTs investigated additive effects of binary and continuous variables (Laabs, Kronziel, et al., 2024). Of the p=100p = 100 variables, 95 were independent binary variables, and five were independent standard normally distributed variables. The continuous outcome was based on additive effects of five binary and five continuous variables, each with an effect size β=2\beta= 2, and additional standard normally distributed noise. The other 90 variables were noise variables. The training and test samples each comprised 1000 observations (n=2000n = 2000 in total).

Simulation regression subgroups

This setting was a regression problem with two subgroups [6]. The first variable was sampled from the set {−1,1}\{-1,1\} and determined the relevant subgroup, while the other nine variables were sampled from {−1,0,1}\{-1,0,1\}. If X1=1X_1 = 1, the continuous outcome was based on the additive effects of X2X_2, X3X_3, and X4X_4; if X1=−1X_1 = -1, however, it was based on the additive effects of X5X_5, X6X_6, and X7X_7 instead. Normally distributed noise was added, and X8X_8, X9X_9, and X10X_{10} were noise variables. In total, n=200n = 200 observations with p=10p = 10 variables were generated for training and 200 additional observations for testing.

Simulation regression nonlinear effects

This simulation was a nonlinear regression problem [37]. The two independent variables were sampled from X1,X2∼U(0,1)X_1, X_2 \sim U(0,1), and the continuous outcome was generated according to Y=sin⁡(2πX1)sin⁡(2πX2)+εY = \sin(2\pi X_1)\sin(2\pi X_2) + \varepsilon. This nonadditive response surface induced an interaction between the two variables. The error term followed ε∼N(0,0.25)\varepsilon\sim N(0, 0.25). A total of p=2p = 2 variables were generated, without any additional noise variables. No data split into training and test sets was specified in [37]. Therefore, we used 1000 observations for training as in [37] and added 1000 observations for testing.

Simulation regression exponential effects

This setting involved nonlinear regression using exponential distributions [12]. Here, p=100p = 100 independent variables were generated, each sampled uniformly from {0,0.1,…,0.9}\{0, 0.1, \ldots, 0.9\}. The continuous outcome was given by Y=F∗(X)+εY = F^*(X) + \varepsilon, where F∗F^* depended on X1,…,X8X_1, \ldots, X_8 through exponential effects, interactions, a squared sine term, and a linear contrast. The remaining 92 variables, X9,…,X100X_9, \ldots, X_{100}, were independent noise variables with no effect on the outcome. A total of 5000 training and 50000 test observations were generated.

Target

The target was to obtain an interpretable prediction model that approximates the RF. Its predictions on independent test data were evaluated for agreement with the RF predictions and accuracy with respect to the observed outcomes.

Methods

Despite the structural differences between the methods, model complexity was constrained to a similar extent wherever possible to enable meaningful comparison. For tree-based methods, growth was generally restricted by requiring each terminal node to contain at least 10% of the training observations. The name and precise interpretation of this hyperparameter differ across implementations. Since no equivalent hyperparameter was available for inTrees and RuleFit, we subsequently limited the total number of rule conditions and, for RuleFit, active linear terms to approximately match the maximum number of splits allowed by the minimum leaf-size constraint.

Hyperparameters were set according to recommendations in the original publications or, where no recommendation was available, to their software defaults. The implementations, software versions or access dates, and supported outcome types (based on the used implementation) for all applied methods are summarized in Table A.2.

The RF was fitted to the training data using version 0.17.0 of the R package ranger [43], with the default of 500 trees and mtry⁡=p\operatorname{mtry} = \sqrt{p}, where pp denotes the number of variables. The minimum node size was set to 10% of the number of training observations.

ART

ARTs were fitted using version 3.3.2 of the R package timbR from GitHub https://github.com/imbs-hl/timbR (Laabs, Kronziel, et al., 2024). We used the variable-selection algorithm Boruta [27], controlled by imp.num.var, which was proposed as a future improvement in the original publication and has since been implemented. Candidate split points were defined using quantiles through probs_quantiles, as recommended for the benchmark analyses in the original publication to reduce computation time. Tree growth was restricted by setting min.bucket such that each terminal node contained at least 10% of the training observations. All remaining hyperparameters were left at their default values.

CTree

CTree was fitted using version 1.2-26 of the R package partykit [21]. The RF predictions were used as the outcome for CTree. All available variables were included as candidate variables. The minbucket parameter required each terminal node to contain at least 10% of the training observations. All remaining hyperparameters were left at their default values.

GUIDE

GUIDE was fitted using the R implementation provided by Herbinger et al. [19] in the GitHub repository https://github.com/slds-lmu/mbt_comparison. The RF predictions served as the outcome of the surrogate model. Since this implementation supports regression only, GUIDE was not applied to the classification data sets. We selected the GUIDE method by setting split.method to guide. Tree growth was controlled by requiring at least 10% of the training observations in each terminal node through min.split. The parameter n.split limited the number of tree-growth levels. The default improvement criterion was retained, with impr.par set to 0.1 and pruning set to forward.

inTrees

inTrees was fitted using version 1.4 of the R package inTrees [8]. The package was obtained from the CRAN archive because it was removed from CRAN on January 12, 2026, after package check issues remained unresolved. Its original implementation supports forests fitted with the randomForest package [32], but not with the ranger package [43]. We therefore adapted the code provided in Issues 3, 15, and 16 of the inTrees GitHub repository at https://github.com/softwaredeng/inTrees to extract rules from the fitted ranger forests. Since no hyperparameter corresponds to the common leaf-size constraint, we applied the decision budget after rule extraction and pruning. For classification, rules were selected using the original inTrees procedure. For regression, rules were ordered by training error, coverage, and rule length. Rules were retained in this order until adding another rule would exceed the budget, with each rule condition counting as one decision. All other hyperparameters were left at their default values.

MOB

MOB was fitted using version 1.2-26 of the R package partykit [21]. The RF predictions were specified as the outcome. All available variables were included in the model formula. Since the implementation supports regression only, MOB was not applied to classification data sets. The minbucket parameter required each terminal node to contain at least 10% of the training observations. All remaining hyperparameters were left at their default values.

MRT

MRT was fitted using version 3.3.2 of the R package timbR from GitHub https://github.com/imbs-hl/timbR (Laabs, Kronziel, et al., 2024). The only hyperparameter of this method, metric, was set to weighted splitting variables, following the recommendations in Laabs, Westenberger, and König [29]. This metric quantifies pairwise tree distances based on the selected split variables and their positions within each tree. A separate constraint on model complexity could not be imposed because MRT selects an existing tree from the RF without pruning it.

NH

NH was fitted using version 0.7-3 of the R package nodeHarvest [38]. The package was obtained from the CRAN archive because it was removed from CRAN on June 20, 2022, after package check issues remained unresolved. The RF predictions served as the outcome of the surrogate model. Since the available implementation supports regression only, NH was not applied to classification data sets. Model complexity was constrained through nodesize, which required every node to contain at least 10% of the training observations. However, because NH combines potentially overlapping nodes, this constraint does not impose the same upper bound on the total number of decisions as the leaf-size constraint for a single binary tree. All remaining hyperparameters were left at their default values.

OC-CART

OC-CART used a simple model as a surrogate model with the RF predictions as its outcome. Following the decision-tree approach of Johansson et al. [24], we fitted a single tree using version 0.17.0 of the R package ranger [43]. For this, we set num.trees to 1, sample.fraction to 1, and replace to FALSE, thereby fitting the tree to the complete training sample without bootstrap resampling. The mtry parameter was set to the total number of variables so that every variable was considered at each split. Tree growth was restricted through min.bucket, requiring each terminal node to contain at least 10% of the training observations. All remaining hyperparameters were left at their default values.

RuleFit

RuleFit was fitted using version 1.0.8 of the R package pre [10], with the RF predictions serving as the outcome. The current implementation cannot extract rules from an existing RF and constructs a separate RF using conditional inference trees. This RF comprised a default of 500 trees, as specified by ntrees. No hyperparameter in pre corresponds to the common leaf-size constraint. Instead, we constrained the final model by selecting the least penalized model along the existing LASSO regularisation path whose total number of active decisions did not exceed ⌊n/⌊0.1n⌋⌋−1\lfloor n/\lfloor0.1n\rfloor\rfloor- 1, where nn denotes the number of training observations. This approximates the maximum number of decisions in a binary tree whose terminal nodes each contain at least 10% of the training observations. Each active linear term counted as one decision and each condition within an active rule counted as one decision. Predictions and complexity measures were calculated using the selected regularisation parameter. All remaining hyperparameters were left at their default values.

SIRUS

SIRUS was fitted using version 0.3.3 of the R package sirus, which was obtained from the CRAN archive after its removal from CRAN on January 15, 2026, after issues were not addressed. The available implementation supports regression and classification with a numerically encoded binary outcome. Only three benchmark data sets met the latter requirement. SIRUS was therefore not evaluated for classification because restricting its evaluation to these data sets would have prevented a consistent comparison across the broader collection of classification tasks. Model complexity was controlled by the default settings of ten rules and a maximum tree depth of two. All remaining hyperparameters were left at their default values.

SLIM

SLIM was fitted using the R implementation provided by Herbinger et al. [19] in the GitHub repository https://github.com/slds-lmu/mbt_comparison. The RF predictions served as the outcome. Since the implementation supports regression only, SLIM was not applied to classification data sets. We selected the SLIM splitting procedure by setting split.method to slim. Tree growth was controlled by requiring at least 10% of the training observations in each terminal node through min.split. Due to high computation time, we limited n.split, the maximum number of splits, to the value of 10. All remaining hyperparameters were left at their default values.

LM

Following the oracle coaching principle, a linear regression was included as a surrogate model with the RF predictions as its outcome as in Molnar [39]. The initial model formula contained all available variables. Forward selection was then applied by adjusting the direction accordingly. This was done to obtain a more sparse and interpretable model. All remaining hyperparameters were left at their default values. LM was evaluated only for regression outcomes. We did not use separate logistic and multinomial variants for classification because these models produce class probabilities that require data-set-specific decision rules and may become difficult to interpret when the number of outcome classes is large.

Reference model: decision tree

A decision tree was included as a reference model for prediction performance and was fitted using version 0.17.0 of ranger [43]. In contrast to the surrogate models, the decision tree predicted the original outcome. Its configuration otherwise followed that of the decision tree used for OC-CART. We set num.trees to 1, sample.fraction to 1, replace to FALSE, and mtry to the total number of variables. The resulting tree was fitted to the complete training sample without bootstrap resampling and considered every variable at each split. Tree growth was restricted through min.bucket, requiring every terminal node to contain at least 10% of the training observations. All remaining hyperparameters were left at their default values.

Performance measures

Each simulation setting was repeated 100 times. The runtime for each method and iteration was limited to 24 hours. Repetitions that exceeded this limit were treated as failures. Timeouts and other problems that prevented a method from producing a result are also reported in the results section. Variables that occurred directly in the data-generating function of the outcome were defined as effect variables. All remaining variables were considered noise variables. Prediction measures were evaluated on the independent test data, whereas measures of model structure were obtained directly from the fitted models.

Several performance measures required a common definition of the elementary decisions represented by structurally different models. For the tree-based methods ART, CTree, GUIDE, MRT, NH, OC-CART, SLIM, and the decision tree, decisions were identified by split variables used in the nodes. For the rule-based representations produced by inTrees, MOB, RuleFit, and SIRUS, each condition within a rule was treated as a decision. For the linear-model surrogate, the estimated regression coefficients represented the corresponding model components. We selected these definitions to ensure that structural comparisons across methods were as consistent as possible.

Deviation from RF

Similarity to the RF, and thus the suitability of an interpretable model as a surrogate, was assessed with respect to both its predictions and its decision structure.

Prediction similarity was evaluated by comparing the predictions of each interpretable model with those of the corresponding RF on the test data. Prediction disagreement was quantified using the root mean squared error (RMSE) for regression and the misclassification rate (MCR) for classification. Structural similarity was additionally evaluated by comparing the variables used for splitting or rule construction or as regression coefficients of each interpretable model with the split variables used in the individual trees of the corresponding RF.

Model complexity

Model complexity as one surrogate for interpretability was characterized by the total number of structural components, defined as splits for tree-based models, rule conditions for rule-based models, and regression coefficients for the linear model.

Explainability

To assess the reliability of the surrogate models’ decision-making, their decisions were evaluated based on whether they were made using effect or noise variables represented in the fitted models. We calculated the proportions of true effect variables and noise variables that appeared in splits, rule conditions, or regression coefficients.

Prediction performance

Prediction performance on the test data, and thus the potential suitability of the interpretable models as standalone prediction models, was assessed using the F1 score for classification. This score is defined as

Macro-F1=1K∑k=1K2TPk2TPk+FPk+FNk,\mathrm{Macro\text{-}F1} = \frac{1}{K}\sum_{k=1}^{K}\frac{2\mathrm{TP}_{k}}{2\mathrm{TP}_{k}+\mathrm{FP}_{k}+\mathrm{FN}_{k}},

where KK denotes the number of classes, and TPk\mathrm{TP}_{k}, FPk\mathrm{FP}_{k}, and FNk\mathrm{FN}_{k} denote the numbers of true positives, false positives, and false negatives for class kk, respectively, treating each class against all remaining classes. Each class contributes equally to the overall score. The macro-averaged F1 score combines precision and recall while giving equal weight to each class, preventing performance on frequent classes from dominating the overall assessment.

For regression, prediction performance was evaluated using the coefficient of determination (R2R^{2}) and an adapted Akaike information criterion (AIC), which balances prediction error on the test data against model complexity:

AIC=ntestlog⁡(MSEtest)+2D,\mathrm{AIC} = n_{\mathrm{test}}\log(\mathrm{MSE}_{\mathrm{test}}) + 2D,

where DD denotes the number of model decisions and MSEtest\mathrm{MSE}_{\mathrm{test}} the mean squared error on the test data. Lower values indicate a more favorable trade-off.

Runtime

Computations used R 4.3.0 and batchtools 0.9.17 Lang et al., [30] on a heterogeneous Linux cluster managed by Slurm. Cluster nodes differed in their hardware configurations, with 96 to 738 GB of RAM and 12 to 64 CPUs per node. One CPU was requested per job. All jobs were randomly distributed across the cluster nodes, with no preferential assignment of particular jobs to specific nodes. We measured user CPU time for surrogate construction with proc.time(), excluding RF training and evaluation. Because computations were performed on heterogeneous hardware, the reported runtimes indicate approximate computational effort and do not constitute a controlled comparison on identical processors.

Results

Given the large number of methods, data sets, and performance measures, results in the main text are presented as ranks in Figure 3. For each data set and performance measure, the median across repetitions was calculated for each method, and methods were ranked according to these medians, with lower ranks indicating better results. The boxplots summarize the ranks of the methods across the data sets. Detailed boxplots showing the distributions across all repetitions, without prior aggregation, are provided in the appendix.

Ranks of methods across simulation scenarios for each performance measure

Figure 3. Ranks of methods across simulation scenarios for each performance measure (facets), with lower ranks indicating better performance. Within each scenario, the median performance across 100 repetitions was calculated for each method, and methods were then ranked according to these medians. Boxplots summarize the resulting ranks across scenarios. Methods are displayed on the x-axis and colored by method type: oracle coaching using a linear model, oracle coaching using tree-based methods, representative trees, rule extraction methods, and the decision tree (DT) as a prediction model.

All figures used for the results displayed in the text or appendix can be recreated in our Shiny app: https://bioweb2.imbs.uksh.de/rsconnect/Comparison_RF_explainability_methods/.

GUIDE, LM, SIRUS, SLIM, NH, and MOB were not evaluated for classification because their implementations supported regression only. In digit recognition, RuleFit completed 95 of 100 repetitions. The five failed fits returned an error indicating that one or no outcome classes were represented, which is consistent with the small sample size relative to the number of classes (Table A.4). Ranks and boxplots were based on the available results and should therefore be interpreted with caution.

Deviation from RF

Deviation in predictions For regression, GUIDE and LM achieved the highest similarity in the simulation settings with linear effects (see Figure 3 and Figure A.1). These results were expected because these methods can represent linear effects directly. SIRUS performed best for the subgroup structure in the simulation with subgroups, SLIM for the simulation with nonlinear effects, and NH for the simulation with exponential effects. NH had consistently favorable ranks and is the most robust choice when the structure is unknown. inTrees, ART, the decision tree, and MRT generally showed larger deviations and should not be preferred when agreement with RF predictions is the main objective.

For classification, MRT performed best in digit recognition, and the decision tree in the noisy variant. RuleFit was preferable for the interaction structure in the XOR-problem simulation, closely followed by inTrees and ART. However, RuleFit and inTrees performed poorly in both multiclass settings. OC-CART and the decision tree had the most favorable average ranks, with OC-CART providing the more direct RF explanation because it was fitted to the RF predictions. Five RuleFit repetitions were unavailable in digit recognition, which limits its suitability for small multiclass data sets (Table A.4).

Deviation in decisions For regression, NH had the best average structural rank and also provided the most consistent balance between prediction and structural similarity (see Figure 3 and Figure A.2). SIRUS was a strong structural alternative in the simulation settings with linear effects. MRT reproduced RF variable usage best in the simulation with subgroups and the simulation with exponential effects, but had the lowest prediction similarity in both settings. In the simulation with nonlinear effects, the distance was zero for ten methods because they used the same variables as the RF. GUIDE and LM reproduced predictions well in the linear settings, but structural similarity was low for LM and unavailable for GUIDE. For GUIDE, the fitted models contained no splits, and the implemented structural measure did not account for variables in the linear node model.

For classification, MRT achieved the highest structural similarity in all settings and was also best in prediction similarity for digit recognition. The decision tree and OC-CART provided the best balance in the noisy variant. In the XOR-problem simulation, RuleFit predicted best but showed low structural similarity, while ART provided the most balanced result. Thus, high prediction similarity alone should not justify interpreting a method’s decisions as those of the RF. Such an interpretation may be misleading when the variables used by both models differ.

Model complexity

The number of decisions varied substantially across methods despite the common complexity constraint (see Figure 3 and Figure A.3). For regression, ART was the most compact nonempty model, with three to four decisions. The decision tree, CTree, MOB, OC-CART, SLIM, RuleFit, and inTrees generally remained below ten, while SIRUS used approximately 14 to 15. LM and NH reached medians of up to 77 and 103 components. MRT varied most strongly and reached 330 decisions in the simulation with nonlinear effects and 671 in the simulation with exponential effects. GUIDE often produced no split, but its node regression model still represented the complete data. ART is therefore the clearest recommendation for regression when compactness is the primary objective, while NH and MRT should generally be avoided.

For classification, ART was also the most compact method, with two to five decisions. The decision tree, CTree, OC-CART, RuleFit, and inTrees used between five and nine, compared with 25 to 76 for MRT. ART is therefore also preferable for classification when minimal complexity is required, while the former methods provide moderately sized alternatives.

Explainability

Used effect and noise variables in decisions Reliable explanations should cover a large proportion of the true effect variables while including few noise variables. For regression, inTrees and NH provided the most favorable balance in the Sim_ART settings because they covered comparatively many effect variables without using noise variables (see Figure 3, Figure A.4, and Figure A.5). MRT and LM often covered more effects, but also included the largest proportions of noise variables. In the simulation with subgroups, NH provided the best balance by covering 85.7% of the effects without using noise variables. ART and RuleFit were more conservative alternatives with 57.1% effect coverage and no noise variables. Most methods recovered both effect variables in the simulation with nonlinear effects, so this setting did not distinguish between them. In the simulation with exponential effects, NH provided the most favorable balance by covering a median of 87.5% of the effect variables without using noise variables. SIRUS and RuleFit also avoided noise variables but covered only 75% and 62.5% of the effects. LM and MRT covered all effect variables, but LM also used 23.9% and MRT all of the noise variables.

For classification, MRT covered all effect variables in digit recognition, followed by inTrees. Noise coverage could not be assessed because this setting contained no designated noise variables. In the noisy variant, inTrees provided the best balance by covering most effect variables without using noise variables. The decision tree and OC-CART covered fewer effects and included a small proportion of noise variables. In the XOR-problem simulation, ART and inTrees covered all effect variables without using noise variables and are therefore the strongest recommendations when reliable variable identification is the primary objective. MRT also covered all effects but included most available noise variables in the noisy and interaction settings, which makes its explanations less reliable despite its high effect coverage.

GUIDE produced a single linear regression model without any splits. Because the explainability measures considered only split variables and excluded variables used in the regression model, they were not calculated for GUIDE, preventing comparison with the other methods on these measures.

Prediction performance

R2R^2 and AIC Both R2R^2 and AIC favored the decision tree in the simulation with few large effects (see Figure 3, Figure A.6, and Figure A.7). This advantage is expected because the decision tree was the only method fitted directly to the observed outcome, while the other methods approximated the RF. SLIM performed best in the simulations with subgroups, nonlinear effects, and exponential effects. In the simulations with many small effects and continuous variables, LM achieved the highest R2R^2, while GUIDE obtained the lowest AIC. SLIM is therefore the strongest general recommendation, while LM is preferable for prediction and GUIDE for the measured accuracy-complexity trade-off in predominantly linear settings. RuleFit and inTrees ranked lowest overall and sometimes had negative R2R^2 values.

F1 score Although the decision tree was the only method fitted directly to the observed outcome, CTree achieved the highest Macro F1 score in both digit-recognition settings and is therefore recommended for multiclass prediction (see Figure 3 and Figure A.8). In the digit-recognition setting without noise, OC-CART ranked second and the decision tree third, while the decision tree ranked second and OC-CART third in the noisy variant. inTrees attained the best result in the XOR-problem simulation and is preferred for the XOR structure. RuleFit had the lowest average rank and is not recommended when classification performance is the primary objective.

Runtime

CPU time was measured in minutes (see Figure A.9). For regression, all methods had median runtimes below 0.15 minutes except SLIM at 1.12 minutes, RuleFit at 2.28 minutes, and ART at 2.59 minutes. For classification, median runtimes were below 0.16 minutes except for RuleFit at 0.50 minutes. The decision tree and OC-CART were fastest for both outcome types.

Comparison using benchmark data

Aim

The benchmark comparison aimed to evaluate the methods across a broad range of regression and classification data sets with unknown data-generating mechanisms. It examined the similarity to the RF, model complexity, prediction performance, and runtime in order to provide practical guidance for method selection.

Data sets

The empirical comparison included 67 publicly available benchmark data sets, comprising 28 regression and 39 classification tasks. The data sets originated from the empirical evaluations reported in the publications identified by the literature review and covered a wide range of application domains, sample sizes, dimensionalities, and variable types. The source, persistent identifier where available, dimensions before and after quality control, outcome type, and the publication motivating inclusion are reported in Table A.3. The selection process and reasons for excluding candidate data sets are summarized in Figure 2.

Regression data sets

The regression benchmark comprised 28 data sets with continuous outcomes. The collection included 15 data sets obtained from OpenML [5], four from the UCI Machine Learning Repository (Kelly et al., n.d.), six distributed with R packages (mlbench V2.1.7 [31], AER V1.2.16 [26], GLMsData V1.4 [9]), and three provided through the data archive accompanying https://hastie.su.domains/ElemStatLearn/datasets Hastie et al., [17]. After preprocessing, the number of observations ranged from 97 to 577,601. The number of recorded variables, including the outcome, ranged from 3 to 361. None of the regression data sets had more variables than observations after preprocessing (see below for details).

Classification data sets

The classification benchmark comprised 39 data sets, of which 34 were obtained from the UCI Machine Learning Repository (Kelly et al., n.d.), one from OpenML [5], and four were distributed with R packages (mlbench V2.1.7 [31], ipred V0.9.15 [40]). The collection included both binary and multiclass outcomes. After preprocessing, the classification data sets contained between 55 and 5,000 observations. Their dimensions ranged from 4 to 441 recorded variables, including the outcome.

Preprocessing

All benchmark data sets were processed using a predefined quality-control procedure before cross-validation. Identifier columns were removed where present. Variables with more than 50% missing values were excluded. Observations with any remaining missing values were then removed. Rare levels of categorical variables were combined into a common other category when their relative frequency was below 20%. For classification data sets, this procedure was also applied to the outcome. Variables that were constant after these steps were also excluded. To ensure that class labels could be processed consistently by all implementations, hyphens and ampersands in outcome labels were replaced with underscores, and whitespace was removed. The outcome was consistently named y. For regression data sets, observations with extreme outcome values were excluded if their outcome lay outside the interval defined by the median plus or minus five interquartile ranges. The dimensions before and after the complete preprocessing procedure are reported in Table A.3.

Targets

The targets were the same as those in the simulation study.

Methods

Analogous to the simulation study, the 12 surrogate and rule extraction methods, together with the decision tree, were included in the comparison study.

Performance measures

Performance was evaluated using 10-fold cross-validation. The methods were evaluated using the same criteria as in the simulation study, namely deviation from the RF, model complexity, prediction performance, and runtime. Explainability could not be evaluated because the true data-generating process is unknown, making it impossible to distinguish unambiguously between effect and noise variables.

Results

As for the simulated data sets, the benchmark results are presented in a compact, rank-based form in Figure 4, while the unaggregated results are provided in the Appendix. The figures can also be reproduced using our Shiny app (https://bioweb2.imbs.uksh.de/rsconnect/Comparison_RF_explainability_methods/). Failures and their recorded causes are summarized in Table A.4.

Ranks of methods across benchmark data sets for each performance measure

Figure 4. Ranks of methods across benchmark data sets for each performance measure (facets), with lower ranks indicating better performance. Within each data set, the median performance across 10-fold CV was calculated for each method, and methods were then ranked according to these medians. Boxplots summarize the resulting ranks across data sets. Methods are displayed on the x-axis and colored by method type: oracle coaching using a linear model, oracle coaching using tree-based methods, representative trees, rule extraction methods, and the decision tree (DT) as a prediction model.

NH produced at least one result for only 13 of the 28 regression data sets: complete failures were caused by negative-length-vector or non-positive-definite-quadratic-function errors, while eight of ten folds failed for bike_sharing because the constraints were inconsistent. ART and RuleFit each produced regression results for 26 data sets; ART exceeded the 24-hour limit in all folds of two data sets and in seven folds of nyc-taxi, whereas RuleFit exceeded the limit in all folds of two data sets. SLIM had individual prediction failures across four regression data sets. For classification, ART returned an empty variable selection in four folds of heart_disease_s. These incomplete results should therefore be interpreted with caution, as the displayed summaries are based only on results from successful folds.

Deviation from RF

Deviation in predictions Across the 28 regression data sets, SLIM achieved the lowest deviation on 23, consistent with the simulation results and its ability to represent both global additive effects and local

deviations through separate leaf models (see Figure 4, Figure A.10, and Figure A.11). LM ranked among the three best methods on 14 data sets, but outperformed SLIM on only three. GUIDE also ranked among the three best methods on 12 of these 14 data sets, suggesting that their RF prediction functions could be approximated reasonably well by a global linear model. This pattern does not establish that the data-generating mechanisms were linear. SLIM should therefore be preferred when local heterogeneity is expected. If LM or an unsplit GUIDE model achieves comparably stable similarity, LM may instead be selected because a single set of global coefficients provides a more uniform interpretation than multiple local SLIM models. NH ranked among the three best methods on seven of the 13 data sets for which it was available, nine of which were below the median sample size. Its limited coverage prevents a general recommendation.

Across the 39 classification data sets, inTrees achieved the best mean similarity rank, followed by CTree and OC-CART. inTrees performed best on average among the 13 smallest and the 13 highest-dimensional data sets, while CTree led among the 13 data sets with the fewest variables and OC-CART among the 13 largest. This may reflect the ability of inTrees to represent interactions through compact rules, of CTree to identify stable partitions in low dimensions, and of OC-CART to estimate a surrogate tree from larger samples. However, these patterns were descriptive, and neither p/np/n, class number, nor class imbalance consistently explained performance. inTrees is therefore the preferred general choice, with CTree as an alternative for low-dimensional data with limited redundancy and OC-CART for large samples.

Deviation in decisions MRT achieved the highest structural similarity, particularly when few variables and no strongly correlated numeric variables were present (see Figure 4 and Figure A.12). SIRUS was the strongest regression alternative, and inTrees the strongest classification alternative. Since MRT had comparatively low prediction similarity for regression, it should be selected only when agreement with the RF decision structure is more important than agreement with its predictions.

Model complexity

ART provided the most consistently compact nonempty representation across both outcomes, with CTree similarly compact for classification (see Figure 4 and Figure A.13). SLIM used few splits, but the coefficients of its local leaf models were not represented by this measure. The same limitation applies to the unsplit regression model of GUIDE, so its apparent complexity of zero is not directly comparable. NH was complex because it combines overlapping nodes, while MRT inherited the comparatively large structure of an unconstrained RF tree.

Prediction performance

R2R^2 and AIC SLIM achieved the best mean rank for both R2R^2 and AIC rank (see Figure 4, Figure A.15, and Figure A.14). SLIM is therefore the strongest general recommendation when prediction performance is prioritized, while GUIDE performed best according to the measured accuracy–complexity trade-off. LM and GUIDE were preferable when a global linear model already performed well, whereas SLIM became increasingly favorable as the performance advantage of the RF over LM grew. This agrees with the simulation results and supports selecting LM for a uniform global interpretation when its performance is comparable, and SLIM when nonlinear or locally varying effects provide a relevant performance gain. GUIDE also achieved favorable AIC values, although its unsplit leaf model is not represented by the complexity term. The decision tree ranked below these methods despite being fitted directly to the observed outcome, while RuleFit and inTrees performed worst overall.

Macro F1 score inTrees achieved the best mean Macro F1 rank and is therefore the preferred general choice for classification performance (see Figure 4 and Figure A.16). RuleFit ranked second but was unavailable for two data sets and had individual failed folds in four further data sets because of unseen factor levels or insufficiently represented outcome classes (Table A.4). CTree provided the strongest alternative with complete coverage. Unlike in the simulation, neither p/np/n, class number, nor class imbalance identified settings in which inTrees or RuleFit was consistently preferable. Method selection should therefore be validated on the data at hand when classification performance is the primary objective.

Runtime

The decision tree and OC-CART were fastest across data set sizes and dimensions because they required only a single tree fit (see Figure A.17). ART and RuleFit were slowest, with regression medians of approximately 1.0 minute, followed by SLIM at 0.85 minutes. RuleFit and ART were also slowest for classification, with medians of 0.41 and 0.31 minutes.

Discussion

No single method is universally preferable for interpreting RFs. Method selection should instead reflect the outcome type, anticipated data structure, and whether the objective is prediction similarity, structural similarity, prediction performance, or interpretability.

For regression, SLIM was the strongest general choice when prediction similarity or performance was central, particularly for nonlinear or locally varying effects. When LM performed comparably, its global coefficient vector provided the simpler interpretation. Competitive LM or unsplit GUIDE performance may indicate that a linear approximation is sufficient, but does not establish a linear data-generating mechanism. NH and SIRUS showed favorable structural similarity, while MRT was useful when agreement with RF variable usage outweighed prediction similarity. ART consistently provided the most compact representation, and inTrees and NH often recovered effect variables without including noise variables.

For classification, inTrees was the strongest general choice on the benchmark data for similarity and prediction performance. CTree was a robust alternative with complete coverage, while OC-CART was competitive on larger data sets and computationally efficient. In the simulations, CTree achieved the best multiclass prediction, MRT closely reproduced the RF in digit recognition without additional noise variables, and inTrees was well suited to the XOR structure. ART was preferable when compactness or effect-variable recovery was prioritized.

The results demonstrate a trade-off between interpretability and prediction performance. Flexible models may perform well at the cost of greater complexity, whereas compact models may omit relevant structure. MRT sometimes combined large models with weak prediction similarity, while ART was compact but did not generally predict best. SLIM combined strong performance with few splits, although its local coefficients add complexity not captured by the split count. Prediction and structural similarity should therefore be considered jointly with complexity.

For data sets with unknown underlying structure, relying on a single surrogate modeling approach may be insufficient. Structurally different candidates should be compared using cross-validated similarity, prediction performance, complexity, and stability. Comparable LM performance supports a global approximation, while improvements by SLIM or tree- and rule-based methods may suggest local heterogeneity, subgroups, or interactions. The simplest stable model whose performance is not meaningfully worse than that of more flexible alternatives should be selected.

In practice, however, differences between the implementations restricted the comparability of the methods. Some methods did not support classification, and CPU runtimes above 24 hours, numerical optimization errors, incompatible prediction methods, empty variable selections, unseen factor levels, or insufficiently represented outcome classes prevented complete benchmark coverage (Table A.4). Average results therefore refer to different subsets of tasks, although method failure is reported and broadly applicable methods are emphasized. The 67 heterogeneous benchmarks nevertheless provide broader evidence than evaluations based on few selected tasks. Restricting the number of splits or rules did not make model complexity fully comparable, as compactness was assessed within each model form using measures such as the number of splits in trees or coefficients in linear models. To improve comparability, the decision tree and OC-CART were fitted without post-pruning, avoiding an additional complexity-reduction step beyond the common minimum leaf-size constraint. However, this choice may have disadvantaged both methods, as pruning could yield a better balance between prediction performance and model complexity. No data-specific hyperparameter optimization was performed, so alternative settings could change method rankings. Instead, we followed recommendations from the original publications and otherwise used defaults. This reproducible strategy reflects typical use without extensive tuning and avoids favoring methods with larger tuning spaces.

The favorable classification results for inTrees agree with Aria et al. [1], who found slightly better prediction performance for inTrees than for NH on six binary tasks. We extend this evidence to a larger benchmark including multiclass outcomes, while showing that inTrees is not superior for every interpretability objective. Direct comparison with their NH result is limited because only regression is implemented. Our results also support Herbinger et al. [19], who concluded that surrogate choice depends on the balance between similarity and interpretability and that hyperparameters influence performance. We confirm this trade-off beyond their main-effect simulations and extend it to nonlinear, interaction, subgroup, and multiclass settings and benchmark data. The broader method set further shows the relevance of rule extraction and structural representatives when variable usage rather than prediction is the target.

Future work should evaluate hyperparameter optimization under equal computational budgets, develop complexity measures that jointly represent splits, rules, and coefficients, and examine explanation stability. A data-driven selection procedure could then combine cross-validated similarity, prediction performance, stability, and complexity for new data sets.

In conclusion, interpretable RF approximations should be selected for their intended purpose rather than by a universal ranking. SLIM is the strongest general option for regression when prediction similarity is central, while LM is preferable when it performs comparably and a global interpretation is desired. inTrees is the strongest general classification option, with CTree and OC-CART as useful alternatives, and ART should be considered when compactness is paramount. Regardless of the selected method, prediction agreement alone is not sufficient for explaining an RF and should be complemented by structural similarity, complexity, and stability.

Author Contributions

Lea L. Mairhöfer: conceptualization, data curation, formal analysis, investigation, methodology, software, visualization, writing—original draft, writing—review & editing. Jonathan B. Krause: software, writing—review & editing. Björn-Hergen Laabs: conceptualization, funding acquisition, supervision, writing—review & editing. Silke Szymczak: conceptualization, supervision, writing—review & editing.

All authors read and approved the final manuscript.

Acknowledgments

This study was funded by the Medical Section of the University of Luebeck (J01–2024, BL).

Conflict of Interest

The authors declare no conflicts of interest.

Data Availability Statement

The GitHub repository https://github.com/imbs-hl/Comparison_RF_explainability_methods_paper contains the results from the paper and the full R code, allowing users to reproduce all results and figures or to generate their own results. The code for all simulated data sets is stored there. The benchmark data sets used are all publicly available at the sources stated in Table A.3.

All figures used for the results displayed in the text or appendix can be recreated in our Shiny app: https://bioweb2.imbs.uksh.de/rsconnect/Comparison_RF_explainability_methods/.

MethodInformation usedFinal representationConstruction and selection criteriaStopping and complexity controlPrediction componentsFinal prediction
Methods using the oracle coaching approach
LMVariables and RF predictionsGlobal linear regression modelLeast-squares fitting. Forward selection can reduce the variable setVariable selection stops when the selection criterion no longer improvesIntercept and linear variable termsIntercept plus the sum of variable values multiplied by their coefficients
OC-CARTVariables and RF predictionsSingle tree with constant terminal-node predictionsVariable and split point selected jointly by maximizing impurity reductionNode-size and other growth constraints. No post-pruning in this studyTerminal-node mean or majority classPrediction of the terminal node reached by the observation
GUIDEVariables and RF predictionsSingle tree with local linear main effects modelsVariable selected using residual-sign association and interaction tests. Split point minimizes the combined residual sum of squares of the child-node modelsMinimum improvement criterion, node-size constraints, and a limit on tree-growth levels. Variable-selection tests do not require significance for continued growthLinear model within each terminal nodePrediction from the local model in the terminal node reached by the observation
SLIMVariables and RF predictionsSingle tree with local main effects modelsVariable and split point selected jointly by minimizing the combined residual sum of squares of the child-node modelsNode-size constraints and a limit on tree-growth levels in this study. A minimum improvement criterion also controls splittingMain effects model within each terminal nodePrediction from the local model in the terminal node reached by the observation
MOBVariables and RF predictionsSingle tree with intercept-only node modelsVariable selected by parameter instability tests. Split point minimizes the combined residual sum of squares around the child-node meansNo significant instability after multiplicity correction, or growth constraintsMean RF prediction within each terminal nodePrediction of the terminal node reached by the observation
MethodInformation usedFinal representationConstruction and selection criteriaStopping and complexity controlPrediction componentsFinal prediction
CTreeVariables and RF predictionsSingle tree with constant terminal-node predictionsVariable selected by conditional independence tests. Split point maximizes a standardized separation statisticNo significant association after multiplicity correction, or growth constraintsTerminal-node mean or majority classPrediction of the terminal node reached by the observation
Representative trees
MRTTrees of the fitted RFOne existing RF treeSelects the tree with the smallest average distance to the other RF treesInherits the selected tree’s size. No additional tree growthPredictions retained from the selected RF treePrediction of the terminal node reached in the selected tree
ARTFitted RF, variables, and observed outcomesNew representative tree with constant terminal-node predictionsSelects the candidate split yielding the smallest distance between the resulting tree and the RFStops when distance increases or remains unchanged without sufficient prediction improvement. Node-size constraints also applyMean observed outcome or majority observed class within each terminal nodePrediction of the terminal node reached by the observation
Rules extracted from RF trees
inTreesTrees of the fitted RF, variables, and observed outcomesOrdered rule listExtracts path rules, removes redundant conditions, and selects rules using prediction error, coverage, and lengthRule simplification and selection. An additional decision budget is applied in this studyPrediction assigned to each rule using observed outcomesPrediction of the first matching rule. Default prediction if no selected rule matches
Rules learned from RF predictions
SIRUSVariables and RF predictionsWeighted collection of rules with an interceptBuilds its own modified RF with quantile-based numerical split points. Selects frequent paths and removes linearly dependent rulesRule-frequency threshold and forest-stability criterionEach rule returns the mean RF prediction inside or outside its conditions. Non-negative weights fitted by ridge regressionIntercept plus the weighted sum of all selected rule outputs
MethodInformation usedFinal representationConstruction and selection criteriaStopping and complexity controlPrediction componentsFinal prediction
NHVariables and RF predictionsWeighted collection of overlapping rulesGenerates candidate rules from its own forest. Joint quadratic optimization assigns non-negative weights. Only rules with positive weights contributeCandidate-set size, rule length, and node-size constraints. Weight optimization determines the contributing rulesMean RF prediction among training observations satisfying each ruleWeighted mean of all matching rule predictions, normalized by the sum of their weights
RuleFitVariables and RF predictionsRegularized regression model containing rule indicators and linear variable termsGenerates path rules from new conditional inference trees. LASSO jointly estimates coefficients and selects termsTree number and depth, regularization strength, and the additional decision budget used in this studyBinary rule indicators, retained linear terms, and an interceptIntercept plus weighted rule indicators and linear terms. For classification, linear predictors are transformed into class probabilities

Table A.1. Comparison of the interpretation methods in the configurations used in this study. For tree methods, construction criteria refer to variable and split-point selection. For rule-based methods, they refer to rule generation and selection.

NameAbbreviationTypePublicationImplementationUsed versionRegressionClassification
Artificial Representative TreeARTS(Laabs, Kronziel, et al., 2024)R package timbR on GitHub https://github.com/imbs-hl/timbRV3.3.2yesyes
Conditional Inference TreeCTreeS[20]R package partykit on CRANV1.2-26yesyes
Classification and Regression Treedecision tree (reference model)-[6]R package ranger on CRANV0.17.0yesyes
Generalized, Unbiased Interaction Detection and EstimationGUIDES[33]R implementation on GitHub https://github.com/slds-lmu/mbt_comparisonDownloaded 18.01.2026yesno
Interpretable TreesinTreesR[8]R package inTrees in CRAN archiveV1.4yesyes
Model-Based Recursive PartitioningMOBS[44]R package partykit on CRANV1.2-26yesno
Most Representative TreeMRTS[3]R package timbR on GitHub https://github.com/imbs-hl/timbRV3.3.2yesyes
Node HarvestNHR[37]R package nodeHarvest in CRAN archiveV0.7-3yesno
Oracle Coaching using CARTOC-CARTS[24]R package ranger on CRANV0.17.0yesyes
RuleFitRuleFitR[12]R package pre on CRANV1.0.8yesyes
Stable and Interpretable Rule SetSIRUSR[4]R package sirus in CRAN archiveV0.3.3yesno
Surrogate Locally-Interpretable ModelsSLIMS(Hu et al., 2020)R implementation on GitHub https://github.com/slds-lmu/mbt_comparisonDownloaded 18.01.2026yesno
Oracle Coaching using Linear ModelLMS[39]R package stats on CRANV4.3.0yesno

Table A.2. Overview of methods used in this study. S: surrogate model; R: rule extraction method. The decision tree serves as a prediction model fitted to the observed outcome and is therefore assigned neither category.

Table A.3: Overview of the data sets used in the method comparison. The name is displayed in combination with the dimension of the data set after downloading the benchmark data (bench) or simulating it (sim). The columns "after QC" give the number after the preprocessing steps described in the text are applied as quality control (QC). We investigated two outcomes: classification (classif) with the number of classes in brackets and regression (regr). The last column describes which method was introduced on this data set. Details about the methods and the corresponding publications are listed in Table A.2.

Data setN (original)N (after QC)P (original)P (after QC)outcometypeSourceUsed in publication of
BreastCancer6996831110classif (2)benchUCI: https://doi.org/10.24432/C5HP4ZCTree
Digit recognition5200520077classif (10)simSimulation from [6]decision tree
Digit recognition noisy520052002424classif (10)simSimulation from [6]CART algorithm
GlaucomaMVF1701536767classif (2)benchR package ipred V0.9.15CTree
XOR-problem2002002020classif (2)simSimulation from [8]inTrees
Soybean6835623636classif (19)benchR package mlbench V2.1.7CTree
automobile2051592625classif (6)benchUCI: https://doi.org/10.24432/C5B01CinTrees
balance_scale62562555classif (3)benchUCI: https://doi.org/10.24432/C5488XOC-CART
breast_cancer2862771010classif (2)benchR package mlbench V2.1.7CTree
breast_cancer_wisconsin_diagnostic5695693231classif (2)benchUCI: https://doi.org/10.24432/C5DW2BOC-CART, inTrees, node-Harvest
congressional_voting_records4352321717classif (2)benchUCI: https://doi.org/10.24432/C5C01POC-CART
connectionist_bench_sonar_mines_vs_rocks2082086161classif (2)benchUCI: https://doi.org/10.24432/C5T01QOC-CART, CTree
contraceptive_method_choice147314731010classif (3)benchUCI: https://doi.org/10.24432/C59W2DOC-CART
credit_approval6906531616classif (2)benchUCI: https://doi.org/10.24432/C5FS30inTrees
dermatology3663583535classif (6)benchUCI: https://doi.org/10.24432/C5FK5POC-CART
diabetes76876899classif (2)benchR package mlbench V2.1.7CTree, OC-CART, inTrees, nodeHarvest, SIRUS, MOB
ecoli33633698classif (8)benchUCI: https://doi.org/10.24432/C5388MOC-CART
glass_identification2142141110classif (6)benchUCI: https://doi.org/10.24432/C5WW2POC-CART, inTrees, CTree
haberman_survival30630644classif (2)benchUCI: https://doi.org/10.24432/C5KX51OC-CART, SIRUS
heart_disease_c3032971414classif (5)benchUCI: https://doi.org/10.24432/C52P4XOC-CART, SIRUS
heart_disease_h2942611411classif (5)benchUCI: https://doi.org/10.24432/C52P4XOC-CART, SIRUS
heart_disease_s123551411classif (5)benchUCI: https://doi.org/10.24432/C52P4XOC-CART
horse_colic368612824classif (2)benchUCI: https://doi.org/10.24432/C58W23OC-CART, inTrees, SIRUS
image_segmentation2102102019classif (7)benchUCI: https://doi.org/10.24432/C5GP4NOC-CART
ionosphere3513513534classif (2)benchUCI: https://doi.org/10.24432/C5W01BOC-CART, CTree, SIRUS
iris15015055classif (3)benchUCI: https://doi.org/10.24432/C56C76OC-CART, inTrees
liver_disorders34534577classif (2)benchUCI: https://doi.org/10.24432/C54G67OC-CART, SIRUS
lymphography1481481919classif (4)benchUCI: https://doi.org/10.24432/C54598inTrees
parkinsons1951952423classif (2)benchUCI: https://doi.org/10.24432/C59C74nodeHarvest

Table A.3.

secom1567461591441classif (2)bench UCI: https://doi.org/10.24432/C54305SIRUS
spambase460146015858classif (2)bench UCI: https://doi.org/10.24432/C53G6XOC-CART
statlog_australian_credit_approval6906901515classif (2)bench UCI: https://doi.org/10.24432/C59012OC-CART, SIRUS, inTrees
statlog_german_credit_data100010002121classif (2)bench UCI: https://doi.org/10.24432/C5NC77OC-CART, SIRUS
statlog_heart2702701414classif (2)bench UCI: https://doi.org/10.24432/C57303inTrees, SIRUS
statlog_vehicle_silhouettes94941919classif (4)bench UCI: https://doi.org/10.24432/C5HG6NOC-CART, inTrees, CTree
teaching_assistant_evaluation15115166classif (3)bench UCI: https://doi.org/10.24432/C55P6MOC-CART
thyroid_disease316320002620classif (3)bench UCI: https://doi.org/10.24432/C5D010OC-CART
tic_tac_toe_endgame9589581010classif (2)bench UCI: https://doi.org/10.24432/C5688JOC-CART, inTrees
waveform_database_generator_version_1500050002222classif (3)bench UCI: https://doi.org/10.24432/C5688JOC-CART, inTrees, CART algorithm
waveform_database_generator_version_2500050004141classif (3)bench OpenML: ID 60CART algorithm
wine1781781414classif (3)bench UCI: https://doi.org/10.24432/C5PC7JOC-CART, inTrees, ART
zoo1011011817classif (7)bench UCI: https://doi.org/10.24432/C5R59VinTrees
Allstate_Claims_Severity188318187027132127regrbench OpenML: ID 42571ART
Brazilian_houses10692106711313regrbench OpenML: ID 42688ART
Journals18018099regrbench R package AER V1.2.16MOB
Buzzinsocialmedia_Twitter5832505411257878regrbench OpenML: ID 4549ART
Mercedes_Benz_Greener_Manufacturing42094208378361regrbench OpenML: ID 42570ART
Moneyball123212321510regrbench OpenML: ID 41021ART
Ozone3662031311regrbench R package mlbench V2.1.7CTree, CART algorithm, nodeHarvest
Servo16716755regrbench R package mlbench V2.1.7CTree
Simulation Few large effects20002000100100regrsim Simulation from (Laabs, Kronziel, et al., 2024)ART
Simulation Many small effects20002000100100regrsim Simulation from (Laabs, Kronziel, et al., 2024)ART
Simulation Correlated variables20002000100100regrsim Simulation from (Laabs, Kronziel, et al., 2024)ART
Simulation Interaction effects20002000100100regrsim Simulation from (Laabs, Kronziel, et al., 2024)ART
Simulation Continuous variables20002000100100regrsim Simulation from (Laabs, Kronziel, et al., 2024)ART
Simulation Subgroups2002001010regrsim Simulation from [6]CART algorithm
Simulation Nonlinear effects2000200022regrsim Simulation from [37]nodeHarvest
Simulation Exponential effects5500055000100100regrsim Simulation from [12]RuleFit
abalone4177417099regrbench R package mlbench V2.1.7nodeHarvest, ART
bike_sharing_dataset17379173791715regrbench UCI: https://doi.org/10.24432/C5W894SLIM
black_friday1668211668211010regrbench OpenML: ID 41540ART
bone48548543regrbench https://hastie.su.domains/ElemStatLearn/datasets [2]nodeHarvest
boston_housing5065061414regrbench R package mlbench V2.1.7CTree, CART algorithm, nodeHarvest, RuleFit, MOB, ART
crime19941993128103regrbench UCI: https://doi.org/10.24432/C53W3XnodeHarvest, ART
diamonds53940539401010regrbench OpenML: ID 42225ART
elevators16599163611919regrbench OpenML: ID 216ART
galaxy32332365regrbench https://hastie.su.domains/ElemStatLearn/datasetsnodeHarvest
house_16H22784223071717regrbench OpenML: ID 574ART
house_sales21613214222422regrbench OpenML: ID 42731ART
lungcap65465455regrbench R package GLMsData V1.4GUIDE
machine209202108regrbench UCI: https://doi.org/10.24432/C5830DnodeHarvest
mpg39839298regrbench UCI: https://doi.org/10.24432/C5859HnodeHarvest
nyc-taxi-green-dec-20165818355776011916regrbench OpenML: ID 42729ART
pol15000150004927regrbench OpenML: ID 201ART
prostate9797109regrbench https://hastie.su.domains/ElemStatLearn/datasetsnodeHarvest
socmob1156108764regrbench OpenML: ID 541ART
space_ga3107310677regrbench OpenML: ID 507ART
tecator240240126125regrbench OpenML: ID 505ART

Table 1.

MethodOutcomeSourceDetails
ARTregrbenchruntime above 24 h for data sets Allstate (10 times), Buzzinsocialmedia_Twitter (10 times), nyc-taxi (7 times)
ARTclassifbenchno variables selected for data set heart_disease_s (4 times)
NHregrbenchconstraints are inconsistent, no solution for data set bike_sharing (8 times); negative length vectors are not allowed for data sets Allstate (10 times), Brazilian_houses (10 times), Journals (10 times), Mercedes_Benz (10 times), Moneyball (10 times), Ozone (10 times), Servo (10 times), abalone (10 times), black_friday (10 times), nyc-taxi (10 times), socmob (10 times); quadratic function is not positive definite for data sets Buzzinsocialmedia_Twitter (10 times), diamonds (10 times), house_16H (10 times), house_sales (10 times)
SLIMregrbenchno applicable method for ‘predict’ applied to an object of class for data sets Journals (4 times), Ozone (2 times), machine (3 times), prostate (7 times)
ruleFitregrbenchruntime above 24 h for data sets Buzzinsocialmedia_Twitter (10 times), nyc-taxi (10 times)
ruleFitclassifsimmultinomial or binomial class has 1 or 0 observations for data set Digits recognition (5 times)
ruleFitclassifbenchfactor has new levels for data sets automobile (1 time), breast_cancer (8 times), credit_approval (1 time); multinomial or binomial class has 1 or 0 observations for data sets heart_disease_c (10 times), heart_disease_s (2 times), tic_tac_toe_endgame (10 times)

Table A.4. Failed simulation repetitions and benchmark cross-validation folds by method, outcome, source, data set, and recorded cause.

Supplementary figures: Simulation study

Root mean squared error and misclassification rate across simulated test data sets

Figure A.1. Root mean squared error (RMSE) for regression and misclassification rate (MCR) for classification between the predictions of each method and the corresponding RF across all simulated test data sets. Methods are displayed on the x-axis and colored by method type: rule extraction method, surrogate model, or prediction model (decision tree; DT). Facet headers indicate the outcome type, with light gray denoting classification and dark gray denoting regression.

Average proportion of variables whose use in model decisions differed between each method and the individual trees of the corresponding RF across all simulated data sets

Figure A.2. Average proportion of variables whose use in model decisions differed between each method and the individual trees of the corresponding RF across all simulated data sets. Methods are displayed on the x-axis and colored by method type: rule extraction method, surrogate model, or prediction model (decision tree; DT). Facet headers indicate the outcome type, with light gray denoting classification and dark gray denoting regression.

Number of decisions of each method across all simulated data sets

Figure A.3. Number of decisions of each method across all simulated data sets. Methods are displayed on the x-axis and colored by method type: rule extraction method, surrogate model, or prediction model (decision tree; DT). Facet headers indicate the outcome type, with light gray denoting classification and dark gray denoting regression. Lower values indicate greater interpretability.

Covered effect vars in the decisions of each method across all simulated data sets

Figure A.4. Covered effect vars in the decisions of each method across all simulated data sets. Methods are displayed on the x-axis and colored by method type: rule extraction method, surrogate model, or prediction model (decision tree; DT). Facet headers indicate the outcome type, with light gray denoting classification and dark gray denoting regression.

Covered noise variables in the decisions of each method across all simulated data sets

Figure A.5. Covered noise vars in the decisions of each method across all simulated data sets. Methods are displayed on the x-axis and colored by method type: rule extraction method, surrogate model, or prediction model (decision tree; DT). Facet headers indicate the outcome type, with light gray denoting classification and dark gray denoting regression.

R squared of each regression method across all simulated data sets

Figure A.6. R2R^2 of each regression method across all simulated data sets. Methods are displayed on the x-axis and colored by method type: rule extraction method, surrogate model, or prediction model. (decision tree; DT)

Boxplots of AIC for regression methods across simulated data sets

Figure A.7. AIC of each regression method across all simulated data sets. Methods are displayed on the x-axis and colored by method type: rule extraction method, surrogate model, or prediction model (decision tree; DT).

Boxplots of Macro F1 score for classification methods across simulated data sets

Figure A.8. Macro F1 score of each classification method across all simulated data sets. Methods are displayed on the x-axis and colored by method type: rule extraction method, surrogate model, or prediction model (decision tree; DT).

CPU runtime in minutes across simulated data sets, shown for few large effects, many small effects, correlated variables, interaction effects, continuous variables, subgroups, nonlinear effects, exponential effects, digits recognition, digits recognition noisy, and XOR-problem

Figure A.9. CPU runtime in minutes of each method across all simulated data sets. Methods are displayed on the x-axis and colored by method type: rule extraction method, surrogate model, or prediction model (decision tree; DT). Facet headers indicate the outcome type, with light gray denoting classification and dark gray denoting regression.

Supplementary figures: Benchmark experiment study

Root mean squared error for regression between predictions of each method and the corresponding RF across benchmark test data sets

Figure A.10. Root mean squared error (RMSE) for regression between the predictions of each method and the corresponding RF across all benchmark test data sets. Methods are displayed on the x-axis and colored by method type: rule extraction method, surrogate model, or prediction model (decision tree; DT).

Misclassification rate across benchmark test data sets

Figure A.11. Misclassification rate (MCR) for classification between the predictions of each method and the corresponding RF across all benchmark test data sets. Methods are displayed on the x-axis and colored by method type: rule extraction method, surrogate model, or prediction model (decision tree; DT).

Average proportion of variables whose use in model decisions differed between each method and the individual trees of the corresponding RF across all benchmark data sets

Figure A.12. Average proportion of variables whose use in model decisions differed between each method and the individual trees of the corresponding RF across all benchmark data sets. Methods are displayed on the x-axis and colored by method type: rule extraction method, surrogate model, or prediction model (decision tree; DT).

Number of decisions of each method across all benchmark data sets

Figure A.13. Number of decisions of each method across all benchmark data sets. Methods are displayed on the x-axis and colored by method type: rule extraction method, surrogate model, or prediction model (decision tree; DT). Facet headers indicate the outcome type, with light gray denoting classification and dark gray denoting regression. Lower values indicate greater interpretability.

Boxplots of $R^2$ for regression methods across benchmark data sets

Figure A.14. R2R^2 of each regression method across all benchmark data sets. Methods are displayed on the x-axis and colored by method type: rule extraction method, surrogate model, or prediction model (decision tree; DT).

AIC of each regression method across all benchmark data sets

Figure A.15. AIC of each regression method across all benchmark data sets. Methods are displayed on the x-axis and colored by method type: rule extraction method, surrogate model, or prediction model (decision tree; DT).

Macro F1 score of each classification method across all benchmark data sets

Figure A.16. Macro F1 score of each classification method across all benchmark data sets. Methods are displayed on the x-axis and colored by method type: rule extraction method, surrogate model, or prediction model (decision tree; DT).

CPU runtime in minutes of each method across all benchmark data sets

Figure A.17. CPU runtime in minutes of each method across all benchmark data sets. Methods are displayed on the x-axis and colored by method type: rule extraction method, surrogate model, or prediction model (decision tree; DT). Facet headers indicate the outcome type, with light gray denoting classification and dark gray denoting regression.

References

  1. [1]Aria, M., Cuccurullo, C., & Gnasso, A. (2021). A comparison among interpretative proposals for random forests. Mach. Learn. Appl., 6, Article 100094.DOI
  2. [2]Bachrach, L. K., Hastie, T., Wang, M. C., Narasimhan, B., & Marcus, R. (1999). Bone mineral acquisition in healthy asian, hispanic, black, and caucasian youth: A longitudinal study. J Clin Endocrinol Metab, 84(12), 4702–4712.
  3. [3]Banerjee, M., Ding, Y., & Noone, A.-M. (2012). Identifying representative trees from ensembles. Stat. Med., 31, 1601–1616.DOI
  4. [4]Bénard, C., Biau, G., da Veiga, S., & Scornet, E. (2021). Sirus: Stable and interpretable rule set for classification. Electron. J. Stat., 15(1), 427–505.arxiv.org/abs/1908.06852
  5. [5]Bischl, B., Casalicchio, G., Das, T., Feurer, M., Fischer, S., Gijsbers, P., Mukherjee, S., Müller, A. C., Németh, L., Oala, L., Pruucker, L., Ravi, S., van Rijn, J. N., Singh, P., Vanschoren, J., van der Velde, J., & Wever, M. (2025). Openml: Insights from 10 years and more than a thousand papers. Patterns, 6(7), Article 101317.DOI
  6. [6]Breiman, L., Friedman, J., Stone, C., & Olshen, R. (1984). Classification and regression trees. Taylor & Francis.DOI
  7. [7]Breiman, L. (2001). Random forests. Mach. Learn., 45, 5–32.
  8. [8]Deng, H. (2019). Interpreting tree ensembles with intrees. Int. J. Data Sci. Anal., 7, 277–287.arxiv.org/abs/1408.5456
  9. [9]Dunn, P. K., & Smyth, G. K. (2022). Glimsdata: Generalized linear model data sets.
  10. [10]Fokkema, M. (2020). Fitting prediction rule ensembles with r package pre. J. Stat. Softw., 92(12), 1–30.DOI
  11. [11]Friedman, J. H. (2001). Greedy function approximation: A gradient boosting machine. Ann. Stat., 29(5), 1189–1232.DOI
  12. [12]Friedman, J. H., & Popescu, B. E. (2008). Predictive learning via rule ensembles. Ann. Appl. Stat., 2, 916–954.DOI
  13. [13]Goldstein, A., Kapelner, A., Bleich, J., & Pitkin, E. (2015). Peeking inside the black box: Visualizing statistical learning with plots of individual conditional expectation. J. Comput. Graph. Stat., 24(1), 44–65.
  14. [14]Grinsztajn, L., Oyallon, E., & Varoquaux, G. (2022). Why do tree-based models still outperform deep learning on typical tabular data? Proceedings of the 36th International Conference on Neural Information Processing Systems, 507–520.
  15. [15]Guidotti, R., Monreale, A., Ruggieri, S., Turini, F., Giannotti, F., & Pedreschi, D. (2019). A survey of methods for explaining black box models. ACM Comput. Surv., 51(5), 1–42.arxiv.org/abs/1802.01933
  16. [16]Haddouchi, M., & Berrado, A. (2024, July). A survey and taxonomy of methods interpreting random forest models.arxiv.org/abs/2407.12759
  17. [17]Hastie, T., Tibshirani, R., & Friedman, J. (2009). The elements of statistical learning (2nd ed.). Springer.
  18. [18]Heinze, G., Boulesteix, A.-L., Kammer, M., Morris, T. P., & White, I. R. (2024). Phases of methodological research in biostatistics—building the evidence base for new methods. Biom. J., 66(1), Article 2200222.DOI
  19. [19]Herbinger, J., Dandl, S., Ewald, F. K., Loibl, S., & Casalicchio, G. (2024). Leveraging model-based trees as interpretable surrogate models for model distillation. In S. Nowaczyk, P. Biecek, N. C. Chung, M. Vallati, P. Skruch, J. Jaworek-Korjakowska, S. Parkinson, A. Nikitas, M. Atzmüller, T. Kliegr, U. Schmid, S. Bobek, N. Lavrac, M. Peeters, R. van Dierendonck, S. Robben, E. Mercier-Laurent, G. Kayakutlu, M. L. Owoc, . . . V. Dimitrova (Eds.), Artificial intelligence. ecai 2023 international workshops (pp. 232–249, Vol. 1947). Springer Nature Switzerland.arxiv.org/abs/2310.03112
  20. [20]Hothorn, T., Hornik, K., & Zeileis, A. (2006). Unbiased recursive partitioning: A conditional inference framework. J. Comput. Graph. Stat., 15(3), 651–674.DOI
  21. [21]Hothorn, T., & Zeileis, A. (2015). partykit: A modular toolkit for recursive partitioning in r. J. Mach. Learn. Res., 16(118), 3905–3909.
  22. [23]Johansson, U., Sönström, C., & König, R. (2014). Accurate and interpretable regression trees using oracle coaching. 2014 IEEE Symposium on Computational Intelligence and Data Mining (CIDM), 194–201.DOI
  23. [24]Johansson, U., Sönström, C., Löfström, T., & Boström, H. (2012). Obtaining accurate and comprehensible classifiers using oracle coaching. Intell. Data Anal., 16(2), 247–263.DOI
  24. [26]Kleiber, C., & Zeileis, A. (2008). Applied econometrics with r. Springer-Verlag.
  25. [27]Kursa, M., & Rudnicki, W. (2010). Feature selection with the boruta package. J. Stat. Softw., 36, 1–13.DOI
  26. [28]Laabs, B.-H., Kronziel, L. L., König, I. R., & Szymczak, S. (2024). Construction of artificial most representative trees by minimizing tree-based distance measures. In L. Longo, S. Lapuschkin, & C. Seifert (Eds.), Explainable artificial intelligence (pp. 290–310, Vol. 2154). Springer Nature Switzerland.DOI
  27. [29]Laabs, B.-H., Westenberger, A., & König, I. R. (2024). Identification of representative trees in random forests based on a new tree-based distance measure. Adv. Data Anal. Classif., 18, 363–380.DOI
  28. [30]Lang, M., Bischl, B., & Surmann, D. (2017). batchtools: Tools for r to work on batch systems. J. Open Source Softw., 2, Article 135.DOI
  29. [31]Leisch, F., & Dimitriadou, E. (2026). mlbench: Machine learning benchmark problems.
  30. [32]Liaw, A., & Wiener, M. (2002). Classification and regression by randomforest. R News, 2(3), 18–22.
  31. [33]Loh, W.-Y. (2002). Regression trees with unbiased variable selection and interaction detection. Statistica Sinica, 12(2), 361–386.
  32. [34]Loh, W.-Y. (2011). Classification and regression trees. Wiley Interdiscip. Rev. Data Min. Knowl. Discov., 1(1), 14–23.DOI
  33. [35]Loh, W.-Y., & Shih, Y.-S. (1999). Split selection methods for classification trees. Stat Sinica, 7.
  34. [36]Lundberg, S. M., & Lee, S.-I. (2017). A unified approach to interpreting model predictions. Proceedings of the 31st International Conference on Neural Information Processing Systems, 4768–4777.arxiv.org/abs/1705.07874
  35. [37]Meinshausen, N. (2010). Node harvest. Ann. Appl. Stat., 4(4), 2049–2072.
  36. [38]Meinshausen, N. (2015). Nodeharvest: Node harvest for regression and classification.
  37. [39]Molnar, C. (2022). Interpretable machine learning: A guide for making black box models explainable (2nd ed.).
  38. [40]Peters, A., & Hothorn, T. (2024). ipred: Improved predictors.
  39. [41]Renard, X., Woloszko, N., Aigrain, J., & Detyniecki, M. (2019, June). Concept tree: High-level representation of variables for more interpretable surrogate decision trees.arxiv.org/abs/1906.01297
  40. [42]Tibshirani, R. (1996). Regression shrinkage and selection via the lasso. J. R. Stat. Soc. Ser. B Methodol., 58(1), 267–288.
  41. [43]Wright, M. N., & Ziegler, A. (2017). ranger: A fast implementation of random forests for high dimensional data in C++ and R. J. Stat. Softw., 77, 1–17.DOI
  42. [44]Zeileis, A., Hothorn, T., & Hornik, K. (2008). Model-based recursive partitioning. J. Comput. Graph. Stat., 17(2), 492–514.DOI

Paper details

vlnc:W_svyqnmbg
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…
Contents