arrow
返回

OPTIMAL CLASSIFICATION IN SPARSE GAUSSIAN GRAPHIC MODEL

delete2013-10-01
delete28
delete
OA
AI
F
Fan, Yingying *
J
Jin, Jiashun
Y
Yao, Zhigang
DOI:10.1214/13-AOS1163delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Consider a two-class classification problem where the number of features is much larger than the sample size. The features are masked by Gaussian noise with mean zero and covariance matrix Sigma, where the precision matrix Omega = Sigma(-1) is unknown but is presumably sparse. The useful features, also unknown, are sparse and each contributes weakly (i.e., rare and weak) to the classification decision. By obtaining a reasonably good estimate of Omega, we formulate the setting as a linear regression model. We propose a two-stage classification method where we first select features by the method of Innovated Thresholding (IT), and then use the retained features and Fisher's LDA for classification. In this approach, a crucial problem is how to set the threshold of IT. We approach this problem by adapting the recent innovation of Higher Criticism Thresholding (HCT). We find that when useful features are rare and weak, the limiting behavior of HCT is essentially just as good as the limiting behavior of ideal threshold, the threshold one would choose if the underlying distribution of the signals is known (if only). Somewhat surprisingly, when Omega is sufficiently sparse, its off-diagonal coordinates usually do not have a major influence over the classification decision. Compared to recent work in the case where Omega is the identity matrix [Proc. Natl. Acad. Sci. USA 105 (2008) 14790-14795; Philos. Trans. R. Soc. Lond. Ser. A Math. Phys. Eng. Sci. 367 (2009) 4449-4470], the current setting is much more general, which needs a new approach and much more sophisticated analysis. One key component of the analysis is the intimate relationship between HCT and Fisher's separation. Another key component is the tight large-deviation bounds for empirical processes for data with unconventional correlation structures, where graph theory on vertex coloring plays an important role.
Keyword:
Chromatic number
Fisher's LDA
Fisher's separation
phase diagram
precision matrix
rare and weak model
sparse graph
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Annals of Statistics 封面图
Annals of Statistics
IF:
3.7
论文数:
2.8K
被引数:
2.9W

机构

U
university of southern california
学者数:
4.7W
论文数: 3.8W
被引数: 51
C
Carnegie Mellon University
学者数:
1.4W
论文数: 1.4W
被引数: 2.7W
S
swiss federal institutes of technology domain
学者数:
9.0W
论文数: 8.0W
被引数: 163
学者 查看更多机构
引用论文

引用论文

SPARSE LINEAR DISCRIMINANT ANALYSIS BY THRESHOLDING FOR HIGH DIMENSIONAL DATA
err2011-04-01
err198
errOAAI
errShao, Jun; Wang, Yazhen; Deng, Xinwei; Wang, Sijian
err分享
err收藏
Estimation and confidence sets for sparse normal mixtures
err2007-12-01
err81
errOAAI
errCai, T. Tony; Jin, Jiashun; Low, Mark G.
err分享
err收藏
学者 查看更多内容