Scalable Clustering of Correlated Time Series using Expectation Propagation

author: Christopher Aicher, Department of Statistics, University of Washington
published: Oct. 12, 2016,   recorded: August 2016,   views: 1143

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.


We are interested in finding clusters of time series such that series within a cluster are correlated and series between clusters are independent. Existing Bayesian methods for inferring correlated clusters of time series either: (i) require conditioning on latent variables to decouple time series, but results in slow mixing or (ii) require calculating a collapsed likelihood, but with computation scaling cubically with the number of time series per cluster. To infer the latent cluster assignments efficiently, we consider approximate methods that trade exactness for scalability. Our main contribution is the development of an expectation propagation based approximation for the collapsed likelihood approach. Our empirical results on synthetic data show our methods scale linearly instead of cubically, while maintaining competitive accuracy.

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: