News Release

Visual abstraction of dynamic network via improved multi-class blue noise sampling

Peer-Reviewed Publication

Higher Education Press

: Visual Abstraction of Dynamic Network via Improved Multi-class Blue Noise Sampling

image: High school student face-to-face contact dataset. After the MCBN (b), the local block effect of some edges (see (a) ③ and ④) nearly disappear in (b) ③ and ④. After the EOD-ES (c), many invisible contact pairs in (a) with frequent communication stand out. However, numerous outliers in (a) ① and ② are lost in (c) ① and ②. (a) No Sampling; (b) The MCBN; (c) The EOD-ES; (d) After the E-MCBN sampling algorithm; (e) The distributions of the edge counts of the high school dataset before and after E-MCBN view more 

Credit: HIGHER EDUCATION PRESS LIMITED COMPANY

Massive sequence view (MSV) is a classic timeline-based dynamic network visualization approach. However, it is vulnerable to visual clutter caused by overlapping edges, thereby leading to unexpected misunderstanding of time-varying trends of network communications. Several techniques have been proposed to improve the readability of MSV. Sampling is one of the immense potential method to reduce visual clutter in MSV. The existing sampling method EOD-ES for MSV has three main disadvantages: (D1) instability of sample results with the same sampling rate, (D2) imbalance of relative densities between node pairs, and (D3) loss of outliers.

To solve the problems, a research team led by Xiaoping Fan and Ying Zhao published their new research on 15 February 2023 in Frontiers of Computer Science co-published by Higher Education Press and Springer Nature.

The team presented a new edge sampling algorithm called edge-based multi-class blue noise (E-MCBN) to make the sample result stable and balanced and preserve outliers.

In the research, they adopt an edge-based (E-) and multi-class blue noise (MCBN) based sampling scheme (E-MCBN). They reconstruct the sampling method MCBN. First, they take a node pair as an edge class and redefine the sample distances. Notably, they design an indicator called class overlap degree (COD) to measure the overlapping degree between any two classes to calculate the distance between two classes. Second, they reconstruct the conflict checks process from three aspects: (1) reordering conflict check priorities of edges by introducing a new indicator called inter-class conflict degree (CCD), (2) redefining the scope of conflict checks by identifying the maximum distance in the distance matrix, and (3) reformulating the re-sampling process of the rejected edges. Lastly, they adopt a partition sampling strategy to preserve the local high-density edges in MSV. The case study and quantitative analysis demonstrate E-MCBN can effectively reduce visual clutter and improve the readability of MSV. It can also overcome the disadvantages of the MCBN sampling (i.e., long-running and failure to preserve local high-density communication area in MSV). Future work can focus on designing more efficient methods to reduce visual clutter in MSV and other visual graphics.

###

About Frontiers of Computer Science (FCS)

FCS was launched in 2007. It is published bimonthly both online and in print by Higher Education Press (HEP) and Springer. Prof. Zhi-Hua Zhou from Nanjing University serves as the Editor-in-Chief. It aims to provide a forum for the publication of peer-reviewed papers to promote rapid communication and exchange between computer scientists. FCS covers all major branches of computer science, including: architecture, software, artificial intelligence, theoretical computer science, networks and communication, information systems, multimedia and graphics, information security, interdisciplinary, etc. The readers may be interested in the special columns "Perspective" and "Excellent Young Scholars Forum".

FCS is indexed by SCI(E), EI, DBLP, Scopus, etc. The latest IF is 2.669. FCS solicits the following article types: Review, Research Article, Letter.


Disclaimer: AAAS and EurekAlert! are not responsible for the accuracy of news releases posted to EurekAlert! by contributing institutions or for the use of any information through the EurekAlert system.