A novel centrality-based method for visual analytics of small-world networks

Chun-Cheng Lin, Weidong Huang, Wan Yu Liu*, Sheng Feng Wu

*此作品的通信作者

研究成果: Article同行評審

10 引文 斯高帕斯(Scopus)

摘要

Abstract: Nowadays, the network data that we need to deal with and make sense of are becoming increasingly large and complex. Small-world networks are a type of complex networks whose underling graphs have small diameter, shorter average path length between nodes, and a high degree of clustering structures and can be found in a wide range of scientific fields, including social networks, sociology, computer science, business intelligence, and biology. However, conventional visualization algorithms for small-work networks lead to a uniform clump of nodes or are restricted to a tree structure, making the network structure difficult to identify and analyze. This work provides a new visual analytical method to improve the situation. Different from previous methods based on spanning trees, this method first generates a weighted planar sub-network based on the measurement of network centrality metrics. A force-directed algorithm based on node-edge repulsion is then applied to visualize this sub-network into a proper layout for better understanding of the data. Finally, the remaining links are placed back to maintain the original network’s integrity. The experimental results show that compared to previous methods, the proposed method can be more effective in differentiating clusters and revealing relationship patterns among individual nodes and clusters in the network. Furthermore, the proposed method is applied to a data of the semiconductor wafer manufacturing industry as a case study. The work shows that this new approach allows users to gain useful insights into the data. Graphic abstract: [Figure not available: see fulltext.].

原文English
頁(從 - 到)973-990
頁數18
期刊Journal of Visualization
22
發行號5
DOIs
出版狀態Published - 1 10月 2019

指紋

深入研究「A novel centrality-based method for visual analytics of small-world networks」主題。共同形成了獨特的指紋。

引用此