Dynamic graph learning: A structure-driven approach
Artikel i vetenskaplig tidskrift, 2021

The purpose of this paper is to infer a dynamic graph as a global (collective) model of time-varying measurements at a set of network nodes. This model captures both pairwise as well as higher order interactions (i.e., more than two nodes) among the nodes. The motivation of this work lies in the search for a connectome model which properly captures brain functionality across all regions of the brain, and possibly at individual neurons. We formulate it as an optimization problem, a quadratic objective functional and tensor information of observed node signals over short time intervals. The proper regularization constraints reflect the graph smoothness and other dynamics involving the underlying graph’s Laplacian, as well as the time evolution smoothness of the underlying graph. The resulting joint optimization is solved by a continuous relaxation of the weight parameters and an introduced novel gradient-projection scheme. While the work may be applicable to any time-evolving data set (e.g., fMRI), we apply our algorithm to a real-world dataset comprising recorded activities of individual brain cells. The resulting model is shown to be not only viable but also efficiently computable.

Graph signal processing

Dynamic graph learning

Sparse signal

Convex optimization


Bo Jiang

North Carolina State University

Yuming Huang

North Carolina State University

Ashkan Panahi

Chalmers, Data- och informationsteknik, Data Science

Yiyi Yu

University of California

Hamid Krim

North Carolina State University

Spencer L. Smith

University of California


22277390 (eISSN)

Vol. 9 2 1-20 168



Bioinformatik (beräkningsbiologi)




Mer information

Senast uppdaterat