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.
Download full-text PDF |
Source |
---|---|
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC9244804 | PMC |
http://dx.doi.org/10.3389/frma.2022.855165 | DOI Listing |
Front Res Metr Anal
June 2022
Department of Computer Science, Institute of Mathematics and Computer Science, University of São Paulo, São Carlos, Brazil.
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.
View Article and Find Full Text PDFBMC Bioinformatics
July 2019
Department of Computer Science and Engineering, Seoul National University, Seoul, Korea.
Background: How can we obtain fast and high-quality clusters in genome scale bio-networks? Graph clustering is a powerful tool applied on bio-networks to solve various biological problems such as protein complexes detection, disease module detection, and gene function prediction. Especially, MCL (Markov Clustering) has been spotlighted due to its superior performance on bio-networks. MCL, however, is skewed towards finding a large number of very small clusters (size 1-3) and fails to detect many larger clusters (size 10+).
View Article and Find Full Text PDFFront Neuroinform
May 2019
Department of Radiology and BRIC, University of North Carolina, Chapel Hill, NC, United States.
Groupwise image registration tackles biases that can potentially arise from inappropriate template selection. It typically involves simultaneous registration of a cohort of images to a common space that is not specified a priori. Existing groupwise registration methods are computationally complex and are only effective for image populations without large anatomical variations.
View Article and Find Full Text PDFBr J Soc Psychol
January 2019
Department of Social and Organizational Psychology, University of Leiden, The Netherlands.
In this research, we investigate how a negative (or hostile) norm regarding minorities at the societal level can fuel polarization between majority subgroups at the local level. We hypothesize that rapid social change in the form of polarization results from the interplay between small group processes and perceptions of society at large. By employing a novel analytic approach that uses variances to capture non-linear societal change, we were able to study polarization processes.
View Article and Find Full Text PDFNeural Netw
December 2018
Centre for Information Super Highway (CISH), School of Computing, SASTRA Deemed University, Thanjavur, Tamil Nadu, India. Electronic address:
Trustworthiness is a comprehensive quality metric which is used to assess the quality of the services in service-oriented environments. However, trust prediction of cloud services based on the multi-faceted Quality of Service (QoS) attributes is a challenging task due to the complicated and non-linear relationships between the QoS values and the corresponding trust result. Recent research works reveal the significance of Artificial Neural Network (ANN) and its variants in providing a reasonable degree of success in trust prediction problems.
View Article and Find Full Text PDFEnter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!