Applying graph centrality metrics in visual analytics of scientific standard datasets

Jie Hua*, Mao Lin Huang, Weidong Huang, Chenglin Zhao

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

9 Citations (Scopus)
2 Downloads (Pure)

Abstract

Graphs are often used to model data with a relational structure and graphs are usually visualised into node-link diagrams for a better understanding of the underlying data. Node-link diagrams represent not only data entries in a graph, but also the relations among the data entries. Further, many graph drawing algorithms and graph centrality metrics have been successfully applied in visual analytics of various graph datasets, yet little attention has been paid to analytics of scientific standard data. This study attempts to adopt graph drawing methods (force-directed algorithms) to visualise scientific standard data and provide information with importance ‘ranking’ based on graph centrality metrics such as Weighted Degree, PageRank, Eigenvector, Betweenness and Closeness factors. The outcomes show that our method can produce clear graph layouts of scientific standard for visual analytics, along with the importance ‘ranking’ factors (represent via node colour, size etc.). Our method may assist users with tracking various relationships while understanding scientific standards with fewer relation issues (missing/wrong connection etc.) through focusing on higher priority standards.
Original languageEnglish
Article number30
Pages (from-to)1-19
Number of pages19
JournalSymmetry
Volume11
Issue number1
DOIs
Publication statusPublished - Jan 2019
Externally publishedYes

Bibliographical note

Copyright the Author(s) 2019. Version archived for private and non-commercial use with the permission of the author/s and according to publisher conditions. For further rights please contact the publisher.

Keywords

  • visual analytics
  • graph drawing
  • graph centrality metrics
  • scientific standard datasets
  • force-directed algorithms

Cite this