Back to articles
Volume: 31 | Article ID: art00011
M-QuBE3: Querying Big Multilayer Graph by Evolutive Extraction and Exploration
  DOI :  10.2352/ISSN.2470-1173.2019.1.VDA-686  Published OnlineJanuary 2019

Although node-link representations of graphs are widespread and even sometimes preferred to other approaches, they suffer from obvious limitations when graphs become large or dense, inducing visual cluttering and impeding the traditional visual information seeking process. This article presents a new strategy of exploration particularly suitable when graphs are large and dense. Users iteratively drive the exploration through the visualization of small sub-networks of interest. Our technique is particularly useful with multilayer networks, where layers typically combine into a large and dense network. Our iterative exploration process called M-QuBE3 computes a score for each node of a graph based on structural and semantic information where more interesting nodes from a user point of view have higher scores. This in turn translates into a procedure to select sub-networks of interest. Within each sub-network, the user can select nodes to enhance the semantic context (and thus impact their interest score) and iteratively refine the exploration towards more relevant sub-networks. The M-QuBE3 process natively handles multilayer network and allows the use of layers as a semantic apparatus when driving the navigation.

Subject Areas :
Views 93
Downloads 7
 articleview.views 93
 articleview.downloads 7
  Cite this article 

Antoine Laumond, Guy Melançon, Bruno Pinaud, Mohammad Ghoniem, "M-QuBE3: Querying Big Multilayer Graph by Evolutive Extraction and Explorationin Proc. IS&T Int’l. Symp. on Electronic Imaging: Visualization and Data Analysis,  2019,  pp 686-1 - 686-11,

 Copy citation
  Copyright statement 
Copyright © Society for Imaging Science and Technology 2019
Electronic Imaging
Society for Imaging Science and Technology
7003 Kilworth Lane, Springfield, VA 22151 USA