IES-Backbone: An Interactive Edge Selection Based Backbone Method for Small World Network Visualization

Abstract

Visualization of the small world network is an excellent challenge for classic layout algorithm, which is highly connected, resulting in the shape of the hairball. Backbone extraction method can simplify the classic layout to get better visualization, and it has become a significant approach in this field. However, contemporary approaches have two primary defects. Centrality based method loses plenty of topology information, and most contemporary approaches have the problem in low interactivity due to parameter sensibility. We proposed a backbone method based on interactive edge selection (IES-Backbone) to solve two problems for small world network visualization that mentioned above. The proposed method starts with backbone extraction of the network and then apply the layout algorithm to get visualization results. A critical approach of the backbone method is edge selection, which is based on the distance between vertices layout of the binary stress model. Edge selection makes the simplified network a clear community structure feature with more topological details. The simplified network is high in homophily and has closer average path length to the original network. The visualization result is controlled by edge limit ratio r and sampling rate s. Different choices of two parameters can change the results substantially on visual without affecting the layout quality, which proves high interactivity for users. Experiments prove that IES-Backbone is an interactive visualization method that presents community and sufficient topological features. INDEX TERMS Visualization, graph layout, small world network, backbone.

TS-Extractor: large graph exploration via subgraph extraction based on topological and semantic information

“…However, in addition to increasing the computational cost of graph visualization, the escalating graph size induces visual clutter, precluding users' exploration. At the data level, some methods such as sampling (Leskovec and Faloutsos 2006), filtering (Jia et al 2008;Zhan et al 2019) and edge cutting (Edge et al 2018) can eliminate unimportant nodes or edges in a large graph to provide a more compact overview. At the visualization level, aggregating nodes or edges can reduce visual clutter to improve the readability of graph visualizations.…”

A Simple Visualization Method for Three-Dimensional (3D) Network

“…e network is a vital concept to understand modern society structure and components of the society. e concept of the network has been applied not only to people but also to social network [1][2][3][4][5][6][7], biological network [8][9][10][11][12], metabolic regulation network [13], online social network [14,15], sports social network [16,17], structure of neural network [18][19][20], etc. As a result, the data for storing network information has become complex and diverse.…”