Proceedings of the SIGCHI Conference on Human Factors in Computing Systems 2013
DOI: 10.1145/2470654.2470724
|View full text |Cite
|
Sign up to set email alerts
|

Weighted graph comparison techniques for brain connectivity analysis

Abstract: The analysis of brain connectivity is a vast field in neuroscience with a frequent use of visual representations and an increasing need for visual analysis tools. Based on an in-depth literature review and interviews with neuroscientists, we explore high-level brain connectivity analysis tasks that need to be supported by dedicated visual analysis tools. A significant example of such a task is the comparison of different connectivity data in the form of weighted graphs. Several approaches have been suggested f… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

3
153
1

Year Published

2013
2013
2022
2022

Publication Types

Select...
5
2
2

Relationship

0
9

Authors

Journals

citations
Cited by 156 publications
(157 citation statements)
references
References 44 publications
3
153
1
Order By: Relevance
“…With this task, possible causes of errors are losing track of which nodes have been counted and miscounting edges. Adjacency tasks that consist of finding the most connected node have been featured in several previous studies [21,25,54,58], as have variants on this task [4,20], including our DEGREE task [26].…”
Section: S2 Factor: Tasksmentioning
confidence: 99%
See 1 more Smart Citation
“…With this task, possible causes of errors are losing track of which nodes have been counted and miscounting edges. Adjacency tasks that consist of finding the most connected node have been featured in several previous studies [21,25,54,58], as have variants on this task [4,20], including our DEGREE task [26].…”
Section: S2 Factor: Tasksmentioning
confidence: 99%
“…Also, these two tasks often reveal differences between visualization techniques when the number of nodes increases [4,26,58].…”
Section: S2 Factor: Tasksmentioning
confidence: 99%
“…They introduce a novel visual encoding for comparing different aspects of two graphs and evaluate it by means of a user study [1]. While Alper et al target 2D representations, we use stereoscopic, 3D depictions of graphs.…”
Section: Related Workmentioning
confidence: 99%
“…MatLink was found to be superior to either node-link diagram or matrix. Matrix representations in general are more efficient than weightes node-link diagrams (Alper, Bach, Henry Riche, Isenberg & Fekete, 2013). However, these studies used generic and fairly simple tasks.…”
Section: Related Workmentioning
confidence: 99%