Dual adjacency matrix : exploring link groups in dense networks

K. Dinkla, N. Henry Riche, M.A. Westenberg

Research output: Contribution to journalArticleAcademicpeer-review

5 Citations (Scopus)
324 Downloads (Pure)


Node grouping is a common way of adding structure and information to networks that aids their interpretation. However, certain networks benefit from the grouping of links instead of nodes. Link communities, for example, are a form of link groups that describe high-quality overlapping node communities. There is a conceptual gap between node groups and link groups that poses an interesting visualization challenge. We introduce the Dual Adjacency Matrix to bridge this gap. This matrix combines node and link group techniques via a generalization that also enables it to be coordinated with a node-link-contour diagram. These methods have been implemented in a prototype that we evaluated with an information scientist and neuroscientist via interviews and prototype walk-throughs. We demonstrate this prototype with the analysis of a trade network and an fMRI correlation network.
Original languageEnglish
Pages (from-to)311-320
Number of pages10
JournalComputer Graphics Forum
Issue number3
Publication statusPublished - 2015


Dive into the research topics of 'Dual adjacency matrix : exploring link groups in dense networks'. Together they form a unique fingerprint.

Cite this