DCA for Gaussian kernel support vector machines with feature selection
From MaRDI portal
Publication:6629042
DOI10.1007/978-3-030-92666-3_19MaRDI QIDQ6629042
Publication date: 29 October 2024
Cites Work
- Unnamed Item
- DC approximation approaches for sparse optimization
- Exact penalty and error bounds in DC programming
- New and efficient DCA based algorithms for minimum sum-of-squares clustering
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- An \(O(n)\) algorithm for projecting a vector on the intersection of a hyperplane and a box in \(\mathbb R^n\)
- Exact penalty in d. c. programming
- Difference of convex functions algorithms (DCA) for image restoration via a Markov random field model
- DC programming and DCA: thirty years of developments
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Group variable selection via \(\ell_{p,0}\) regularization and application to optimal scoring
- Novel DCA based algorithms for a special class of nonconvex problems with application in machine learning
- A unified DC programming framework and efficient DCA based approaches for large scale batch reinforcement learning
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- First-Order Methods in Optimization
- 10.1162/153244303322753616
- Online Learning Based on Online DCA and Application to Online Classification
- Bounds for the Spectral Radius of a Matrix
- Efficient Nonnegative Matrix Factorization by DC Programming and DCA
- A DC Programming Approach for Finding Communities in Networks
- Combined SVM-based feature selection and classification
This page was built for publication: DCA for Gaussian kernel support vector machines with feature selection
