4.7 Article

Hierarchical Sampling for the Visualization of Large Scale-Free Graphs

相关参考文献

注意:仅列出部分参考文献,下载原文获取全部文献信息。
Article Biochemical Research Methods

Toward the assessment of predicted inter-residue distance

Zongyang Du et al.

Summary: The study proposed 19 metrics to measure the accuracy of protein distance prediction, with some metrics showing high correlation with model accuracy. Experimental results showed that the metrics largely coincided with the official version when ranking distance prediction groups in CASP14. These findings suggest that the proposed metrics are effective in measuring distance prediction.

BIOINFORMATICS (2022)

Article Computer Science, Software Engineering

Hybrid Graph Visualizations With ChordLink: Algorithms, Experiments, and Applications

Lorenzo Angori et al.

Summary: Many real-world networks have a globally sparse but locally dense structure, which poses challenges for homogeneous visualization models. This article presents ChordLink, a hybrid visualization model that combines chord diagrams and node-link diagrams to convey both the global structure and internal communities of a network. The ChordLink model allows for interactive highlighting of community structures while maintaining layout stability.

IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS (2022)

Article Computer Science, Hardware & Architecture

Accelerating Louvain community detection algorithm on graphic processing unit

Maryam Mohammadi et al.

Summary: The proposed adaptive CUDA Louvain method (ACLM) algorithm can effectively accelerate the execution time of finding communities in large graphs. ACLM utilizes shared memory and optimal thread numbers in GPU, minimizing parallelization overhead and improving calculation speed.

JOURNAL OF SUPERCOMPUTING (2021)

Article Computer Science, Software Engineering

Exemplar-based Layout Fine-tuning for Node-link Diagrams

Jiacheng Pan et al.

Summary: This paper introduces a layout fine-tuning technique for node-link diagrams that allows for exemplar-based adjustment of a group of substructures, utilizing precomputed canonical representations and on-the-fly substructure retrieval using node embedding techniques. The research includes the design of a lightweight interactive system for intuitive adjustment, modification transfer, and visual graph exploration, along with quantitative comparisons, three case studies, and a within-participant user study.

IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS (2021)

Article Computer Science, Software Engineering

Context-aware Sampling of Large Networks via Graph Representation Learning

Zhiguang Zhou et al.

Summary: This research proposes a new graph sampling method that utilizes graph representation learning to vectorize nodes in order to effectively extract and organize contextual structures in a network. The method combines a multi-objective blue noise sampling model to select a subset of nodes in the vectorized space to preserve contextual structures, while also retaining relative data and cluster densities. By designing interactive visual interfaces, users can conduct context-aware sampling, visually compare results with different sampling strategies, and deeply explore large networks.

IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS (2021)

Article Computer Science, Software Engineering

Preserving Minority Structures in Graph Sampling

Ying Zhao et al.

Summary: Sampling is a common technique used in graph reduction to speed up computations and simplify visualizations. Existing algorithms have been found to struggle in preserving important but rare minority structures in graphs. A new approach named mino-centric graph sampling (MCGS) is proposed in this research, which introduces specific algorithms and evaluation criteria to address the issue.

IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS (2021)

Article Computer Science, Software Engineering

DRGraph: An Efficient Graph Layout Algorithm for Large-scale Graphs by Dimensionality Reduction

Minfeng Zhu et al.

Summary: Efficient layout of large-scale graphs remains a challenging problem. In this paper, a new graph layout algorithm called DRGraph was introduced, which enhances the nonlinear dimensionality reduction process with three schemes. DRGraph achieves linear complexity in computation and memory consumption, and can scale up to large-scale graphs with millions of nodes.

IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS (2021)

Article Physics, Multidisciplinary

Social hierarchy promotes the cooperation prevalence

Rizhou Liang et al.

Summary: The presence of social hierarchy enhances levels of cooperation, with high-rank players acting as nucleation cores in cooperation clusters. In network structures, cooperation enhancement is maximal when hub nodes have higher social ranks.

PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS (2021)

Article Computer Science, Software Engineering

Interactive Graph Construction for Graph-Based Semi-Supervised Learning

Changjian Chen et al.

Summary: This paper introduces an interactive graph construction method to improve the performance of semi-supervised learning models, and demonstrates through two case studies how labeled and unlabeled samples can be utilized to enhance model performance.

IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS (2021)

Article Computer Science, Artificial Intelligence

Guided sampling for large graphs

Muhammad Irfan Yousuf et al.

DATA MINING AND KNOWLEDGE DISCOVERY (2020)

Article Mathematics, Applied

A Nonlinear Spectral Method for Core--Periphery Detection in Networks

Francesco Tudisco et al.

SIAM JOURNAL ON MATHEMATICS OF DATA SCIENCE (2019)

Article Computer Science, Information Systems

Exploring the limits of complexity: A survey of empirical studies on graph visualisation

Vahan Yoghourdjian et al.

VISUAL INFORMATICS (2018)

Article Computer Science, Software Engineering

Evaluation of Graph Sampling: A Visualization Perspective

Yanhong Wu et al.

IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS (2017)

Article Computer Science, Software Engineering

Proxy Graph: Visual Quality Metrics of Big Graph Sampling

Quan Hoang Nguyen et al.

IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS (2017)

Article Mathematics, Applied

Core-Periphery Structure in Networks (Revisited)

Puck Rombach et al.

SIAM REVIEW (2017)

Article Computer Science, Interdisciplinary Applications

ivga: A fast force-directed method for interactive visualization of complex networks

Witold Dzwinel et al.

JOURNAL OF COMPUTATIONAL SCIENCE (2017)

Article Telecommunications

Accurately and quickly calculating the weighted spectral distribution

Bo Jiao et al.

TELECOMMUNICATION SYSTEMS (2016)

Article Physics, Multidisciplinary

Scaling of weighted spectral distribution in deterministic scale-free networks

Bo Jiao et al.

PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS (2016)

Article Computer Science, Information Systems

Eigen-Optimization on Large Graphs by Edge Manipulation

Chen Chen et al.

ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA (2016)

Article Computer Science, Hardware & Architecture

S-BITE: A Structure-Based Internet Topology gEnerator

Giovanni Accongiagioco et al.

COMPUTER NETWORKS (2015)

Article Computer Science, Information Systems

A community-based sampling method using DPL for online social networks

Seok-Ho Yoon et al.

INFORMATION SCIENCES (2015)

Article Multidisciplinary Sciences

Random walk hierarchy measure: What is more hierarchical, a chain, a tree or a star?

Daniel Czegel et al.

SCIENTIFIC REPORTS (2015)

Article Engineering, Electrical & Electronic

Study on the stability of the topology interactive growth mechanism using graph spectra

Jiao Bo et al.

IET COMMUNICATIONS (2014)

Article Computer Science, Information Systems

Moving from social networks to social internetworking scenarios: The crawling perspective

Francesco Buccafurri et al.

INFORMATION SCIENCES (2014)

Article Computer Science, Artificial Intelligence

Intuitionistic Fuzzy Hybrid Weighted Aggregation Operators

Huchang Liao et al.

INTERNATIONAL JOURNAL OF INTELLIGENT SYSTEMS (2014)

Article Physics, Multidisciplinary

The impact of connection density on scale-free distribution in random networks

Xu-Hua Yang et al.

PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS (2013)

Article Mathematics, Interdisciplinary Applications

Structure and dynamics of core/periphery networks

Peter Csermely et al.

JOURNAL OF COMPLEX NETWORKS (2013)

Article Physics, Multidisciplinary

Hierarchy in the growing scale-free network with local rules

Peter Nather et al.

PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS (2009)

Article Computer Science, Information Systems

NETWORK TOPOLOGIES: INFERENCE, MODELING, AND GENERATION

Hamed Haddadi et al.

IEEE COMMUNICATIONS SURVEYS AND TUTORIALS (2008)

Article Physics, Multidisciplinary

A new deterministic complex network model with hierarchical structure

Mu Chen et al.

PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS (2007)

Article Computer Science, Hardware & Architecture

Sampling large Internet topologies for simulation purposes

Vaishnavi Krishnamurthy et al.

COMPUTER NETWORKS (2007)

Article Multidisciplinary Sciences

Subnets of scale-free networks are not scale-free: Sampling properties of networks

MPH Stumpf et al.

PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA (2005)

Article Physics, Multidisciplinary

Hierarchy measures in complex networks

A Trusina et al.

PHYSICAL REVIEW LETTERS (2004)

Article Telecommunications

The rich-club phenomenon in the Internet topology

S Zhou et al.

IEEE COMMUNICATIONS LETTERS (2004)

Article Physics, Multidisciplinary

Deterministic scale-free networks

AL Barabási et al.

PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS (2001)