Graph Abstraction Based on Node Betweenness Centrality | Zendy

Arwa M. Aldabobi | Zendy; Riad Jabri | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Graph Abstraction Based on Node Betweenness Centrality

Author(s) -

Arwa M. Aldabobi,

Riad Jabri

Publication year - 2019

Publication title -

international journal of image graphics and signal processing

Language(s) - English

Resource type - Journals

eISSN - 2074-9082

pISSN - 2074-9074

DOI - 10.5815/ijigsp.2019.11.02

Subject(s) - betweenness centrality , centrality , computer science , visualization , graph , theoretical computer science , node (physics) , graph drawing , abstraction , graph layout , modularity (biology) , graph theory , complex network , data mining , mathematics , combinatorics , philosophy , structural engineering , epistemology , engineering , genetics , biology , world wide web

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research