Feature selection for classification models via bilevel optimization
From MaRDI portal
Publication:1734837
Recommendations
Cites work
- 10.1162/153244303322753643
- A dynamic programming algorithm for the bilevel Knapsack problem
- A hybrid tabu-ascent algorithm for the linear bilevel programming problem
- A new approach for solving linear bilevel problems using genetic algorithms
- A note on genetic algorithms for large-scale feature selection
- A simple tabu search method to solve the mixed-integer linear bilevel programming problem
- A value-function-based exact approach for the bilevel mixed-integer programming problem
- Algorithm 909: NOMAD: nonlinear optimization with the MADS algorithm
- Algorithms for solving the mixed integer two-level linear programming problem
- An overview of bilevel optimization
- Bilevel programming with knapsack constraints
- Classification and disease prediction via mathematical programming
- Classification model selection via bilevel programming
- Classification of splice-junction DNA sequences using multi-objective genetic-fuzzy optimization techniques
- Descent approaches for quadratic bilevel programming
- Discrete linear bilevel programming problem
- Foundations of bilevel programming
- Gene selection for cancer classification using support vector machines
- Genetic algorithm based on simplex method for solving linear-quadratic bilevel programming problem
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 6438182 (Why is no real title available?)
- Linear bilevel programming solution by genetic algorithm
- Links between linear bilevel and mixed 0-1 programming problems
- Multilevel optimization: algorithms and applications
- New Branch-and-Bound Rules for Linear Bilevel Programming
- On bilevel programming. I: General nonlinear cases
- Practical bilevel optimization. Algorithms and applications
- Sparse group Lasso and high dimensional multinomial classification
- Support-vector networks
- The bilevel knapsack problem with stochastic right-hand sides
- The Linear-Quadratic Bilevel Programming Problem
- The Mixed Integer Linear Bilevel Programming Problem
- The steepest descent direction for the nonlinear bilevel programming problem
- The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem
- Wrappers for feature subset selection
Cited in
(11)- A novel embedded min-max approach for feature selection in nonlinear support vector machine classification
- SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs
- Optimization-based feature selection with adaptive instance sampling
- Feature selection using stochastic approximation with Barzilai and Borwein non-monotone gains
- scientific article; zbMATH DE number 5305393 (Why is no real title available?)
- Bilevel optimization: theory, algorithms, applications and a bibliography
- Classification model selection via bilevel programming
- Initialization of Feature Selection Search for Classification
- Metaheuristics for bilevel optimization: a comprehensive review
- On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs
- Optimizing feature selection to improve medical diagnosis
This page was built for publication: Feature selection for classification models via bilevel optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1734837)
