DCA based algorithms for feature selection in multi-class support vector machine
From MaRDI portal
Publication:513636
DOI10.1007/s10479-016-2333-yzbMath1404.68111OpenAlexW2528581397MaRDI QIDQ513636
Manh Cuong Nguyen, Hoai An Le Thi
Publication date: 7 March 2017
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-016-2333-y
Nonconvex programming, global optimization (90C26) Learning and adaptive systems in artificial intelligence (68T05)
Related Items
Alternating DCA for reduced-rank multitask linear regression with covariance matrix estimation, Convergence rate analysis of an extrapolated proximal difference-of-convex algorithm, Open issues and recent advances in DC programming and DCA, Online Learning Based on Online DCA and Application to Online Classification, DCA-based algorithms for DC fitting, DC programming and DCA: thirty years of developments, Feature importance ranking for classification in mixed online environments, A general double-proximal gradient algorithm for d.c. programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Adaptive Lasso and Its Oracle Properties
- DC approximation approaches for sparse optimization
- Exact penalty and error bounds in DC programming
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Feature extraction. Foundations and applications. Papers from NIPS 2003 workshop on feature extraction, Whistler, BC, Canada, December 11--13, 2003. With CD-ROM.
- An iterative SVM approach to feature selection and classification in high-dimensional datasets
- Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm
- A bilinear formulation for vector sparsity optimization
- Support vector machines with adaptive \(L_q\) penalty
- 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
- Variable selection for multicategory SVM via adaptive sup-norm regularization
- A DC programming approach for feature selection in support vector machines learning
- Transactions on Computational Collective Intelligence XIII
- Optimization based DC programming and DCA for hierarchical clustering
- Learning sparse classifiers with difference of convex functions algorithms
- Structured multicategory support vector machines with analysis of variance decomposition
- Sparse representations in unions of bases
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- 10.1162/153244303322753616
- 10.1162/153244303322753706
- 10.1162/153244303322753751
- Survey and Taxonomy of Feature Selection Algorithms in Intrusion Detection System
- OnL1-Norm Multiclass Support Vector Machines
- Multicategory Support Vector Machines
- Multicategory ψ-Learning
- Combined SVM-based feature selection and classification
