arXiv Analytics

Sign in

arXiv:1911.02728 [stat.ML]AbstractReferencesReviewsResources

Auto-encoding graph-valued data with applications to brain connectomes

Meimei Liu, Zhengwu Zhang, David B. Dunson

Published 2019-11-07Version 1

Our interest focuses on developing statistical methods for analysis of brain structural connectomes. Nodes in the brain connectome graph correspond to different regions of interest (ROIs) while edges correspond to white matter fiber connections between these ROIs. Due to the high-dimensionality and non-Euclidean nature of the data, it becomes challenging to conduct analyses of the population distribution of brain connectomes and relate connectomes to other factors, such as cognition. Current approaches focus on summarizing the graph using either pre-specified topological features or principal components analysis (PCA). In this article, we instead develop a nonlinear latent factor model for summarizing the brain graph in both unsupervised and supervised settings. The proposed approach builds on methods for hierarchical modeling of replicated graph data, as well as variational auto-encoders that use neural networks for dimensionality reduction. We refer to our method as Graph AuTo-Encoding (GATE). We compare GATE with tensor PCA and other competitors through simulations and applications to data from the Human Connectome Project (HCP).

Related articles: Most relevant | Search more
arXiv:1209.3079 [stat.ML] (Published 2012-09-14)
Signal Recovery in Unions of Subspaces with Applications to Compressive Imaging
arXiv:1806.08301 [stat.ML] (Published 2018-06-21)
Online Saddle Point Problem with Applications to Constrained Online Convex Optimization
arXiv:1904.08548 [stat.ML] (Published 2019-04-18)
A New Class of Time Dependent Latent Factor Models with Applications