A compound graph is a frequently encountered type of data set. Relations are given between items, and a hierarchy is defined on the items as well. We present a new method for visualizing such compound graphs. Our approach is based on visually bundling the adjacency edges, i.e., non-hierarchical edges, together. We realize this as follows. We assume that the hierarchy is shown via a standard tree visualization method. Next, we bend each adjacency edge, modeled as a B-spline curve, toward the polyline defined by the path via the inclusion edges from one node to another. This hierarchical bundling reduces visual clutter and also visualizes implicit adjacency edges between parent nodes that are the result of explicit adjacency edges between their respective child nodes. Furthermore, hierarchical edge bundling is a generic method which can be used in conjunction with existing tree visualization techniques. We illustrate our technique by providing example visualizations and discuss the results based on an informal evaluation provided by potential users of such visualizations.
Download full-text PDF |
Source |
|---|---|
| http://dx.doi.org/10.1109/TVCG.2006.147 | DOI Listing |
Publication Analysis
Top Keywords
Similar Publications
Drug toxicity prediction model based on enhanced graph neural network.
Comput Biol Med
December 2024
Faculty of Computer and AI, Cairo University, Egypt. Electronic address:
Prediction of drug toxicity remains a significant challenge and an essential process in drug discovery. Traditional machine learning algorithms struggle to capture the full scope of molecular structure features, limiting their effectiveness in toxicity prediction. Graph Neural Network offers a promising solution by effectively extracting drug features from their molecular graphs.
View Article and Find Full Text PDFEffects of clustering heterogeneity on the spectral density of sparse networks.
Phys Rev E
November 2024
Physics Institute, Federal University of Rio Grande do Sul, 91501-970 Porto Alegre, Brazil.
We derive exact equations for the spectral density of sparse networks with an arbitrary distribution of the number of single edges and triangles per node. These equations enable a systematic investigation of the effects of clustering on the spectral properties of the network adjacency matrix. In the case of heterogeneous networks, we demonstrate that the spectral density becomes more symmetric as the fluctuations in the triangle-degree sequence increase.
View Article and Find Full Text PDFIn this paper, we consider two fundamental cut approximation problems on large graphs. We prove new lower bounds for both problems that are optimal up to logarithmic factors. The first problem is to approximate cuts in balanced directed graphs.
View Article and Find Full Text PDFACLNDA: an asymmetric graph contrastive learning framework for predicting noncoding RNA-disease associations in heterogeneous graphs.
Brief Bioinform
September 2024
School of Automation Science and Engineering, Xi'an Jiaotong University, Xi'an, Shannxi 710049, China.
Noncoding RNAs (ncRNAs), including long noncoding RNAs (lncRNAs) and microRNAs (miRNAs), play crucial roles in gene expression regulation and are significant in disease associations and medical research. Accurate ncRNA-disease association prediction is essential for understanding disease mechanisms and developing treatments. Existing methods often focus on single tasks like lncRNA-disease associations (LDAs), miRNA-disease associations (MDAs), or lncRNA-miRNA interactions (LMIs), and fail to exploit heterogeneous graph characteristics.
View Article and Find Full Text PDFShortest path counting in complex networks based on powers of the adjacency matrix.
Chaos
October 2024
Department of Systems Science, Faculty of Arts and Sciences, Beijing Normal University, Zhuhai 519087, China.
Article Synopsis
- Complex networks, which consist of interconnected nodes and edges, are vital in understanding various systems in nature and society, with a focus on shortest path calculations in network science.
- The study extends the use of the adjacency matrix from counting walks to counting shortest paths, addressing the challenge of calculating both the number and length of these paths effectively.
- The proposed algorithm, tested on both synthetic and real-world networks, is significantly faster and more efficient than traditional methods, with potential applications in areas like traffic optimization and social network analysis.
Want AI Summaries of new PubMed Abstracts delivered to your In-box?
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!