Solving a class of feature selection problems via fractional 0--1 programming
From MaRDI portal
Publication:2241181
DOI10.1007/s10479-020-03917-wzbMath1480.90239OpenAlexW3150643611MaRDI QIDQ2241181
Oleg A. Prokopyev, Erfan Mehmanchi, Andrés Gómez
Publication date: 8 November 2021
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-020-03917-w
Applications of mathematical programming (90C90) Mixed integer programming (90C11) Fractional programming (90C32)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A generalized eigenvalues classifier with embedded feature selection
- Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
- Optimizing feature selection to improve medical diagnosis
- Fractional 0-1 programming: applications and algorithms
- Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations
- Massive datasets and machine learning for computational biomedicine: trends and challenges
- Biclustering in data mining
- Feature selection for consistent biclustering via fractional 0-1 programming
- Combinatorial Optimization with Rational Objective Functions
- Parametric approaches to fractional programs
- 10.1162/153244303322753616
- Safe Feature Elimination in Sparse Supervised Learning
- A Mixed-Integer Fractional Optimization Approach to Best Subset Selection
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- On Nonlinear Fractional Programming
- Strong Rules for Discarding Predictors in Lasso-Type Problems
- On the polynomial mixed 0-1 fractional programming problems
This page was built for publication: Solving a class of feature selection problems via fractional 0--1 programming
