Deep Quality Score as a Feature Importance Measure for the Random Forest Algorithm

Favorite this paper
How to cite this paper?
Details
  • Presentation type: Oral Presentation and Poster (LACSC)
  • Track: LACSC
  • Keywords: Feature Importance; Machine Learning; Random Forest;
  • 1 Universidad de Valparaíso

Deep Quality Score as a Feature Importance Measure for the Random Forest Algorithm

Erika Cantor

Universidad de Valparaíso

Abstract

Feature selection is considered a complex problem to address in the statistical framework and becomes much more demanding as the number of variables increases. Thus, the methodologies for selecting and identifying important features in the random forest (RF) have been in constant evolution to better the interpretability of RF models. Among these, the minimal depth has been used as an indicator of importance "MINDepth". It considers that a variable is most important for predicting and interpreting when the minimum distance between the root node of the tree and the root of the subtree is shorter and lower than the minimal mean depth of all features. However, MINDepth does not get penalized when the feature is selected in a tree with "bad" performance. In this study, we introduce a "Deep Quality Score (DQS)" which is calculated using the error prediction.

Share your ideas or questions with the authors!

Did you know that the greatest stimulus in scientific and cultural development is curiosity? Leave your questions or suggestions to the author!

Sign in to interact

Have a question or suggestion? Share your feedback with the authors!