The Greedy Boruta Algorithm: Faster Feature Selection Without Sacrificing Recall

Source: Towards Data Science

Overview

A modification to the Boruta algorithm that dramatically reduces computation while maintaining high sensitivity.

The post The Greedy Boruta Algorithm: Faster Feature Selection Without Sacrificing Recall appeared first on Towards Data Science.