Tag: greedy
-
The Greedy Boruta Algorithm: Faster Feature Selection Without Sacrificing Recall
The Greedy Boruta Algorithm: Faster Feature Selection Without Sacrificing Recall 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. Nicolas Vana Go to original source
-
3 Greedy Algorithms for Decision Trees, Explained with Examples
3 Greedy Algorithms for Decision Trees, Explained with Examples Learn the inner workings of decision trees The post 3 Greedy Algorithms for Decision Trees, Explained with Examples appeared first on Towards Data Science. Kuriko Iwai Go to original source