arrow
返回

Time varying undirected graphs

delete2010-04-27
delete147
delete
OA
AI
S
Shuheng Zhou *
J
John Lafferty
L
Larry Wasserman
DOI:10.1007/s10994-010-5180-0delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Undirected graphs are often used to describe high dimensional distributions. Under sparsity conditions, the graph can be estimated using a (1) penalization methods. However, current methods assume that the data are independent and identically distributed. If the distribution, and hence the graph, evolves over time then the data are not longer identically distributed. In this paper we develop a nonparametric method for estimating time varying graphical structure for multivariate Gaussian distributions using an a (1) regularization method, and show that, as long as the covariances change smoothly over time, we can estimate the covariance matrix well (in predictive risk) even when p is large.
Keyword:
Graph selection
l(1) regularization
High dimensional asymptotics
Risk consistency

期刊

Machine Learning 封面图
Machine Learning
IF:
2.9
论文数:
2.7K
被引数:
3.4W

机构

C
Carnegie Mellon University
学者数:
1.4W
论文数: 1.4W
被引数: 2.7W
引用论文

引用论文

A New Ceria-Zirconia Mixed Oxide Phase Based on Pyrochlore
err2004-11-01
err0
PREAI
errToshiyuki Masui; Tetsuya Ozaki; Gin-ya Adachi; Zhenchuan Kang; LeRoy Eyring
err分享
err收藏
High-dimensional graphs and variable selection with the Lasso
err2006-06-01
err2.9K
errOAAI
errMeinshausen, Nicolai; Buehlmann, Peter
err分享
err收藏
Regularized estimation of large covariance matrices
err2008-02-01
err1.0K
errOAAI
errBickel, Peter J.; Levina, Elizaveta
err分享
err收藏
Synthesis of Co-silicalite-1 from a layered silicate
err2001-05-01
err0
PREAI
errYounghee Ko; Myung Hun Kim; Sun Jin Kim; Young Sun Uh
err分享
err收藏
没有更多内容