A DC programming approach for feature selection in support vector machines learning
From MaRDI portal
Publication:2442767
DOI10.1007/s11634-008-0030-7zbMath1284.90057MaRDI QIDQ2442767
Hoai Minh Le, Hoai An Le Thi, Van Vinh Nguyen, Tao Pham Dinh
Publication date: 1 April 2014
Published in: Advances in Data Analysis and Classification. ADAC (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11634-008-0030-7
90C26: Nonconvex programming, global optimization
68T05: Learning and adaptive systems in artificial intelligence
Related Items
Stochastic DCA for Sparse Multiclass Logistic Regression, A DC Programming Approach for Sparse Estimation of a Covariance Matrix, Block Clustering Based on Difference of Convex Functions (DC) Programming and DC Algorithms, Efficient Nonnegative Matrix Factorization by DC Programming and DCA, A Robust Regression Framework with Laplace Kernel-Induced Loss, Sparse Covariance Matrix Estimation by DCA-Based Algorithms, A DC Programming Approach for Finding Communities in Networks, Sparse optimization via vector \(k\)-norm and DC programming with an application to feature selection for support vector machines, Unified SVM algorithm based on LS-DC loss, Open issues and recent advances in DC programming and DCA, DC approximation approaches for sparse optimization, Exact penalty and error bounds in DC programming, DCA based algorithms for feature selection in multi-class support vector machine, Self-organizing maps by difference of convex functions optimization, Feature selection for linear SVMs under uncertain data: robust optimization based on difference of convex functions algorithms, Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm, New and efficient DCA based algorithms for minimum sum-of-squares clustering, Sparse high-dimensional fractional-norm support vector machine via DC programming, DC programming and DCA: thirty years of developments, DC decomposition of nonconvex polynomials with algebraic techniques, DC formulations and algorithms for sparse optimization problems, Robust multicategory support vector machines using difference convex algorithm, Non parametric statistical models for on-line text classification, Stochastic DCA for minimizing a large sum of DC functions with application to multi-class logistic regression, Intrinsic dimension estimation based on local adjacency information, A revision of the rectangular algorithm for a class of DC optimization problems, Group variable selection via \(\ell_{p,0}\) regularization and application to optimal scoring, Sequential difference-of-convex programming, A class of semi-supervised support vector machines by DC programming, Feature selection in SVM via polyhedral \(k\)-norm, The modified second APG method for DC optimization problems, Binary classification via spherical separator by DC programming and DCA, Supervised clustering of variables, A new semi-supervised classifier based on maximum vector-angular margin, DC Approximation Approach for ℓ0-minimization in Compressed Sensing, Learning sparse classifiers with difference of convex functions algorithms, A DC Programming Approach for Sparse Linear Discriminant Analysis
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Feature extraction. Foundations and applications. Papers from NIPS 2003 workshop on feature extraction, Whistler, BC, Canada, December 11--13, 2003. With CD-ROM.
- Feature selection via sensitivity analysis of SVM probabilistic outputs
- On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Support-vector networks
- A new efficient algorithm based on DC programming and DCA for clustering
- Optimization based DC programming and DCA for hierarchical clustering
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- The Concave-Convex Procedure
- 10.1162/153244303322753706
- 10.1162/153244303322753751
- Multicategory ψ-Learning
- Combined SVM-based feature selection and classification
- Gene selection for cancer classification using support vector machines
