An improved branch \& bound algorithm in feature selection
From MaRDI portal
An improved branch \& bound algorithm in feature selection
Recommendations
- Evaluation of the branch and bound algorithm for feature selection
- scientific article; zbMATH DE number 4114104
- An improvement on floating search algorithms for feature subset selection
- An efficient binary gradient-based optimizer for feature selection
- On a class of computationally efficient feature selection criteria
- Investigation and improvement of feature selection method
Cited in
(7)- U-curve: a branch-and-bound optimization algorithm for U-shaped cost functions on Boolean lattices applied to the feature selection problem
- Feature selection using stochastic approximation with Barzilai and Borwein non-monotone gains
- Branch \& Bound algorithm with partial prediction for use with recursive and non-recursive criterion forms
- Evaluation of the branch and bound algorithm for feature selection
- scientific article; zbMATH DE number 4114104 (Why is no real title available?)
- Notes on the evolution of feature selection methodology
- On prediction mechanisms in fast branch \& bound algorithms
This page was built for publication: An improved branch \& bound algorithm in feature selection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4427034)