A DC programming approach for feature selection in support vector machines learning
From MaRDI portal
Publication:2442767
Recommendations
- DCA based algorithms for feature selection in multi-class support vector machine
- Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm
- Feature selection in SVM via polyhedral \(k\)-norm
- Double regularization methods for robust feature selection and SVM classification via DC programming
- Sparse high-dimensional fractional-norm support vector machine via DC programming
Cites work
- 10.1162/153244303322753706
- 10.1162/153244303322753751
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- A new efficient algorithm based on DC programming and DCA for clustering
- An introduction to support vector machines and other kernel-based learning methods.
- Combined SVM-based feature selection and classification
- Feature extraction. Foundations and applications. Papers from NIPS 2003 workshop on feature extraction, Whistler, BC, Canada, December 11--13, 2003. With CD-ROM.
- Feature selection via sensitivity analysis of SVM probabilistic outputs
- Gene selection for cancer classification using support vector machines
- scientific article; zbMATH DE number 5957245 (Why is no real title available?)
- scientific article; zbMATH DE number 823069 (Why is no real title available?)
- Multicategory ψ-Learning
- On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
- Optimization based DC programming and DCA for hierarchical clustering
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- Support-vector networks
- The Concave-Convex Procedure
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
Cited in
(57)- Sparse high-dimensional fractional-norm support vector machine via DC programming
- Lagrangian relaxation for SVM feature selection
- DC programming and DCA: thirty years of developments
- DC decomposition of nonconvex polynomials with algebraic techniques
- DC formulations and algorithms for sparse optimization problems
- Robust multicategory support vector machines using difference convex algorithm
- Non parametric statistical models for on-line text classification
- D.C. programming for sparse proximal support vector machines
- Stochastic DCA for minimizing a large sum of DC functions with application to multi-class logistic regression
- Intrinsic dimension estimation based on local adjacency information
- A revision of the rectangular algorithm for a class of DC optimization problems
- Group variable selection via \(\ell_{p,0}\) regularization and application to optimal scoring
- Sequential difference-of-convex programming
- Solving a class of feature selection problems via fractional 0--1 programming
- A class of semi-supervised support vector machines by DC programming
- Feature selection in SVM via polyhedral \(k\)-norm
- The modified second APG method for DC optimization problems
- An interior point method for \(L_{1 / 2}\)-SVM and application to feature selection in classification
- Binary classification via spherical separator by DC programming and DCA
- Supervised clustering of variables
- A new semi-supervised classifier based on maximum vector-angular margin
- Primal explicit max margin feature selection for nonlinear support vector machines
- DC approximation approach for \(\ell_0\)-minimization in compressed sensing
- Learning sparse classifiers with difference of convex functions algorithms
- Minimax feature selection problem for constructing a classifier using support vector machines
- DC approximation approaches for sparse optimization
- A DC programming approach for sparse linear discriminant analysis
- Feature selection for support vector machines using generalized Benders decomposition
- Feature selection combining linear support vector machines and concave optimization
- Exact penalty and error bounds in DC programming
- DCA based algorithms for feature selection in multi-class support vector machine
- Convex optimization for group feature selection in networked data
- Stochastic DCA for sparse multiclass logistic regression
- A DC programming approach for sparse estimation of a covariance matrix
- The support feature machine: classification with the least number of features and application to neuroimaging data
- Block clustering based on difference of convex functions (DC) programming and DC algorithms
- Efficient nonnegative matrix factorization by DC programming and DCA
- A robust regression framework with Laplace kernel-induced loss
- Sparse covariance matrix estimation by DCA-based algorithms
- A DC Programming Approach for Finding Communities in Networks
- Combined SVM-based feature selection and classification
- Combined SVM-based feature selection and classification
- Sparse optimization via vector \(k\)-norm and DC programming with an application to feature selection for support vector machines
- Unified SVM algorithm based on LS-DC loss
- Feature selection algorithm in classification learning using support vector machines
- Open issues and recent advances in DC programming and DCA
- DCA for Gaussian kernel support vector machines with feature selection
- Extrapolated hard thresholding algorithms with finite length for composite _0 penalized problems
- New Douglas-Rashford splitting algorithms for generalized DC programming with applications in machine learning
- Exploring the applications of DC programming in support vector machine learning
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
- Self-organizing maps by difference of convex functions optimization
- Double regularization methods for robust feature selection and SVM classification via DC programming
- Feature selection for linear SVMs under uncertain data: robust optimization based on difference of convex functions algorithms
- Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm
- New and efficient DCA based algorithms for minimum sum-of-squares clustering
This page was built for publication: A DC programming approach for feature selection in support vector machines learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2442767)
