Binary classification via spherical separator by DC programming and DCA
From MaRDI portal
Publication:2393067
DOI10.1007/S10898-012-9859-6zbMATH Open1275.90093OpenAlexW1966881610MaRDI QIDQ2393067FDOQ2393067
Authors: Le Thi Hoai An, H. M. Le, Huynh Van Ngai, Pham Dinh Tao 
Publication date: 7 August 2013
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-012-9859-6
Recommendations
- Classification in the multiple instance learning framework via spherical separation
- A DC programming approach for sparse linear discriminant analysis
- Binary separation and training support vector machines
- A fixed-center spherical separation algorithm with kernel transformations for classification problems
- Binary Credal Classification Under Sparsity Constraints
- Ellipsoidal separation for classification problems
- Stochastic DCA for sparse multiclass logistic regression
Cites Work
- The Concave-Convex Procedure
- 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
- DC models for spherical separation
- Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
- Variable selection in quantile regression
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- A new efficient algorithm based on DC programming and DCA for clustering
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
- A DC programming approach for feature selection in support vector machines learning
- Optimization based DC programming and DCA for hierarchical clustering
- Pattern separation by convex programming
- Ellipsoidal separation for classification problems
- A fixed-center spherical separation algorithm with kernel transformations for classification problems
- Exact \(L_{2}\)-norm plane separation
- Fuzzy clustering based on nonconvex optimisation approaches using difference of convex (DC) functions algorithms
- Solution of general linear complementarity problems via nondifferentiable concave minimization
- Title not available (Why is that?)
- An Algorithm for Separating Patterns by Ellipsoids
Cited In (17)
- Efficient nonnegative matrix factorization by DC programming and DCA
- Robust spherical separation
- A DC Programming Approach for Finding Communities in Networks
- DC models for spherical separation
- DC programming and DCA: thirty years of developments
- Partitional clustering via successive transportation problems
- Sequential difference-of-convex programming
- Difference of convex functions algorithms (DCA) for image restoration via a Markov random field model
- Spherical separation with infinitely far center
- DC approximation approaches for sparse optimization
- Semisupervised spherical separation
- Self-organizing maps by difference of convex functions optimization
- A fixed-center spherical separation algorithm with kernel transformations for classification problems
- A splitting bundle approach for non-smooth non-convex minimization
- Support vector machine polyhedral separability in semisupervised learning
- DC programming and DCA for general DC programs
- Margin maximization in spherical separation
This page was built for publication: Binary classification via spherical separator by DC programming and DCA
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2393067)
