Sparse high-dimensional fractional-norm support vector machine via DC programming
type: Item
instance of: scholarly article
title: Sparse high-dimensional fractional-norm support vector machine via DC programming
zbMATH Open document ID: 1471.62080
author: Wei Guan
author: Alexander Gray
published in: Computational Statistics and Data Analysis
publication date: 2018-11-02T00:00:00Z
Mathematics Subject Classification ID: 62-08
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 6970878
zbMATH Keywords: support vector machine
zbMATH Keywords: feature selection
zbMATH Keywords: fractional-norm SVM
zbMATH Keywords: difference of convex functions programming
zbMATH Keywords: reweighted \(L_1\)-norm SVM
zbMATH Keywords: low-sample-size high-dimensional data set
describes a project that uses: UCI-ml
describes a project that uses: LIBSVM
MaRDI profile type: Publication
full work available at URL: j.csda.2013.01.020
OpenAlex ID: W1994484236
cites work: On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
cites work: Generalized inverses. Theory and applications.
cites work: Enhancing sparsity by reweighted \(\ell _{1}\) minimization
cites work: Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
cites work: A feature selection Newton method for support vector machine classification
cites work: Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
cites work: 10.1162/153244303322753616
cites work: Gene selection for cancer classification using support vector machines
cites work: Asymptotics for Lasso-type estimators.
cites work: Sparse online learning via truncated gradient
cites work: A DC programming approach for feature selection in support vector machines learning
cites work: A continuous approach for the concave cost supply problem via DC programming and DCA
cites work: Support vector machines with adaptive \(L_q\) penalty
cites work: Q3546379
cites work: Combined SVM-based feature selection and classification
cites work: A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
cites work: Q4235027
cites work: Q4856771
cites work: The Concave-Convex Procedure
cites work: Surrogate maximization/minimization algorithms and extensions
cites work: One-step sparse estimates in nonconcave penalized likelihood models
DOI: 10.1016/J.CSDA.2013.01.020
Recommended article: Q4986047
Recommended article: Sparse optimization via vector \(k\)-norm and DC programming with an application to feature selection for support vector machines
Recommended article: D.C. programming for sparse proximal support vector machines
Recommended article: Q3614342
Recommended article: A DC Programming Approach for Sparse Linear Discriminant Analysis
Recommended article: Q4558508
Recommended article: On the sparseness of 1-norm support vector machines
Recommended article: Q3610675
Recommended article: A novel sparse least squares support vector machines
Recommended article: Sparse proximal support vector machine with a specialized interior-point method
description: scientific article; zbMATH DE number 6970878