Feature selection for linear SVMs under uncertain data: robust optimization based on difference of convex functions algorithms
type: Item
instance of: scholarly article
title: Feature selection for linear SVMs under uncertain data: robust optimization based on difference of convex functions algorithms
zbMATH Open document ID: 1327.90236
author: X. T. Vo
author: Le Thi Hoai An
author: Pham Dinh Tao
published in: Neural Networks
publication date: 2015-11-06T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 6505397
zbMATH Keywords: feature selection
zbMATH Keywords: svm
zbMATH Keywords: robust optimization
zbMATH Keywords: DC programming
zbMATH Keywords: dca
Wikidata QID: Q30838833
describes a project that uses: UCI-ml
MaRDI profile type: Publication
full work available at URL: j.neunet.2014.06.011
OpenAlex ID: W1974136583
cites work: Q3182207
cites work: Measurement Error in Nonlinear Models
cites work: Nonlinear wavelet image processing: variational problems, compression, and noise removal through wavelet shrinkage
cites work: Q3093412
cites work: Q4139463
cites work: Q5510744
cites work: Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
cites work: A new efficient algorithm based on DC programming and DCA for clustering
cites work: A DC programming approach for feature selection in support vector machines learning
cites work: Optimization based DC programming and DCA for hierarchical clustering
cites work: New and efficient DCA based algorithms for minimum sum-of-squares clustering
cites work: Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
cites work: The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
cites work: Multicategory ψ-Learning
cites work: Combined SVM-based feature selection and classification
cites work: Learning sparse classifiers with difference of convex functions algorithms
cites work: A bilinear formulation for vector sparsity optimization
cites work: Convex analysis approach to d. c. programming: Theory, algorithms and applications
cites work: A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
cites work: 10.1162/153244303322753706
cites work: An affine scaling methodology for best basis selection
cites work: Q3093392
cites work: Modelling, computation and optimization in information systems and management sciences. Second international conference MCO 2008, Metz, France - Luxembourg, September 8--10, 2008. Proceedings
cites work: Q4864293
cites work: 10.1162/153244303322753751
cites work: Robust Truncated Hinge Loss Support Vector Machines
cites work: The Concave-Convex Procedure
cites work: Nearly unbiased variable selection under minimax concave penalty
cites work: The Adaptive Lasso and Its Oracle Properties
DBLP publication ID: journals/nn/ThiVD14
DOI: 10.1016/J.NEUNET.2014.06.011
description: scientific article; zbMATH DE number 6505397