.png){kind=icon}
返回
SPARSE ORTHOGONAL LINEAR DISCRIMINANT ANALYSIS
.png){kind=icon}
PRE
AI
DOI：10.1137/110851377.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, sparse orthogonal linear discriminant analysis (OLDA) is studied. The main contributions of the present work include the following: (i) all minimum Frobeniusnorm/dimension solutions of the optimization problem used for establishing OLDA are characterized explicitly; and (ii) this explicit characterization leads to two numerical algorithms for computing a sparse linear transformation for OLDA. The first is based on the gradient flow approach while the second is a sequential linear Bregman method. We experiment with real world datasets to illustrate that the sequential linear Bregman method is much better than the gradient flow approach. The sequential linear Bregman method always achieves comparable classification accuracy with the normal OLDA, satisfactory sparsity and orthogonality, and acceptable CPU times.
Keyword:
sparsity
linear discriminant analysis
dimensionality reduction
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
引用论文
分享收藏分享收藏SPARSE LINEAR DISCRIMINANT ANALYSIS BY THRESHOLDING FOR HIGH DIMENSIONAL DATA.png)
ANNALS OF STATISTICS
OAAI
ANNALS OF STATISTICSIF3.7
OAAI分享收藏
分享收藏分享收藏
查看更多内容