Dual Adjacency Matrix: Exploring Link Groups in Dense Networks
| dc.contributor.author | Dinkla, Kasper | en_US |
| dc.contributor.author | Henry-Riche, Nathalie | en_US |
| dc.contributor.author | Westenberg, Michel A. | en_US |
| dc.contributor.editor | H. Carr, K.-L. Ma, and G. Santucci | en_US |
| dc.date.accessioned | 2015-05-22T12:51:41Z | |
| dc.date.available | 2015-05-22T12:51:41Z | |
| dc.date.issued | 2015 | en_US |
| dc.description.abstract | 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. | en_US |
| dc.description.number | 3 | en_US |
| dc.description.sectionheaders | Graphs | en_US |
| dc.description.seriesinformation | Computer Graphics Forum | en_US |
| dc.description.volume | 34 | en_US |
| dc.identifier.doi | 10.1111/cgf.12643 | en_US |
| dc.identifier.pages | 311-320 | en_US |
| dc.identifier.uri | https://doi.org/10.1111/cgf.12643 | en_US |
| dc.publisher | The Eurographics Association and John Wiley & Sons Ltd. | en_US |
| dc.subject | Computer Graphics [I.3.3] | en_US |
| dc.subject | Picture/Image Generation | en_US |
| dc.subject | Line and curve generation | en_US |
| dc.title | Dual Adjacency Matrix: Exploring Link Groups in Dense Networks | en_US |