Time-varying Graph Learning Based on Sparseness of Temporal Variation
Authors:
- 1 May 2019
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 5411-5415
Abstract
We propose a method for graph learning from spatiotemporal measurements. We aim at inferring time-varying graphs under the assumption that changes in graph topology and weights are sparse in time. The problem is formulated as a convex optimization problem to impose a constraint on the temporal relation of the time-varying graph. Experimental results with synthetic data show the effectiveness of our proposed method.Keywords
This publication has 23 references indexed in Scilit:
- Estimating time-varying brain connectivity networks from functional MRI time seriesNeuroImage, 2014
- Big Data Analysis with Signal Processing on Graphs: Representation and processing of massive data sets with irregular structureIEEE Signal Processing Magazine, 2014
- Proximal AlgorithmsFoundations and Trends® in Optimization, 2014
- Inference of dynamic networks using time-course dataBriefings in Bioinformatics, 2013
- Low-Rank Matrix Approximation with Manifold RegularizationIEEE Transactions on Pattern Analysis and Machine Intelligence, 2013
- A Primal–Dual Splitting Method for Convex Optimization Involving Lipschitzian, Proximable and Linear Composite TermsJournal of Optimization Theory and Applications, 2012
- Graph dual regularization non-negative matrix factorization for co-clusteringPattern Recognition, 2012
- The graphical lasso: New insights and alternativesElectronic Journal of Statistics, 2012
- Dynamic Source Routing in Ad Hoc Wireless Networks2007
- High-dimensional graphs and variable selection with the LassoThe Annals of Statistics, 2006