Pages that link to "Item:Q301699"

The following pages link to Feature subset selection for logistic regression via mixed integer optimization (Q301699):

Displaying 14 items.

• A greedy feature selection algorithm for big data of high dimensionality (Q669273) (← links)
• Logistic regression: from art to science (Q1750250) (← links)
• Convergent inexact penalty decomposition methods for cardinality-constrained problems (Q2031962) (← links)
• An effective procedure for feature subset selection in logistic regression based on information criteria (Q2044566) (← links)
• Ideal formulations for constrained convex optimization problems with indicator variables (Q2118117) (← links)
• Best subset selection via cross-validation criterion (Q2192029) (← links)
• An efficient optimization approach for best subset selection in linear regression, with application to model selection and fitting in autoregressive time-series (Q2282827) (← links)
• Investigating consumers' store-choice behavior via hierarchical variable selection (Q2324251) (← links)
• Mixed integer quadratic optimization formulations for eliminating multicollinearity based on variance inflation factor (Q2633546) (← links)
• (Q5011563) (← links)
• Sparse optimization via vector \(k\)-norm and DC programming with an application to feature selection for support vector machines (Q6051312) (← links)
• An automated exact solution framework towards solving the logistic regression best subset selection problem (Q6150320) (← links)
• Mixed-integer quadratic programming reformulations of multi-task learning models (Q6195559) (← links)
• A mixed-integer exponential cone programming formulation for feature subset selection in logistic regression (Q6491335) (← links)