The following pages link to 10.1162/153244303322753751 (Q4827827):
Displaying 50 items.
- Finding causative genes from high-dimensional data: an appraisal of statistical and machine learning approaches (Q309421) (← links)
- DC approximation approaches for sparse optimization (Q319281) (← links)
- Sparse and robust normal and \(t\)-portfolios by penalized \(L_q\)-likelihood minimization (Q322443) (← links)
- Fast and scalable Lasso via stochastic Frank-Wolfe methods with a convergence guarantee (Q331671) (← links)
- Supervised classification and mathematical optimization (Q339559) (← links)
- Massively parallel feature selection: an approach based on variance preservation (Q374165) (← links)
- A majorization-minimization approach to the sparse generalized eigenvalue problem (Q413888) (← links)
- Sparse canonical correlation analysis (Q415611) (← links)
- Sparse weighted voting classifier selection and its linear programming relaxations (Q436579) (← links)
- Learning sparse gradients for variable selection and dimension reduction (Q439003) (← links)
- Feature selection for support vector machines via mixed integer linear programming (Q506302) (← links)
- DCA based algorithms for feature selection in multi-class support vector machine (Q513636) (← links)
- Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach (Q742312) (← links)
- The sparse signomial classification and regression model (Q744718) (← links)
- A theoretical understanding of self-paced learning (Q778415) (← links)
- Double regularization methods for robust feature selection and SVM classification via DC programming (Q781867) (← links)
- Mathematical optimization in classification and regression trees (Q828748) (← links)
- An iterative SVM approach to feature selection and classification in high-dimensional datasets (Q888553) (← links)
- Feature selection for linear SVMs under uncertain data: robust optimization based on difference of convex functions algorithms (Q889303) (← links)
- Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm (Q890292) (← links)
- Pruning of error correcting output codes by optimization of accuracy-diversity trade off (Q890296) (← links)
- Concave programming for minimizing the zero-norm over polyhedral sets (Q989849) (← links)
- Variable selection in kernel Fisher discriminant analysis by means of recursive feature elimina\-tion (Q1010549) (← links)
- Tracking hedge funds returns using sparse clones (Q1621921) (← links)
- Lagrangian relaxation for SVM feature selection (Q1652409) (← links)
- Budget constrained non-monotonic feature selection (Q1669185) (← links)
- Second-order optimality conditions and improved convergence results for regularization methods for cardinality-constrained optimization problems (Q1670095) (← links)
- Global convergence of proximal iteratively reweighted algorithm (Q1675580) (← links)
- High dimensional data classification and feature selection using support vector machines (Q1681156) (← links)
- Genetic algorithm versus classical methods in sparse index tracking (Q1693854) (← links)
- Assessing variable importance in clustering: a new method based on unsupervised binary decision trees (Q1729346) (← links)
- Feature elimination in kernel machines in moderately high dimensions (Q1731769) (← links)
- DC programming and DCA: thirty years of developments (Q1749443) (← links)
- A factor graph model for unsupervised feature selection (Q2004730) (← links)
- Salt and pepper noise removal based on an approximation of \(l_0\) norm (Q2006223) (← 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)
- Nonconvex and nonsmooth sparse optimization via adaptively iterative reweighted methods (Q2052389) (← links)
- D.C. programming for sparse proximal support vector machines (Q2056280) (← links)
- Subset selection for multiple linear regression via optimization (Q2182858) (← links)
- A smoothing method for sparse optimization over convex sets (Q2191281) (← links)
- Variable selection for binary classification in large dimensions: comparisons and application to microarray data (Q2197385) (← links)
- Learning modulo theories for constructive preference elicitation (Q2238637) (← links)
- Sparse optimization in feature selection: application in neuroimaging (Q2250090) (← links)
- Solving \(\ell_0\)-penalized problems with simple constraints via the Frank-Wolfe reduced dimension method (Q2257078) (← links)
- Gene expression modeling through positive Boolean functions (Q2270378) (← links)
- A sparsity driven kernel machine based on minimizing a generalization error bound (Q2270729) (← links)
- Feature selection for high-dimensional data (Q2271790) (← links)
- Feature selection in SVM via polyhedral \(k\)-norm (Q2300635) (← links)
- Un-diversifying during crises: is it a good idea? (Q2320465) (← links)
