Pruning Random Forest with Orthogonal Matching Trees - Archive ouverte HAL Access content directly
Conference Papers Year : 2020

Pruning Random Forest with Orthogonal Matching Trees


In this paper we propose a new method to reduce the size of Breiman's Random Forests. Given a Random Forest and a target size, our algorithm builds a linear combination of trees which minimizes the training error. Selected trees, as well as weights of the linear combination are obtained by mean of the Orthogonal Matching Pursuit algorithm. We test our method on many public benchmark datasets both on regression and binary classification and we compare it to other pruning techniques. Experiments show that our technique performs significantly better or equally good on many datasets 1. We also discuss the benefit and shortcoming of learning weights for the pruned forest which lead us to propose to use a non-negative constraint on the OMP weights for better empirical results.


Fichier principal
Vignette du fichier
Pruning_Random_Forest_with_Orthogonal_Matching_Trees_hal.pdf (1.28 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02534421 , version 1 (15-04-2020)


  • HAL Id : hal-02534421 , version 1


Luc Giffon, Charly Lamothe, Léo Bouscarrat, Paolo Milanesi, Farah Cherfaoui, et al.. Pruning Random Forest with Orthogonal Matching Trees., Jun 2020, Vannes, France. ⟨hal-02534421⟩
393 View
252 Download


Gmail Facebook X LinkedIn More