.png){kind=icon}
返回
DC programming and DCA for sparse optimal scoring problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2015.12.068.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Linear Discriminant Analysis (LDA) is a standard tool for classification and dimension reduction in many applications. However, the problem of high dimension is still a great challenge for the classical LDA. In this paper we consider the supervised pattern classification in the high dimensional setting, in which the number of features is much larger than the number of observations and present a novel approach to the sparse optimal scoring problem using the zero-norm. The difficulty in treating the zero-norm is overcome by using appropriate continuous approximations such that the resulting problems are solved by alternating schemes based on DC (Difference of Convex functions) programming and DCA (DC Algorithms). The experimental results on both simulated and real datasets show the efficiency of the proposed algorithms compared to the five state-of-the-art methods. (C) 2016 Elsevier B.V. All rights reserved.
Keyword:
Feature selection
Linear discriminant analysis
Optimal scoring
DC programming
DCA
Alternating scheme
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
Feature selection for linear SVMs under uncertain data: Robust optimization based on difference of convex functions algorithms.png)
NEURAL NETWORKS
NEURAL NETWORKSIF6.3
PREAI
分享收藏
分享收藏
查看更多内容