Generalizing Gain Penalization for Feature Selection in Tree-Based Models

8Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We develop a new approach for feature selection via gain penalization in tree-based models. First, we show that previous methods do not perform sufficient regularization and often exhibit sub-optimal out-of-sample performance, especially when correlated features are present. Instead, we develop a new gain penalization idea that exhibits a general local-global regularization for tree-based models. The new method allows for full fiexibility in the choice of feature-specific importance weights, while also applying a global penalization. We validate our method on both simulated and real data, exploring how the hyperparameters interact and we provide the implementation as an extension of the popular R package ranger.

Cite

CITATION STYLE

APA

Wundervald, B., Parnell, A. C., & Domijan, K. (2020). Generalizing Gain Penalization for Feature Selection in Tree-Based Models. IEEE Access, 8, 190231–190239. https://doi.org/10.1109/ACCESS.2020.3032095

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free