Dataset Information

Graffinity: Visualizing Connectivity in Large Graphs.

ABSTRACT: Multivariate graphs are prolific across many fields, including transportation and neuroscience. A key task in graph analysis is the exploration of connectivity, to, for example, analyze how signals flow through neurons, or to explore how well different cities are connected by flights. While standard node-link diagrams are helpful in judging connectivity, they do not scale to large networks. Adjacency matrices also do not scale to large networks and are only suitable to judge connectivity of adjacent nodes. A key approach to realize scalable graph visualization are queries: instead of displaying the whole network, only a relevant subset is shown. Query-based techniques for analyzing connectivity in graphs, however, can also easily suffer from cluttering if the query result is big enough. To remedy this, we introduce techniques that provide an overview of the connectivity and reveal details on demand. We have two main contributions: (1) two novel visualization techniques that work in concert for summarizing graph connectivity; and (2) Graffinity, an open-source implementation of these visualizations supplemented by detail views to enable a complete analysis workflow. Graffinity was designed in a close collaboration with neuroscientists and is optimized for connectomics data analysis, yet the technique is applicable across domains. We validate the connectivity overview and our open-source tool with illustrative examples using flight and connectomics data.

SUBMITTER: Kerzner E

PROVIDER: S-EPMC5821473 | biostudies-literature | 2017 Jun

REPOSITORIES: biostudies-literature

ACCESS DATA

Publications

Graffinity: Visualizing Connectivity in Large Graphs.

Kerzner E E Lex A A Sigulinsky C L CL Umess T T Jones B W BW Marc R E RE Meyer M M

Computer graphics forum : journal of the European Association for Computer Graphics 20170601 3

Multivariate graphs are prolific across many fields, including transportation and neuroscience. A key task in graph analysis is the exploration of connectivity, to, for example, analyze how signals flow through neurons, or to explore how well different cities are connected by flights. While standard node-link diagrams are helpful in judging connectivity, they do not scale to large networks. Adjacency matrices also do not scale to large networks and are only suitable to judge connectivity of adja ...[more]

PMID: 29479126

Similar Datasets

Project description:Deep neural network models (DNNs) are essential to modern AI and provide powerful models of information processing in biological neural networks. Researchers in both neuroscience and engineering are pursuing a better understanding of the internal representations and operations that undergird the successes and failures of DNNs. Neuroscientists additionally evaluate DNNs as models of brain computation by comparing their internal representations to those found in brains. It is therefore essential to have a method to easily and exhaustively extract and characterize the results of the internal operations of any DNN. Many models are implemented in PyTorch, the leading framework for building DNN models. Here we introduce TorchLens, a new open-source Python package for extracting and characterizing hidden-layer activations in PyTorch models. Uniquely among existing approaches to this problem, TorchLens has the following features: (1) it exhaustively extracts the results of all intermediate operations, not just those associated with PyTorch module objects, yielding a full record of every step in the model's computational graph, (2) it provides an intuitive visualization of the model's complete computational graph along with metadata about each computational step in a model's forward pass for further analysis, (3) it contains a built-in validation procedure to algorithmically verify the accuracy of all saved hidden-layer activations, and (4) the approach it uses can be automatically applied to any PyTorch model with no modifications, including models with conditional (if-then) logic in their forward pass, recurrent models, branching models where layer outputs are fed into multiple subsequent layers in parallel, and models with internally generated tensors (e.g., injections of noise). Furthermore, using TorchLens requires minimal additional code, making it easy to incorporate into existing pipelines for model development and analysis, and useful as a pedagogical aid when teaching deep learning concepts. We hope this contribution will help researchers in AI and neuroscience understand the internal representations of DNNs.

Project description:Highlights: Hamming Distance is applied to distinguish the difference of functional connectivity networkThe orientations of sources are testified to influence the scalp Functional Connectivity Graph (FCG) from different references significantlyREST, the reference electrode standardization technique, is proved to have an overall stable and excellent performance in variable situations. The choice of an electroencephalograph (EEG) reference is a practical issue for the study of brain functional connectivity. To study how EEG reference influence functional connectivity estimation (FCE), this study compares the differences of FCE resulting from the different references such as REST (the reference electrode standardization technique), average reference (AR), linked mastoids (LM), and left mastoid references (LR). Simulations involve two parts. One is based on 300 dipolar pairs, which are located on the superficial cortex with a radial source direction. The other part is based on 20 dipolar pairs. In each pair, the dipoles have various orientation combinations. The relative error (RE) and Hamming distance (HD) between functional connectivity matrices of ideal recordings and that of recordings obtained with different references, are metrics to compare the differences of the scalp functional connectivity graph (FCG) derived from those two kinds of recordings. Lower RE and HD values imply more similarity between the two FCGs. Using the ideal recording (IR) as a standard, the results show that AR, LM and LR perform well only in specific conditions, i.e., AR performs stable when there is no upward component in sources' orientation. LR achieves desirable results when the sources' locations are away from left ear. LM achieves an indistinct difference with IR, i.e., when the distribution of source locations is symmetric along the line linking the two ears. However, REST not only achieves excellent performance for superficial and radial dipolar sources, but also achieves a stable and robust performance with variable source locations and orientations. Benefitting from the stable and robust performance of REST vs. other reference methods, REST might best recover the real FCG of EEG. Thus, REST based FCG may be a good candidate to compare the FCG of EEG based on different references from different labs.

Project description:Functional connectivity concerns the correlated activity between neuronal populations in spatially segregated regions of the brain, which may be studied using functional magnetic resonance imaging (fMRI). This coupled activity is conveniently expressed using covariance, but this measure fails to distinguish between direct and indirect effects. A popular alternative that addresses this issue is partial correlation, which regresses out the signal of potentially confounding variables, resulting in a measure that reveals only direct connections. Importantly, provided the data are normally distributed, if two variables are conditionally independent given all other variables, their respective partial correlation is zero. In this paper, we propose a probabilistic generative model that allows us to estimate functional connectivity in terms of both partial correlations and a graph representing conditional independencies. Simulation results show that this methodology is able to outperform the graphical LASSO, which is the de facto standard for estimating partial correlations. Furthermore, we apply the model to estimate functional connectivity for twenty subjects using resting-state fMRI data. Results show that our model provides a richer representation of functional connectivity as compared to considering partial correlations alone. Finally, we demonstrate how our approach can be extended in several ways, for instance to achieve data fusion by informing the conditional independence graph with data from probabilistic tractography. As our Bayesian formulation of functional connectivity provides access to the posterior distribution instead of only to point estimates, we are able to quantify the uncertainty associated with our results. This reveals that while we are able to infer a clear backbone of connectivity in our empirical results, the data are not accurately described by simply looking at the mode of the distribution over connectivity. The implication of this is that deterministic alternatives may misjudge connectivity results by drawing conclusions from noisy and limited data.

Dataset Information

Graffinity: Visualizing Connectivity in Large Graphs.

Publications

Graffinity: Visualizing Connectivity in Large Graphs.

Similar Datasets

OmicsDI is part of the ELIXIR infrastructure

Tweets