Cargando…
Multilevel Coarsening for Interactive Visualization of Large Bipartite Networks
Bipartite networks are pervasive in modeling real-world phenomena and play a fundamental role in graph theory. Interactive exploratory visualization of such networks is an important problem, and particularly challenging when handling large networks. In this paper we present results from an investiga...
Autores principales: | , , , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Frontiers Media S.A.
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9244804/ https://www.ncbi.nlm.nih.gov/pubmed/35782366 http://dx.doi.org/10.3389/frma.2022.855165 |
_version_ | 1784738604160909312 |
---|---|
author | Valejo, Alan Demétrius Baria Fabbri, Renato de Andrade Lopes, Alneu Zhao, Liang de Oliveira, Maria Cristina Ferreira |
author_facet | Valejo, Alan Demétrius Baria Fabbri, Renato de Andrade Lopes, Alneu Zhao, Liang de Oliveira, Maria Cristina Ferreira |
author_sort | Valejo, Alan Demétrius Baria |
collection | PubMed |
description | Bipartite networks are pervasive in modeling real-world phenomena and play a fundamental role in graph theory. Interactive exploratory visualization of such networks is an important problem, and particularly challenging when handling large networks. In this paper we present results from an investigation on using a general multilevel method for this purpose. Multilevel methods on networks have been introduced as a general approach to increase scalability of community detection and other complex optimization algorithms. They employ graph coarsening algorithms to create a hierarchy of increasingly coarser (reduced) approximations of an original network. Multilevel coarsening has been applied, e.g., to the problem of drawing simple (“unipartite”) networks. We build on previous work that extended multilevel coarsening to bipartite graphs to propose a visualization interface that uses multilevel coarsening to compute a multi-resolution hierarchical representation of an input bipartite network. From this hierarchy, interactive node-link drawings are displayed following a genuine route of the “overview first, zoom and filter, details on demand” visual information seeking mantra. Analysts may depart from the coarsest representation and select nodes or sub-graphs to be expanded and shown at greater detail. Besides intuitive navigation of large-scale networks, this solution affords great flexibility, as users are free to select different coarsening strategies in different scenarios. We illustrate its potential with case studies involving real networks on distinct domains. The experimental analysis shows our strategy is effective to reveal topological structures, such as communities and holes, that may remain hidden in a conventional node-link layout. It is also useful to highlight connectivity patterns across the bipartite layers, as illustrated in an example that emphasizes the correlation between diseases and genes in genetic disorders, and in a study of a scientific collaboration network of authors and papers. |
format | Online Article Text |
id | pubmed-9244804 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2022 |
publisher | Frontiers Media S.A. |
record_format | MEDLINE/PubMed |
spelling | pubmed-92448042022-07-01 Multilevel Coarsening for Interactive Visualization of Large Bipartite Networks Valejo, Alan Demétrius Baria Fabbri, Renato de Andrade Lopes, Alneu Zhao, Liang de Oliveira, Maria Cristina Ferreira Front Res Metr Anal Research Metrics and Analytics Bipartite networks are pervasive in modeling real-world phenomena and play a fundamental role in graph theory. Interactive exploratory visualization of such networks is an important problem, and particularly challenging when handling large networks. In this paper we present results from an investigation on using a general multilevel method for this purpose. Multilevel methods on networks have been introduced as a general approach to increase scalability of community detection and other complex optimization algorithms. They employ graph coarsening algorithms to create a hierarchy of increasingly coarser (reduced) approximations of an original network. Multilevel coarsening has been applied, e.g., to the problem of drawing simple (“unipartite”) networks. We build on previous work that extended multilevel coarsening to bipartite graphs to propose a visualization interface that uses multilevel coarsening to compute a multi-resolution hierarchical representation of an input bipartite network. From this hierarchy, interactive node-link drawings are displayed following a genuine route of the “overview first, zoom and filter, details on demand” visual information seeking mantra. Analysts may depart from the coarsest representation and select nodes or sub-graphs to be expanded and shown at greater detail. Besides intuitive navigation of large-scale networks, this solution affords great flexibility, as users are free to select different coarsening strategies in different scenarios. We illustrate its potential with case studies involving real networks on distinct domains. The experimental analysis shows our strategy is effective to reveal topological structures, such as communities and holes, that may remain hidden in a conventional node-link layout. It is also useful to highlight connectivity patterns across the bipartite layers, as illustrated in an example that emphasizes the correlation between diseases and genes in genetic disorders, and in a study of a scientific collaboration network of authors and papers. Frontiers Media S.A. 2022-06-16 /pmc/articles/PMC9244804/ /pubmed/35782366 http://dx.doi.org/10.3389/frma.2022.855165 Text en Copyright © 2022 Valejo, Fabbri, de Andrade Lopes, Zhao and de Oliveira. https://creativecommons.org/licenses/by/4.0/This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms. |
spellingShingle | Research Metrics and Analytics Valejo, Alan Demétrius Baria Fabbri, Renato de Andrade Lopes, Alneu Zhao, Liang de Oliveira, Maria Cristina Ferreira Multilevel Coarsening for Interactive Visualization of Large Bipartite Networks |
title | Multilevel Coarsening for Interactive Visualization of Large Bipartite Networks |
title_full | Multilevel Coarsening for Interactive Visualization of Large Bipartite Networks |
title_fullStr | Multilevel Coarsening for Interactive Visualization of Large Bipartite Networks |
title_full_unstemmed | Multilevel Coarsening for Interactive Visualization of Large Bipartite Networks |
title_short | Multilevel Coarsening for Interactive Visualization of Large Bipartite Networks |
title_sort | multilevel coarsening for interactive visualization of large bipartite networks |
topic | Research Metrics and Analytics |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9244804/ https://www.ncbi.nlm.nih.gov/pubmed/35782366 http://dx.doi.org/10.3389/frma.2022.855165 |
work_keys_str_mv | AT valejoalandemetriusbaria multilevelcoarseningforinteractivevisualizationoflargebipartitenetworks AT fabbrirenato multilevelcoarseningforinteractivevisualizationoflargebipartitenetworks AT deandradelopesalneu multilevelcoarseningforinteractivevisualizationoflargebipartitenetworks AT zhaoliang multilevelcoarseningforinteractivevisualizationoflargebipartitenetworks AT deoliveiramariacristinaferreira multilevelcoarseningforinteractivevisualizationoflargebipartitenetworks |