2006
DOI: 10.1109/tvcg.2006.160
|View full text |Cite
|
Sign up to set email alerts
|

MatrixExplorer: a Dual-Representation System to Explore Social Networks

Abstract: MatrixExplorer is a network visualization system that uses two representations: node-link diagrams and matrices. Its design comes from a list of requirements formalized after several interviews and a participatory design session conducted with social science researchers. Although matrices are commonly used in social networks analysis, very few systems support the matrix-based representations to visualize and analyze networks. MatrixExplorer provides several novel features to support the exploration of social n… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
185
0
2

Year Published

2007
2007
2013
2013

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 230 publications
(187 citation statements)
references
References 24 publications
0
185
0
2
Order By: Relevance
“…Beyond these domain-specific design requirements, we determined that common network-related analysis tasks such as those identified in the taxonomy [30] and exemplified in systems such as Vizster [21], SocialAction [36], and MatrixExplorer [22] should be supported. Furthermore, adopting the "Search, Show Context, Expand on Demand" design model [44] seemed appropriate for the system.…”
Section: Design Requirementsmentioning
confidence: 99%
“…Beyond these domain-specific design requirements, we determined that common network-related analysis tasks such as those identified in the taxonomy [30] and exemplified in systems such as Vizster [21], SocialAction [36], and MatrixExplorer [22] should be supported. Furthermore, adopting the "Search, Show Context, Expand on Demand" design model [44] seemed appropriate for the system.…”
Section: Design Requirementsmentioning
confidence: 99%
“…The community has studied this problem at length. In [16], a comprehensive survey on automatic vertex order is included. In general, binary, undirected graphs are the most straightforward.…”
Section: The Interactive Approachmentioning
confidence: 99%
“…In addition, to let users decide about uncertainty issues, we would like to avoid taking a threshold at this stage of processing due to possible information loss. This makes it hard to directly leverage existing vertex reordering algorithms like those surveyed by Mueller [25] or Henry et al [16].…”
Section: A Clutter-free Interface For Graph Abstractionmentioning
confidence: 99%
“…Adjacency matrix representations, such as the MatrixExplorer (Henry & Fekete, 2006) and the Matrix Browser (Ziegler, Kunz, & Botsch, 2002), show relationships between items, typically link relationships between nodes in a graph. These adjacency matrices are of order n x n for an n node graph.…”
Section: Related Workmentioning
confidence: 99%