Adjasankey: Visualization of huge hierarchical weighted and directed graphs

Abstract : Visualization of hierarchical weighted and directed graphs are usually done with node-link or adjacency matrix diagrams. However, these representations suffer from various drawbacks: low readability in a context of Big Data, high number of edge crossings, difficulty to efficiently represent the weighting. With the stated goal of reducing these drawbacks, we designed Adjasankey, a hybrid visual representation of weighted and directed graphs using hierarchical abstractions. This technique combines adjacency matrices readability of large graphs and flow diagrams visual design efficiency for weighting depiction. Associated to Big Data computing and lightweight web rendering, our tool allows to depict and interact in real time on huge dataset and supports user multi-scale exploration and analysis. To show the efficiency of Adjasankey, we present a case study on the analysis of a Customer to Customer website.
Document type :
Conference papers
Complete list of metadatas

Cited literature [21 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01189106
Contributor : Joris Sansen <>
Submitted on : Tuesday, September 1, 2015 - 11:35:33 AM
Last modification on : Tuesday, February 19, 2019 - 5:20:13 PM
Long-term archiving on : Wednesday, December 2, 2015 - 10:24:05 AM

File

adjasankey_sansen_iv2015.pdf
Files produced by the author(s)

Identifiers

Citation

Joris Sansen, Frédéric Lalanne, David Auber, Romain Bourqui. Adjasankey: Visualization of huge hierarchical weighted and directed graphs. Conference on Information Visualisation (IV'15), Jul 2015, barcelone, Spain. pp.211 - 216, ⟨10.1109/iV.2015.46⟩. ⟨hal-01189106⟩

Share

Metrics

Record views

261

Files downloads

592