Pages that link to "Item:Q2442767"

The following pages link to A DC programming approach for feature selection in support vector machines learning (Q2442767):

Displaying 37 items.

• DC approximation approaches for sparse optimization (Q319281) (← links)
• Exact penalty and error bounds in DC programming (Q427389) (← links)
• DCA based algorithms for feature selection in multi-class support vector machine (Q513636) (← links)
• Self-organizing maps by difference of convex functions optimization (Q736509) (← 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)
• New and efficient DCA based algorithms for minimum sum-of-squares clustering (Q898299) (← links)
• Sparse high-dimensional fractional-norm support vector machine via DC programming (Q1615094) (← links)
• DC programming and DCA: thirty years of developments (Q1749443) (← links)
• DC decomposition of nonconvex polynomials with algebraic techniques (Q1749445) (← links)
• DC formulations and algorithms for sparse optimization problems (Q1749449) (← links)
• Robust multicategory support vector machines using difference convex algorithm (Q1749454) (← links)
• Non parametric statistical models for on-line text classification (Q1928201) (← links)
• Stochastic DCA for minimizing a large sum of DC functions with application to multi-class logistic regression (Q2057761) (← links)
• Intrinsic dimension estimation based on local adjacency information (Q2127086) (← links)
• A revision of the rectangular algorithm for a class of DC optimization problems (Q2141721) (← links)
• Group variable selection via \(\ell_{p,0}\) regularization and application to optimal scoring (Q2185626) (← links)
• Sequential difference-of-convex programming (Q2198538) (← links)
• A class of semi-supervised support vector machines by DC programming (Q2256780) (← links)
• Feature selection in SVM via polyhedral \(k\)-norm (Q2300635) (← links)
• The modified second APG method for DC optimization problems (Q2311112) (← links)
• Binary classification via spherical separator by DC programming and DCA (Q2393067) (← links)
• Supervised clustering of variables (Q2418257) (← links)
• A new semi-supervised classifier based on maximum vector-angular margin (Q2628170) (← links)
• DC Approximation Approach for ℓ0-minimization in Compressed Sensing (Q2808067) (← links)
• Learning sparse classifiers with difference of convex functions algorithms (Q2867410) (← links)
• A DC Programming Approach for Sparse Linear Discriminant Analysis (Q3192955) (← links)
• Stochastic DCA for Sparse Multiclass Logistic Regression (Q5214091) (← links)
• A DC Programming Approach for Sparse Estimation of a Covariance Matrix (Q5356977) (← links)
• Block Clustering Based on Difference of Convex Functions (DC) Programming and DC Algorithms (Q5378276) (← links)
• Efficient Nonnegative Matrix Factorization by DC Programming and DCA (Q5380443) (← links)
• A Robust Regression Framework with Laplace Kernel-Induced Loss (Q5380865) (← links)
• Sparse Covariance Matrix Estimation by DCA-Based Algorithms (Q5380866) (← links)
• A DC Programming Approach for Finding Communities in Networks (Q5383809) (← links)
• Sparse optimization via vector \(k\)-norm and DC programming with an application to feature selection for support vector machines (Q6051312) (← links)
• Unified SVM algorithm based on LS-DC loss (Q6134358) (← links)
• Open issues and recent advances in DC programming and DCA (Q6200375) (← links)