.png){kind=icon}
Return
DCA based algorithms for feature selection in multi-class support vector machine
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-016-2333-y.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper addresses the problem of feature selection for Multi-class Support Vector Machines. Two models involving the (the zero norm) and the - regularizations are considered for which two continuous approaches based on DC (Difference of Convex functions) programming and DCA (DC Algorithms) are investigated. The first is DC approximation via several sparse inducing functions and the second is an exact reformulation approach using penalty techniques. Twelve versions of DCA based algorithms are developed on which empirical computational experiments are fully performed. Numerical results on real-world datasets show the efficiency and the superiority of our methods versus one of the best standard algorithms on both feature selection and classification.
Keywords:
Feature selection
MSVM
DC programming
DCA
DC approximation
Exact penalty
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.5
Papers:
8.0K
Citations:
2.1W
Organization
Cited Papers
ShareSaveShareSaveAn iterative SVM approach to feature selection and classification in high-dimensional datasets.png)
PATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
ShareSaveShareSaveShareSaveShareSave
View more