.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Feature selection
MSVM
DC programming
DCA
DC approximation
Exact penalty
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.5
论文数:
8.0K
被引数:
2.1W
机构
引用论文
An iterative SVM approach to feature selection and classification in high-dimensional datasets.png)
PATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
分享收藏分享收藏
查看更多内容