Integer programming models for feature selection: new extensions and a randomized solution algorithm

DOI10.1016/j.ejor.2015.09.051zbMath1346.90605OpenAlexW1882502823WikidataQ57924599 ScholiaQ57924599MaRDI QIDQ322475

E. Weitschek, G. Fiscon, Giovanni Felici, Paola Bertolazzi, Paola Festa

Publication date: 7 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2015.09.051

zbMATH Keywords

heuristicsinteger programmingdata mining

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Integer programming (90C10) Learning and adaptive systems in artificial intelligence (68T05)

Related Items

A two-stage approach to the UCITS-constrained index-tracking problem ⋮ Lagrangian relaxation for SVM feature selection ⋮ The backbone method for ultra-high dimensional sparse machine learning ⋮ Selection of time instants and intervals with support vector regression for multivariate functional data ⋮ The stochastic test collection problem: models, exact and heuristic solution approaches ⋮ High dimensional data classification and feature selection using support vector machines ⋮ A mixed integer programming-based global optimization framework for analyzing gene expression data ⋮ Sparse optimization via vector \(k\)-norm and DC programming with an application to feature selection for support vector machines ⋮ Convex Optimization for Group Feature Selection in Networked Data ⋮ Cost-sensitive feature selection for support vector machines ⋮ Logical analysis of data as a tool for the analysis of probabilistic discrete choice behavior ⋮ The generalized test collection problem ⋮ A Hybrid Feature Selection Algorithm Based on Large Neighborhood Search ⋮ Evaluating and selecting features via information theoretic lower bounds of feature inner correlations for high-dimensional data ⋮ A novel embedded min-max approach for feature selection in nonlinear support vector machine classification ⋮ Optimal discretization and selection of features by association rates of joint distributions ⋮ Feature selection in SVM via polyhedral \(k\)-norm

Uses Software

• GRASP
• WEKA
• ElemStatLearn
• C4.5

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• Feature selection for support vector machines via mixed integer linear programming
• Using simulated annealing to optimize the feature selection problem in marketing applications
• Logic classification and feature selection for biomedical data
• A discrete particle swarm optimization method for feature selection in binary classification problems
• A probabilistic heuristic for a computationally difficult set covering problem
• Learning Boolean concepts in the presence of many irrelevant features
• Evaluating feature selection methods for learning in data mining applications.
• Logical analysis of binary data with missing bits
• Greedy randomized adaptive search procedures
• Multi-group support vector machines with measurement costs: A biobjective approach
• Statistical Properties of Error Estimators in Performance Assessment of Recognition Systems
• Rough set methods in feature selection and recognition
• Improvements to Platt's SMO Algorithm for SVM Classifier Design
• 10.1162/153244303322753616
• 10.1162/153244303322753670