mailitics

Category: Feature Selection

  • 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

  • Explained: How Does L1 Regularization Perform Feature Selection?

    Explained: How Does L1 Regularization Perform Feature Selection? Feature Selection is the process of selecting an optimal subset of features from a given set of features; an optimal feature subset is the one which maximizes the performance of the model on the given task. Feature selection can be a manual or rather explicit process when…