Pages that link to "Item:Q322475"

The following pages link to Integer programming models for feature selection: new extensions and a randomized solution algorithm (Q322475):

Displaying 17 items.

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