TY - GEN
T1 - Sparse graphical modeling of piecewise-stationary time series
AU - Angelosante, Daniele
AU - Giannakis, Georgios B.
PY - 2011
Y1 - 2011
N2 - Graphical models are useful for capturing interdependencies of statistical variables in various fields. Estimating parameters describing sparse graphical models of stationary multivariate data is a major task in areas as diverse as biostatistics, econometrics, social networks, and climate data analysis. Even though time series in these applications are often non-stationary, revealing interdependencies through sparse graphs has not advanced as rapidly, because estimating such time-varying models is challenged by the curse of dimensionality and the associated complexity which is prohibitive. The goal of this paper is to introduce novel algorithms for joint segmentation and estimation of sparse, piecewise stationary, graphical models. The crux of the proposed approach is application of dynamic programming in conjunction with cost functions regularized with terms promoting the right form of sparsity in the right application domain. As a result, complexity of the novel schemes scales gracefully with the problem dimension.
AB - Graphical models are useful for capturing interdependencies of statistical variables in various fields. Estimating parameters describing sparse graphical models of stationary multivariate data is a major task in areas as diverse as biostatistics, econometrics, social networks, and climate data analysis. Even though time series in these applications are often non-stationary, revealing interdependencies through sparse graphs has not advanced as rapidly, because estimating such time-varying models is challenged by the curse of dimensionality and the associated complexity which is prohibitive. The goal of this paper is to introduce novel algorithms for joint segmentation and estimation of sparse, piecewise stationary, graphical models. The crux of the proposed approach is application of dynamic programming in conjunction with cost functions regularized with terms promoting the right form of sparsity in the right application domain. As a result, complexity of the novel schemes scales gracefully with the problem dimension.
KW - Graphical models
KW - dynamic programming
KW - segmentation
KW - sparsity
KW - statistical learning
UR - http://www.scopus.com/inward/record.url?scp=80051619040&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=80051619040&partnerID=8YFLogxK
U2 - 10.1109/ICASSP.2011.5946893
DO - 10.1109/ICASSP.2011.5946893
M3 - Conference contribution
AN - SCOPUS:80051619040
SN - 9781457705397
T3 - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
SP - 1960
EP - 1963
BT - 2011 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2011 - Proceedings
T2 - 36th IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2011
Y2 - 22 May 2011 through 27 May 2011
ER -