arrow
返回

Graph Neural Networks for Fast Node Ranking Approximation

delete2021-05-10
delete31
delete
OA
AI
S
Sunil Kumar Maurya *
X
Xin Liu
T
Tsuyoshi Murata
DOI:10.1145/3446217delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Graphs arise naturally in numerous situations, including social graphs, transportation graphs, web graphs, protein graphs, etc. One of the important problems in these settings is to identify which nodes are important in the graph and how they affect the graph structure as a whole. Betweenness centrality and closeness centrality are two commonly used node ranking measures to find out influential nodes in the graphs in terms of information spread and connectivity. Both of these are considered as shortest path based measures as the calculations require the assumption that the information flows between the nodes via the shortest paths. However, exact calculations of these centrality measures are computationally expensive and prohibitive, especially for large graphs. Although researchers have proposed approximation methods, they are either less efficient or suboptimal or both. We propose the first graph neural network (GNN) based model to approximate betweenness and closeness centrality. In GNN, each node aggregates features of the nodes in multihop neighborhood. We use this feature aggregation scheme to model paths and learn how many nodes are reachable to a specific node. We demonstrate that our approach significantly outperforms current techniques while taking less amount of time through extensive experiments on a series of synthetic and real-world datasets. A benefit of our approach is that the model is inductive, which means it can be trained on one set of graphs and evaluated on another set of graphs with varying structures. Thus, the model is useful for both static graphs and dynamic graphs.
Keyword:
Betweenness centrality
closeness centrality
graph neural networks (GNNs)
node ranking
dynamic graphs
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

ACM Transactions on Knowledge Discovery from Data 封面图
ACM Transactions on Knowledge Discovery from Data
IF:
4.8
论文数:
1.3K
被引数:
4.4K

机构

I
Institute of Science Tokyo
学者数:
3.2W
论文数: 2.7W
被引数: 117
T
Tokyo Institute of Technology
学者数:
1.1W
论文数: 9.0K
被引数: 1.9W
引用论文

引用论文

err
IF0
err
err0
PREAI
err
err分享
err收藏
Central Auditory Processing, MRI Morphometry and Brain Laterality: Applications to Dyslexia
err2009-10-12
err0
PREAI
errKenneth Hugdahl; Einar Heiervang; Helge Nordby; Alf Inge Smievoll; Helmuth Steinmetz; Jim Stevenson; Anders Lund
err分享
err收藏
err
IF0
err
err0
PREAI
err
err分享
err收藏
Ranking in evolving complex networks
err2017-05-01
err188
errOAAI
errLiao, Hao; Mariani, Manuel Sebastian; Medo, Matus; Zhang, Yi-Cheng; Zhou, Ming-Yang
err分享
err收藏
Biologically Inspired Soft Robot for Thumb Rehabilitation1
err2014-04-28
err0
PREAI
errPaxton Maeder-York; Tyler Clites; Emily Boggs; Ryan Neff; Panagiotis Polygerinos; Dónal Holland; Leia Stirling; Kevin Galloway; Catherine Wee; Conor Walsh
err分享
err收藏
Stromal fibers in oral squamous cell carcinoma: A possible new prognostic indicator?
err2016-01-01
err0
errOAAI
errPriyanka Kardam; Monica Mehendiratta; Shweta Rehani; Madhumani Kumra; Khushboo Sahay; Kanu Jain
err分享
err收藏
学者 查看更多内容