Adjasankey: Visualization of huge hierarchical weighted and directed graphs - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

Adjasankey: Visualization of huge hierarchical weighted and directed graphs

Résumé

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.
Fichier principal
Vignette du fichier
adjasankey_sansen_iv2015.pdf (610.22 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01189106 , version 1 (01-09-2015)

Identifiants

Citer

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⟩
162 Consultations
628 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More