Sparse plus low-rank graphical models of time series for functional connectivity in MEG

author: Rahul Nadkarni, Department of Computer Science and Engineering, University of Washington
published: Oct. 12, 2016,   recorded: August 2016,   views: 1150
Categories

Related Open Educational Resources

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.
  Bibliography

Description

Inferring graphical models from high dimensional observations has become an important problem in machine learning and statistics because of its importance in a variety of application domains. One such application is inferring functional connectivity between brain regions from neuroimaging data such as magnetoencephalograpy (MEG) recordings that produce signals with good temporal and spatial resolution. Unfortunately, existing techniques to learn graphical models that have been applied to neuroimaging data have assumed the data to be i.i.d. over time, ignoring key temporal dynamics. Additionally, the signals that arise from neuroimaging data do not exist in isolation as the brain is performing many tasks simultaneously so that most existing methods can introduce spurious connections. We address these issues by introducing a method to learn Gaussian graphical models between multiple time series with latent processes. In addition, we allow for heterogeneity between different groups of MEG recordings by using a hierarchical penalty. The proposed methods are formulated as convex optimization problems that we efficiently solve by developing an alternating directions method of multipliers algorithm. We evaluate the proposed model on synthetic data as well as on global stock index returns and a real MEG data set.

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: