Feature selection for linear SVMs under uncertain data: robust optimization based on difference of convex functions algorithms
From MaRDI portal
Publication:889303
DOI10.1016/j.neunet.2014.06.011zbMath1327.90236OpenAlexW1974136583WikidataQ30838833 ScholiaQ30838833MaRDI QIDQ889303
Xuan Thanh Vo, Hoai An Le Thi, Tao Pham Dinh
Publication date: 6 November 2015
Published in: Neural Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.neunet.2014.06.011
Nonconvex programming, global optimization (90C26) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (18)
A unified DC programming framework and efficient DCA based approaches for large scale batch reinforcement learning ⋮ DC approximation approaches for sparse optimization ⋮ Difference of convex functions algorithms (DCA) for image restoration via a Markov random field model ⋮ DC programming and DCA for enhancing physical layer security via cooperative jamming ⋮ Budget constrained non-monotonic feature selection ⋮ Group variable selection via \(\ell_{p,0}\) regularization and application to optimal scoring ⋮ A proximal neurodynamic model for solving inverse mixed variational inequalities ⋮ Solving an Infinite-Horizon Discounted Markov Decision Process by DC Programming and DCA ⋮ A DC Programming Approach for Sparse Estimation of a Covariance Matrix ⋮ Sum-of-squares relaxations in robust DC optimization and feature selection ⋮ Open issues and recent advances in DC programming and DCA ⋮ Efficient Nonnegative Matrix Factorization by DC Programming and DCA ⋮ Sparse Covariance Matrix Estimation by DCA-Based Algorithms ⋮ DC programming and DCA: thirty years of developments ⋮ Feature selection with partition differentiation entropy for large-scale data sets ⋮ A new method for classifying random variables based on support vector machine ⋮ DC Approximation Approach for ℓ0-minimization in Compressed Sensing ⋮ DC Programming and DCA for a Novel Resource Allocation Problem in Emerging Area of Cooperative Physical Layer Security
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nearly unbiased variable selection under minimax concave penalty
- The Adaptive Lasso and Its Oracle Properties
- New and efficient DCA based algorithms for minimum sum-of-squares clustering
- Modelling, computation and optimization in information systems and management sciences. Second international conference MCO 2008, Metz, France - Luxembourg, September 8--10, 2008. Proceedings
- A bilinear formulation for vector sparsity optimization
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- A new efficient algorithm based on DC programming and DCA for clustering
- A DC programming approach for feature selection in support vector machines learning
- Optimization based DC programming and DCA for hierarchical clustering
- An affine scaling methodology for best basis selection
- Learning sparse classifiers with difference of convex functions algorithms
- Robust Truncated Hinge Loss Support Vector Machines
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- The Concave-Convex Procedure
- Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Nonlinear wavelet image processing: variational problems, compression, and noise removal through wavelet shrinkage
- 10.1162/153244303322753706
- 10.1162/153244303322753751
- Measurement Error in Nonlinear Models
- Multicategory ψ-Learning
- Combined SVM-based feature selection and classification
This page was built for publication: Feature selection for linear SVMs under uncertain data: robust optimization based on difference of convex functions algorithms
