Feature importances for scikit random forests
The scikit-learn Random Forest feature importances strategy is mean decrease in impurity (or gini importance) mechanism, which is unreliable.
To get reliable results, use permutation importance, provided in the
rfpimp package in the
src dir. Install with:
pip install rfpimp
See Beware Default Random Forest Importances for a deeper discussion of the issues surrounding feature importances in random forests (authored by Terence Parr, Kerem Turgutlu, Christopher Csiszar, and Jeremy Howard).
The mean-decrease-in-impurity importance of a feature is computed by measuring how effective the feature is at reducing uncertainty (classifiers) or variance (regressors) when creating decision trees within random forests. The problem is that this mechanism, while fast, does not always give an accurate picture of importance. Strobl et al pointed out in Bias in random forest variable importance measures: Illustrations, sources and a solution that “the variable importance measures of Breiman's original random forest method ... are not reliable in situations where potential predictor variables vary in their scale of measurement or their number of categories.”
A more reliable method is permutation importance, which measures the importance of a feature as follows. Record a baseline accuracy (classifier) or R2 score (regressor) by passing a validation set or the out-of-bag (OOB) samples through the random forest. Permute the column values of a single predictor feature and then pass all test samples back through the random forest and recompute the accuracy or R2. The importance of that feature is the difference between the baseline and the drop in overall accuracy or R2 caused by permuting the column. The permutation mechanism is much more computationally expensive than the mean decrease in impurity mechanism, but the results are more reliable.
Here's some sample Python code that uses the
rfpimp package contained in the
src directory. The data can be found in rent.csv, which is a subset of the data from Kaggle's Two Sigma Connect: Rental Listing Inquiries competition.
from rfpimp import * import pandas as pd from sklearn.ensemble import RandomForestRegressor from sklearn.model_selection import train_test_split df_orig = pd.read_csv("/Users/parrt/github/random-forest-importances/notebooks/data/rent.csv") df = df_orig.copy() # attentuate affect of outliers in price df['price'] = np.log(df['price']) df_train, df_test = train_test_split(df, test_size=0.20) features = ['bathrooms','bedrooms','longitude','latitude', 'price'] df_train = df_train[features] df_test = df_test[features] X_train, y_train = df_train.drop('price',axis=1), df_train['price'] X_test, y_test = df_test.drop('price',axis=1), df_test['price'] X_train['random'] = np.random.random(size=len(X_train)) X_test['random'] = np.random.random(size=len(X_test)) rf = RandomForestRegressor(n_estimators=100, n_jobs=-1) rf.fit(X_train, y_train) imp = importances(rf, X_test, y_test) # permutation viz = plot_importances(imp) viz.view() df_train, df_test = train_test_split(df_orig, test_size=0.20) features = ['bathrooms','bedrooms','price','longitude','latitude', 'interest_level'] df_train = df_train[features] df_test = df_test[features] X_train, y_train = df_train.drop('interest_level',axis=1), df_train['interest_level'] X_test, y_test = df_test.drop('interest_level',axis=1), df_test['interest_level'] # Add column of random numbers X_train['random'] = np.random.random(size=len(X_train)) X_test['random'] = np.random.random(size=len(X_test)) rf = RandomForestClassifier(n_estimators=100, min_samples_leaf=5, n_jobs=-1, oob_score=True) rf.fit(X_train, y_train) imp = importances(rf, X_test, y_test, n_samples=-1) viz = plot_importances(imp) viz.view()
See Feature collinearity heatmap. We can get the Spearman's correlation matrix:
The features we use in machine learning are rarely completely independent, which makes interpreting feature importance tricky. We could compute correlation coefficients, but that only identifies linear relationships. A way to at least identify if a feature, x, is dependent on other features is to train a model using x as a dependent variable and all other features as independent variables. Because random forests give us an easy out of bag error estimate, the feature dependence functions rely on random forest models. The R^2 prediction error from the model indicates how easy it is to predict feature x using the other features. The higher the score, the more dependent feature x is.
You can also get a feature dependence matrix / heatmap that returns a non-symmetric data frame where each row is the importance of each var to the row's var used as a model target. Example: