skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: Degree Centrality Algorithms for Homogeneous Multilayer Networks [Degree Centrality Algorithms for Homogeneous Multilayer Networks]
Award ID(s):
1955798
PAR ID:
10425695
Author(s) / Creator(s):
; ;
Editor(s):
Frans Coenen, Ana L.
Date Published:
Journal Name:
knowledge discovery and information retrieval
Page Range / eLocation ID:
51 to 62
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Measuring importance of nodes in a graph is one of the key aspects in graph analysis. Betweenness centrality (BC) measures the amount of influence that a node has over the flow of information in a graph. However, the computation complexity of calculating BC is extremely high with large-scale graphs. This is especially true when analyzing the road networks with millions of nodes and edges. In this study, we propose a deep learning architecture RoadCaps to estimate BC with sub-second latencies. RoadCaps aggregates features from neighbor nodes using Graph Convolutional Networks and estimates the node level BC by mapping low-level concept to high-level information using Capsule Networks. Our empirical benchmarks demonstrates that RoadCaps outperforms base models such as GCN and GCNFCL in both accuracy and robustness. On average, RoadCaps generates a node’s BC value in 7.5 milliseconds. 
    more » « less