文章基本信息

标题：Graph Abstraction Based on Node Betweenness Centrality
本地全文：下载
作者：Arwa M. Aldabobi ; Riad S. Jabri
期刊名称：International Journal of Image, Graphics and Signal Processing
印刷版ISSN：2074-9074
电子版ISSN：2074-9082
出版年度：2019
卷号：11
期号：11
页码：10-17
DOI：10.5815/ijigsp.2019.11.02
出版社：MECS Publisher
摘要：There are many graph abstraction methods that are existed as solutions for problems of graphs visualization. Visualization problems include edge crossings and node occlusions that hide the potential existed patterns. The aim of this research is to abstract graphs using one of network analysis metrics which is node betweenness centrality. Betweenness centrality is calculated for all graph nodes. Graph abstraction is done by removing the nodes with their attached edges such that they have betweenness centrality lower than a certain examined threshold. Experiments have been conducted and results show that the proposed abstraction method can effectively reduce the complexity of the graph visualization in term of node degree. Modularity of clusters after filtering is decreased but the final graph visualization is simpler and more informative.
关键词：Graph abstraction;Network analysis metrics;Nodes betweenness centrality; Degree;Modularity