Feature selection for linear SVMs under uncertain data: robust optimization based on difference of convex functions algorithms
From MaRDI portal
Publication:889303
Recommendations
- A DC programming approach for feature selection in support vector machines learning
- Robust and distributionally robust optimization models for linear support vector machine
- Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm
- Support vector machine classifiers with uncertain knowledge sets via robust optimization
- Feature selection in SVM via polyhedral \(k\)-norm
Cites work
- scientific article; zbMATH DE number 5957380 (Why is no real title available?)
- scientific article; zbMATH DE number 3567782 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 3221233 (Why is no real title available?)
- 10.1162/153244303322753706
- 10.1162/153244303322753751
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- A DC programming approach for feature selection in support vector machines learning
- A bilinear formulation for vector sparsity optimization
- A new efficient algorithm based on DC programming and DCA for clustering
- An affine scaling methodology for best basis selection
- Combined SVM-based feature selection and classification
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
- Learning sparse classifiers with difference of convex functions algorithms
- Measurement Error in Nonlinear Models
- Modelling, computation and optimization in information systems and management sciences. Second international conference MCO 2008, Metz, France - Luxembourg, September 8--10, 2008. Proceedings
- Multicategory ψ-Learning
- Nearly unbiased variable selection under minimax concave penalty
- New and efficient DCA based algorithms for minimum sum-of-squares clustering
- Nonlinear wavelet image processing: variational problems, compression, and noise removal through wavelet shrinkage
- Optimization based DC programming and DCA for hierarchical clustering
- Robust Truncated Hinge Loss Support Vector Machines
- Robust optimization
- Second order cone programming approaches for handling missing and uncertain data
- The Adaptive Lasso and Its Oracle Properties
- The Concave-Convex Procedure
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Cited in
(22)- A proximal neurodynamic model for solving inverse mixed variational inequalities
- Efficient nonnegative matrix factorization by DC programming and DCA
- Sum-of-squares relaxations in robust DC optimization and feature selection
- Solving an infinite-horizon discounted Markov decision process by DC programming and DCA
- A DC programming approach for sparse estimation of a covariance matrix
- DC programming and DCA: thirty years of developments
- DC approximation approach for \(\ell_0\)-minimization in compressed sensing
- Sparse covariance matrix estimation by DCA-based algorithms
- Difference of Convex programming in adversarial SVM
- Difference of convex functions algorithms (DCA) for image restoration via a Markov random field model
- Robust optimization and data classification for characterization of Huntington disease onset via duality methods
- DC approximation approaches for sparse optimization
- DC programming and DCA for enhancing physical layer security via cooperative jamming
- Feature selection with partition differentiation entropy for large-scale data sets
- DC programming and DCA for a novel resource allocation problem in emerging area of cooperative physical layer security
- Budget constrained non-monotonic feature selection
- Open issues and recent advances in DC programming and DCA
- A unified DC programming framework and efficient DCA based approaches for large scale batch reinforcement learning
- A new method for classifying random variables based on support vector machine
- Group variable selection via \(\ell_{p,0}\) regularization and application to optimal scoring
- Feature uncertainty bounds for explicit feature maps and large robust nonlinear SVM classifiers
- Robust and distributionally robust optimization models for linear support vector machine
This page was built for publication: Feature selection for linear SVMs under uncertain data: robust optimization based on difference of convex functions algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q889303)
