.png){kind=icon}
Return
Sparse semi-supervised support vector machines by DC programming and DCA
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2014.11.051.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper studies the problem of feature selection in the context of Semi-Supervised Support Vector Machine (S3VM). The zero norm, a natural concept dealing with sparsity, is used for feature selection purpose. Due to two nonconvex terms (the loss function of unlabeled data and the 4 term), we are faced with a NP hard optimization problem. Two continuous approaches based on DC (Difference of Convex functions) programming and DCA (DC Algorithms) are developed. The first is DC approximation approach that approximates the e(0)-norm by a DC function. The second is an exact reformulation approach based on exact penalty techniques in DC programming. All the resulting optimization problems are DC programs for which DCA are investigated. Several usual sparse inducing functions are considered, and six versions of DCA are developed. Empirical numerical experiments on several Benchmark datasets show the efficiency of the proposed algorithms, in both feature selection and classification. (C) 2014 Elsevier B.V. All rights reserved.
Keywords:
Semi-supervised SVM
Feature selection
Non-convex optimization
DC approximation
Exact penalty
DC programming and DA
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
2.5W
Citations:
6.5W
Organization
Cited Papers
ShareSaveShareSaveFeature selection for linear SVMs under uncertain data: Robust optimization based on difference of convex functions algorithms.png)
NEURAL NETWORKS
NEURAL NETWORKSIF6.3
PREAI
ShareSave
View more