{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,23]],"date-time":"2026-10-23T20:29:43Z","timestamp":1792787383167,"version":"4.5.0"},"reference-count":76,"publisher":"Association for Computing Machinery (ACM)","issue":"5","license":[{"start":{"date-parts":[[2021,5,10]],"date-time":"2021-05-10T00:00:00Z","timestamp":1620604800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-sa\/4.0\/"}],"funder":[{"name":"JSPS Grant-In-Aid for Scientific Research","award":["17H01785"],"award-info":[{"award-number":["17H01785"]}]},{"name":"JST CREST","award":["JPMJCR1687"],"award-info":[{"award-number":["JPMJCR1687"]}]},{"name":"JSPS Grant-In-Aid for Early-Career Scientists","award":["19K20352"],"award-info":[{"award-number":["19K20352"]}]},{"DOI":"10.13039\/501100003051","name":"The New Energy and Industrial Technology Development Organization","doi-asserted-by":"crossref","award":["NEDO"],"award-info":[{"award-number":["NEDO"]}],"id":[{"id":"10.13039\/501100003051","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2021,10,31]]},"abstract":"<jats:p>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.<\/jats:p>\n                  <jats:p>Source code is available at https:\/\/github.com\/sunilkmaurya\/GNN_Ranking<\/jats:p>","DOI":"10.1145\/3446217","type":"journal-article","created":{"date-parts":[[2021,5,10]],"date-time":"2021-05-10T18:24:14Z","timestamp":1620671054000},"page":"1-32","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":62,"title":["Graph Neural Networks for Fast Node Ranking Approximation"],"prefix":"10.1145","volume":"15","author":[{"given":"Sunil Kumar","family":"Maurya","sequence":"first","affiliation":[{"name":"Tokyo Institute of Technology, Meguro, Tokyo, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xin","family":"Liu","sequence":"additional","affiliation":[{"name":"AIRC, AIST, Koto-ku, Tokyo, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tsuyoshi","family":"Murata","sequence":"additional","affiliation":[{"name":"Tokyo Institute of Technology, Meguro, Tokyo, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,5,10]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Directed hypergraphs: Introduction and fundamental algorithm: A survey. Theoretical Computer Science 658, Part B","author":"Ausiello Giorgio","year":"2016","unstructured":"Giorgio Ausiello and Luigi Laura . 2016. Directed hypergraphs: Introduction and fundamental algorithm: A survey. Theoretical Computer Science 658, Part B ( 2016 ), 293--306. DOI:https:\/\/doi.org\/10.1016\/j.tcs.2016.03.016 Giorgio Ausiello and Luigi Laura. 2016. Directed hypergraphs: Introduction and fundamental algorithm: A survey. Theoretical Computer Science 658, Part B (2016), 293--306. DOI:https:\/\/doi.org\/10.1016\/j.tcs.2016.03.016"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1121\/1.1906679"},{"key":"e_1_2_1_3_1","first-page":"16","article-title":"A mathematical model for group structures","volume":"7","author":"Bavelas Alex","year":"1948","unstructured":"Alex Bavelas . 1948 . A mathematical model for group structures . Applied Anthropology 7 , 3 (1948), 16 -- 30 . DOI:https:\/\/doi.org\/10.17730\/humo.7.3.f4033344851gl053 Alex Bavelas. 1948. A mathematical model for group structures. Applied Anthropology 7, 3 (1948), 16--30. DOI:https:\/\/doi.org\/10.17730\/humo.7.3.f4033344851gl053","journal-title":"Applied Anthropology"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1002\/bs.3830100205"},{"key":"e_1_2_1_5_1","unstructured":"Rianne van den Berg Thomas Kipf and Max Welling. 2017. Graph convolutional matrix completion. arXiv:1706.02263. Retrieved from https:\/\/arxiv.org\/abs\/1706.02263  Rianne van den Berg Thomas Kipf and Max Welling. 2017. Graph convolutional matrix completion. arXiv:1706.02263. Retrieved from https:\/\/arxiv.org\/abs\/1706.02263"},{"key":"e_1_2_1_6_1","volume-title":"Proceedings of the 17th Workshop on Algorithm\u00a0Engineering and Experiments. Society for Industrial and Applied Mathematics, 133--146","author":"Bergamini E.","year":"1973","unstructured":"E. Bergamini , H. Meyerhenke , and C. Staudt . 2015. Approximating betweenness centrality in large evolving networks . In Proceedings of the 17th Workshop on Algorithm\u00a0Engineering and Experiments. Society for Industrial and Applied Mathematics, 133--146 . DOI:https:\/\/doi.org\/10.1137\/1.978161 1973 754.12 E. Bergamini, H. Meyerhenke, and C. Staudt. 2015. Approximating betweenness centrality in large evolving networks. In Proceedings of the 17th Workshop on Algorithm\u00a0Engineering and Experiments. Society for Industrial and Applied Mathematics, 133--146. DOI:https:\/\/doi.org\/10.1137\/1.9781611973754.12"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3284359"},{"key":"e_1_2_1_8_1","first-page":"112","article-title":"Centrality and AIDS","volume":"18","author":"Borgatti Stephen P.","year":"1995","unstructured":"Stephen P. Borgatti . 1995 . Centrality and AIDS . Connections 18 , 1 (1995), 112 -- 115 . Stephen P. Borgatti. 1995. Centrality and AIDS. Connections 18, 1 (1995), 112--115.","journal-title":"Connections"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2004.11.008"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218127407018403"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"e_1_2_1_13_1","volume-title":"The hidden geometry of complex, network-driven contagion phenomena. Science 342, 6164","author":"Brockmann Dirk","year":"2013","unstructured":"Dirk Brockmann and Dirk Helbing . 2013. The hidden geometry of complex, network-driven contagion phenomena. Science 342, 6164 ( 2013 ), 1337--1342. DOI:https:\/\/doi.org\/10.1126\/science.1245200 Dirk Brockmann and Dirk Helbing. 2013. The hidden geometry of complex, network-driven contagion phenomena. Science 342, 6164 (2013), 1337--1342. DOI:https:\/\/doi.org\/10.1126\/science.1245200"},{"key":"e_1_2_1_15_1","volume-title":"ICML Workshop, Theoretical Foundations and Applications of Deep Generative Models.","author":"Cao Nicola De","year":"2018","unstructured":"Nicola De Cao and Thomas Kipf . 2018 . MolGAN: An implicit generative model for small molecular graphs . In ICML Workshop, Theoretical Foundations and Applications of Deep Generative Models. Retrieved from https:\/\/arxiv.org\/abs\/1805.11973 Nicola De Cao and Thomas Kipf. 2018. MolGAN: An implicit generative model for small molecular graphs. In ICML Workshop, Theoretical Foundations and Applications of Deep Generative Models. Retrieved from https:\/\/arxiv.org\/abs\/1805.11973"},{"key":"e_1_2_1_16_1","volume-title":"Proceedings of AAAI conference on Artificial Intelligence 34 (2019","author":"Chen Deli","year":"2019","unstructured":"Deli Chen , Yankai Lin , Wei Li , Peng Li , Jie Zhou , and Xu Sun . 2019 . Measuring and relieving the over-smoothing problem for graph neural networks from the topological view . Proceedings of AAAI conference on Artificial Intelligence 34 (2019 ), 3438--3445. Retrieved from http:\/\/arxiv.org\/abs\/ 1909.03211 Deli Chen, Yankai Lin, Wei Li, Peng Li, Jie Zhou, and Xu Sun. 2019. Measuring and relieving the over-smoothing problem for graph neural networks from the topological view. Proceedings of AAAI conference on Artificial Intelligence 34 (2019), 3438--3445. Retrieved from http:\/\/arxiv.org\/abs\/1909.03211"},{"key":"e_1_2_1_17_1","volume-title":"Proceedings of the International Conference on Learning Representations.","author":"Chen Jie","year":"2018","unstructured":"Jie Chen , Tengfei Ma , and Cao Xiao . 2018 . FastGCN: Fast learning with graph convolutional networks via importance sampling . In Proceedings of the International Conference on Learning Representations. Retrieved from https:\/\/openreview.net\/forum?id=rytstxWAW&noteId=ByU9EpGSf. Jie Chen, Tengfei Ma, and Cao Xiao. 2018. FastGCN: Fast learning with graph convolutional networks via importance sampling. In Proceedings of the International Conference on Learning Representations. Retrieved from https:\/\/openreview.net\/forum?id=rytstxWAW&noteId=ByU9EpGSf."},{"key":"e_1_2_1_18_1","volume-title":"Proceedings of theAdvances in Neural Information Processing Systems 22","author":"Chen Wei","year":"2009","unstructured":"Wei Chen , Tie-yan Liu, Yanyan Lan , Zhi-ming Ma, and Hang Li . 2009 . Ranking measures and loss functions in learning to rank . In Proceedings of theAdvances in Neural Information Processing Systems 22 , Y. Bengio, D. Schuurmans, J. D. Lafferty, C. K. I. Williams, and A. Culotta (Eds.). Curran Associates, Inc., 315--323. Retrieved from http:\/\/papers.nips.cc\/paper\/3708-ranking-measures-and-loss-functions-in-learning-to-rank.pdf. Wei Chen, Tie-yan Liu, Yanyan Lan, Zhi-ming Ma, and Hang Li. 2009. Ranking measures and loss functions in learning to rank. In Proceedings of theAdvances in Neural Information Processing Systems 22, Y. Bengio, D. Schuurmans, J. D. Lafferty, C. K. I. Williams, and A. Culotta (Eds.). Curran Associates, Inc., 315--323. Retrieved from http:\/\/papers.nips.cc\/paper\/3708-ranking-measures-and-loss-functions-in-learning-to-rank.pdf."},{"key":"e_1_2_1_19_1","volume-title":"Proceedings of the 2nd ACM Conference on Online Social Networks . ACM, 37--50","author":"Cohen Edith","unstructured":"Edith Cohen , Daniel Delling , Thomas Pajor , and Renato F. Werneck . 2014. Computing classic closeness centrality, at scale . In Proceedings of the 2nd ACM Conference on Online Social Networks . ACM, 37--50 . DOI:https:\/\/doi.org\/10.1145\/2660460.2660465 Edith Cohen, Daniel Delling, Thomas Pajor, and Renato F. Werneck. 2014. Computing classic closeness centrality, at scale. In Proceedings of the 2nd ACM Conference on Online Social Networks . ACM, 37--50. DOI:https:\/\/doi.org\/10.1145\/2660460.2660465"},{"key":"e_1_2_1_20_1","unstructured":"Gabriele Corso Luca Cavalleri Dominique Beaini Pietro Li\u00f2 and Petar Veli\u010dkovi\u0107. 2020. Principal neighbourhood aggregation for graph nets. In Advances in Neural Processing Systems 33 (NeurIPS'20).  Gabriele Corso Luca Cavalleri Dominique Beaini Pietro Li\u00f2 and Petar Veli\u010dkovi\u0107. 2020. Principal neighbourhood aggregation for graph nets. In Advances in Neural Processing Systems 33 (NeurIPS'20)."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155354"},{"key":"e_1_2_1_22_1","unstructured":"Micha\u00ebl Defferrard Xavier Bresson and Pierre Vandergheynst. 2016. Convolutional neural networks on graphs with fast localized spectral filtering. arxiv:1606.09375 Retrieved from http:\/\/arxiv.org\/abs\/1606.09375  Micha\u00ebl Defferrard Xavier Bresson and Pierre Vandergheynst. 2016. Convolutional neural networks on graphs with fast localized spectral filtering. arxiv:1606.09375 Retrieved from http:\/\/arxiv.org\/abs\/1606.09375"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1002\/asi.21171"},{"key":"e_1_2_1_24_1","volume-title":"Proceedings of the 28th International Conference on Neural Information Processing Systems -","volume":"2","author":"Duvenaud David K.","unstructured":"David K. Duvenaud , Dougal Maclaurin , Jorge Iparraguirre , Rafael Bombarell , Timothy Hirzel , Alan Aspuru-Guzik , and Ryan P. Adams . 2015. Convolutional networks on graphs for learning molecular fingerprints . In Proceedings of the 28th International Conference on Neural Information Processing Systems - Volume 2 . 2224--2232. Reterieved from http:\/\/papers.nips.cc\/paper\/5954-convolutional-networks-on-graphs-for-learning-molecular-fingerprints.pdf. David K. Duvenaud, Dougal Maclaurin, Jorge Iparraguirre, Rafael Bombarell, Timothy Hirzel, Alan Aspuru-Guzik, and Ryan P. Adams. 2015. Convolutional networks on graphs for learning molecular fingerprints. In Proceedings of the 28th International Conference on Neural Information Processing Systems - Volume 2. 2224--2232. Reterieved from http:\/\/papers.nips.cc\/paper\/5954-convolutional-networks-on-graphs-for-learning-molecular-fingerprints.pdf."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/HIPC.2010.5713180"},{"key":"e_1_2_1_26_1","volume-title":"Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 228--229","author":"Eppstein David","year":"2001","unstructured":"David Eppstein and Joseph Wang . 2001 . Fast approximation of centrality . In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 228--229 . Retrieved from http:\/\/dl.acm.org\/citation.cfm?id=365411.365449. David Eppstein and Joseph Wang. 2001. Fast approximation of centrality. In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 228--229. Retrieved from http:\/\/dl.acm.org\/citation.cfm?id=365411.365449."},{"key":"e_1_2_1_27_1","unstructured":"Federico Errica Marco Podda Davide Bacciu and Alessio Micheli. 2019. A fair comparison of graph neural networks for graph classification. arXiv:1912.09893.  Federico Errica Marco Podda Davide Bacciu and Alessio Micheli. 2019. A fair comparison of graph neural networks for graph classification. arXiv:1912.09893."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3357979"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1953122.1953146"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(78)90021-7"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.2307\/3033543"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/2791204.2791213"},{"key":"e_1_2_1_33_1","volume-title":"Proceedings of the 34th International Conference on Machine Learning -","volume":"70","author":"Gilmer Justin","unstructured":"Justin Gilmer , Samuel S. Schoenholz , Patrick F. Riley , Oriol Vinyals , and George E. Dahl . 2017. Neural message passing for quantum chemistry . In Proceedings of the 34th International Conference on Machine Learning - Volume 70 . 1263--1272. Retrieved from http:\/\/dl.acm.org\/citation.cfm?id=3305381.3305512. Justin Gilmer, Samuel S. Schoenholz, Patrick F. Riley, Oriol Vinyals, and George E. Dahl. 2017. Neural message passing for quantum chemistry. In Proceedings of the 34th International Conference on Machine Learning - Volume 70. 1263--1272. Retrieved from http:\/\/dl.acm.org\/citation.cfm?id=3305381.3305512."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1137\/140976649"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/SocialCom-PASSAT.2012.37"},{"key":"e_1_2_1_36_1","volume-title":"Proceedings of the 7th Python in Science Conference. 11--15","author":"Hagberg Aric A.","unstructured":"Aric A. Hagberg , Daniel A. Schult , and Pieter J. Swart . 2008. Exploring network structure, dynamics, and function using NetworkX . In Proceedings of the 7th Python in Science Conference. 11--15 . Aric A. Hagberg, Daniel A. Schult, and Pieter J. Swart. 2008. Exploring network structure, dynamics, and function using NetworkX. In Proceedings of the 7th Python in Science Conference. 11--15."},{"key":"e_1_2_1_37_1","volume-title":"Proceedings of the 31st International Conference on Neural Information Processing Systems","author":"Hamilton Will","unstructured":"Will Hamilton , Zhitao Ying , and Jure Leskovec . 2017. Inductive representation learning on large graphs . In Proceedings of the 31st International Conference on Neural Information Processing Systems . I. Guyon, U. V. Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, and R. Garnett (Eds.), ACM, 1024--1034. Retrieved from http:\/\/papers.nips.cc\/paper\/6703-inductive-representation-learning-on-large-graphs.pdf. Will Hamilton, Zhitao Ying, and Jure Leskovec. 2017. Inductive representation learning on large graphs. In Proceedings of the 31st International Conference on Neural Information Processing Systems. I. Guyon, U. V. Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, and R. Garnett (Eds.), ACM, 1024--1034. Retrieved from http:\/\/papers.nips.cc\/paper\/6703-inductive-representation-learning-on-large-graphs.pdf."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850578.2850580"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293883.3295729"},{"key":"e_1_2_1_40_1","volume-title":"Proceedings of the 24th Symposium on Principles and Practice of Parallel Programming. 272-286","author":"Hu Weihua","year":"2019","unstructured":"Weihua Hu , Bowen Liu , Joseph Gomes , Marinka Zitnik , Percy Liang , Vijay Pande , and Jure Leskovec . 2019 . Pre-training graph neural networks . In Proceedings of the 24th Symposium on Principles and Practice of Parallel Programming. 272-286 Weihua Hu, Bowen Liu, Joseph Gomes, Marinka Zitnik, Percy Liang, Vijay Pande, and Jure Leskovec. 2019. Pre-training graph neural networks. In Proceedings of the 24th Symposium on Principles and Practice of Parallel Programming. 272-286"},{"key":"e_1_2_1_41_1","volume-title":"Proceedings of the 2010 IEEE International Symposium on Parallel Distributed Processing. 1--7. DOI:https:\/\/doi.org\/10","author":"Jin S.","year":"2010","unstructured":"S. Jin , Z. Huang , Y. Chen , D. Chavarr\u00eda-Miranda , J. Feo , and P. C. Wong . 2010. A novel application of parallel betweenness centrality to power grid contingency analysis . In Proceedings of the 2010 IEEE International Symposium on Parallel Distributed Processing. 1--7. DOI:https:\/\/doi.org\/10 .1109\/IPDPS. 2010 .5470400 S. Jin, Z. Huang, Y. Chen, D. Chavarr\u00eda-Miranda, J. Feo, and P. C. Wong. 2010. A novel application of parallel betweenness centrality to power grid contingency analysis. In Proceedings of the 2010 IEEE International Symposium on Parallel Distributed Processing. 1--7. DOI:https:\/\/doi.org\/10.1109\/IPDPS.2010.5470400"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1155\/JBB.2005.96"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2492517.2492533"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/30.1-2.81"},{"key":"e_1_2_1_45_1","volume-title":"International Conference on Learning Representation (ICLR'17)","author":"Thomas","unstructured":"Thomas N. Kipf and Max Welling. 2016. Semi-supervised classification with graph convolutional networks . In International Conference on Learning Representation (ICLR'17) . Thomas N. Kipf and Max Welling. 2016. Semi-supervised classification with graph convolutional networks. In International Conference on Learning Representation (ICLR'17)."},{"key":"e_1_2_1_46_1","volume-title":"Proceedings of the 2016 IEEE 32nd International Conference on Data Engineering. 1580--1581","author":"Kourtellis N.","year":"2016","unstructured":"N. Kourtellis , G. De Francisci Morales, and F. Bonchi. 2016. Scalable online betweenness centrality in evolving graphs . In Proceedings of the 2016 IEEE 32nd International Conference on Data Engineering. 1580--1581 . DOI:https:\/\/doi.org\/10.1109\/ICDE. 2016 .7498421 N. Kourtellis, G. De Francisci Morales, and F. Bonchi. 2016. Scalable online betweenness centrality in evolving graphs. In Proceedings of the 2016 IEEE 32nd International Conference on Data Engineering. 1580--1581. DOI:https:\/\/doi.org\/10.1109\/ICDE.2016.7498421"},{"key":"e_1_2_1_47_1","volume-title":"Linearization of dependency and sampling for participation-based betweenness centrality in very large B-hypergraphs. ACM Transactions on Knowledge Discovery from Data 14, 3","author":"Lee Kwang Hee","year":"2020","unstructured":"Kwang Hee Lee and Myoung Ho Kim . 2020. Linearization of dependency and sampling for participation-based betweenness centrality in very large B-hypergraphs. ACM Transactions on Knowledge Discovery from Data 14, 3 ( 2020 ), 25:1\u201325:41. DOI:https:\/\/doi.org\/10.1145\/3375399 Kwang Hee Lee and Myoung Ho Kim. 2020. Linearization of dependency and sampling for participation-based betweenness centrality in very large B-hypergraphs. ACM Transactions on Knowledge Discovery from Data 14, 3 (2020), 25:1\u201325:41. DOI:https:\/\/doi.org\/10.1145\/3375399"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187884"},{"key":"e_1_2_1_49_1","volume-title":"International Conference on Machine Learning.","author":"Li Yujia","unstructured":"Yujia Li , Oriol Vinyals , Chris Dyer , Razvan Pascanu , and Peter W. Battaglia . 2018. Learning deep generative models of graphs . In International Conference on Machine Learning. Yujia Li, Oriol Vinyals, Chris Dyer, Razvan Pascanu, and Peter W. Battaglia. 2018. Learning deep generative models of graphs. In International Conference on Machine Learning."},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2017.05.001"},{"key":"e_1_2_1_51_1","volume-title":"Proceedings of the International Conference on Learning Representations.","author":"Loukas Andreas","year":"2019","unstructured":"Andreas Loukas . 2019 . What graph neural networks cannot learn: Depth vs width . In Proceedings of the International Conference on Learning Representations. Andreas Loukas. 2019. What graph neural networks cannot learn: Depth vs width. In Proceedings of the International Conference on Learning Representations."},{"key":"e_1_2_1_52_1","unstructured":"Haggai Maron Heli Ben-Hamu Hadar Serviansky and Yaron Lipman. 2020. Provably powerful graph networks. In Advances in Neural Processing Systems 32 (NeurIPS'19).  Haggai Maron Heli Ben-Hamu Hadar Serviansky and Yaron Lipman. 2020. Provably powerful graph networks. In Advances in Neural Processing Systems 32 (NeurIPS'19)."},{"key":"e_1_2_1_53_1","volume-title":"Proceedings of the 28th ACM International Conference on Information and Knowledge Management. ACM, 2149--2152","author":"Maurya Sunil K.","year":"2019","unstructured":"Sunil K. Maurya , Xin Liu , and Tsuyoshi Murata . 2019 . Fast approximations of betweenness centrality using graph neural networks . In Proceedings of the 28th ACM International Conference on Information and Knowledge Management. ACM, 2149--2152 . Sunil K. Maurya, Xin Liu, and Tsuyoshi Murata. 2019. Fast approximations of betweenness centrality using graph neural networks. In Proceedings of the 28th ACM International Conference on Information and Knowledge Management. ACM, 2149--2152."},{"key":"e_1_2_1_54_1","volume-title":"Dynamics on and of Complex Networks, Volume 2: Applications to Time-Varying Dynamical Systems","author":"Medo Matus","unstructured":"Matus Medo . 2013. Network-based information filtering algorithms: Ranking and recommendation . In Dynamics on and of Complex Networks, Volume 2: Applications to Time-Varying Dynamical Systems , Animesh Mukherjee, Monojit Choudhury, Fernando Peruani, Niloy Ganguly, and Bivas Mitra (Eds.). Springer , New York , 315--334. DOI:https:\/\/doi.org\/10.1007\/978-1-4614-6729-8_16 Matus Medo. 2013. Network-based information filtering algorithms: Ranking and recommendation. In Dynamics on and of Complex Networks, Volume 2: Applications to Time-Varying Dynamical Systems, Animesh Mukherjee, Monojit Choudhury, Fernando Peruani, Niloy Ganguly, and Bivas Mitra (Eds.). Springer, New York, 315--334. DOI:https:\/\/doi.org\/10.1007\/978-1-4614-6729-8_16"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.5555\/1025132.1026332"},{"key":"e_1_2_1_56_1","volume-title":"Proceedings of the 32nd AAAI Conference on Artificial Intelligence. DOI:https:\/\/doi.org\/10","author":"Morris Christopher","year":"2018","unstructured":"Christopher Morris , Martin Ritzert , Matthias Fey , William L. Hamilton , Jan Eric Lenssen , Gaurav Rattan , and Martin Grohe . 2018 . Weisfeiler and leman go neural: Higher-order graph neural networks . In Proceedings of the 32nd AAAI Conference on Artificial Intelligence. DOI:https:\/\/doi.org\/10 .1609\/aaai.v33i01.33014602 Christopher Morris, Martin Ritzert, Matthias Fey, William L. Hamilton, Jan Eric Lenssen, Gaurav Rattan, and Martin Grohe. 2018. Weisfeiler and leman go neural: Higher-order graph neural networks. In Proceedings of the 32nd AAAI Conference on Artificial Intelligence. DOI:https:\/\/doi.org\/10.1609\/aaai.v33i01.33014602"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2004.11.009"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44448-3"},{"key":"e_1_2_1_59_1","volume-title":"Enzo Ferrante, Matthew Lee, Ricardo Guerrerro Moreno, Ben Glocker, and Daniel Rueckert.","author":"Parisot Sarah","year":"2017","unstructured":"Sarah Parisot , Sofia Ira Ktena , Enzo Ferrante, Matthew Lee, Ricardo Guerrerro Moreno, Ben Glocker, and Daniel Rueckert. 2017 . Spectral graph convolutions for population-based disease prediction. In Proceedings of the International Conference on Medical Image Computing and Computer-Assisted Intervention, Maxime Descoteaux, Lena Maier-Hein, Alfred Franz, Pierre Jannin, D. Louis Collins, and Simon Duchesne (Eds.). Lecture Notes in Computer Science, Springer International Publishing , 177--185. DOI:https:\/\/doi.org\/10.1007\/978-3-319-66179-7_21 Sarah Parisot, Sofia Ira Ktena, Enzo Ferrante, Matthew Lee, Ricardo Guerrerro Moreno, Ben Glocker, and Daniel Rueckert. 2017. Spectral graph convolutions for population-based disease prediction. In Proceedings of the International Conference on Medical Image Computing and Computer-Assisted Intervention, Maxime Descoteaux, Lena Maier-Hein, Alfred Franz, Pierre Jannin, D. Louis Collins, and Simon Duchesne (Eds.). Lecture Notes in Computer Science, Springer International Publishing, 177--185. DOI:https:\/\/doi.org\/10.1007\/978-3-319-66179-7_21"},{"key":"e_1_2_1_60_1","volume-title":"Proceedings ofthe31st Conference on Neural Information Processing Systems.","author":"Paszke Adam","year":"2017","unstructured":"Adam Paszke , Sam Gross , Soumith Chintala , Gregory Chanan , Edward Yang , Zachary DeVito , Zeming Lin , Alban Desmaison , Luca Antiga , and Adam Lerer . 2017 . Automatic differentiation in PyTorch . In Proceedings ofthe31st Conference on Neural Information Processing Systems. Adam Paszke, Sam Gross, Soumith Chintala, Gregory Chanan, Edward Yang, Zachary DeVito, Zeming Lin, Alban Desmaison, Luca Antiga, and Adam Lerer. 2017. Automatic differentiation in PyTorch. In Proceedings ofthe31st Conference on Neural Information Processing Systems."},{"key":"e_1_2_1_61_1","volume-title":"Makse","author":"Pei Sen","year":"2014","unstructured":"Sen Pei , Lev Muchnik , Jos\u00e9 S. Andrade , Jr, Zhiming Zheng , and Hern\u00e1n A . Makse . 2014 . Searching for superspreaders of information in real-world social media. Scientific Reports 4, Article 5547 (2014). DOI:https:\/\/doi.org\/10.1038\/srep05547 Sen Pei, Lev Muchnik, Jos\u00e9 S. Andrade, Jr, Zhiming Zheng, and Hern\u00e1n A. Makse. 2014. Searching for superspreaders of information in real-world social media. Scientific Reports 4, Article 5547 (2014). DOI:https:\/\/doi.org\/10.1038\/srep05547"},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2010.58"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1080\/15472450.2012.716663"},{"key":"e_1_2_1_64_1","volume-title":"Studies in Computational Intelligence","author":"Rakhimberdina Zarina","unstructured":"Zarina Rakhimberdina and Tsuyoshi Murata . 2020. Linear graph convolutional model for diagnosing brain disorders . In Complex Networks and Their Applications VIII, Hocine Cherifi, Sabrina Gaito, Jos\u00e9 Fernendo Mendes, Esteban Moro, and Luis Mateus Rocha (Eds.). Studies in Computational Intelligence , Springer International Publishing , 815--826. DOI:https:\/\/doi.org\/10.1007\/978-3-030-36683-4_65 Zarina Rakhimberdina and Tsuyoshi Murata. 2020. Linear graph convolutional model for diagnosing brain disorders. In Complex Networks and Their Applications VIII, Hocine Cherifi, Sabrina Gaito, Jos\u00e9 Fernendo Mendes, Esteban Moro, and Luis Mateus Rocha (Eds.). Studies in Computational Intelligence, Springer International Publishing, 815--826. DOI:https:\/\/doi.org\/10.1007\/978-3-030-36683-4_65"},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-015-0423-0"},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289527"},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1017\/nws.2016.20"},{"key":"e_1_2_1_68_1","volume-title":"International Conference on Learning Representation (ICLR'18)","author":"Veli\u0109kovi\u0107 Petar","year":"2018","unstructured":"Petar Veli\u0109kovi\u0107 , Guillem Cucurull , Arantxa Casanova , Adriana Romero , Pietro Li\u00f2 , and Yoshua Bengio . 2018 . Graph attention networks . In International Conference on Learning Representation (ICLR'18) . Petar Veli\u0109kovi\u0107, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Li\u00f2, and Yoshua Bengio. 2018. Graph attention networks. In International Conference on Learning Representation (ICLR'18)."},{"key":"e_1_2_1_69_1","volume-title":"International Conference on Learning Representation (ICLR'19)","author":"Veli\u0109kovi\u0107 Petar","unstructured":"Petar Veli\u0109kovi\u0107 , William Fedus , William L. Hamilton , Pietro Li\u00f2 , Yoshua Bengio , and R. Devon Hjelm . 2018. Deep graph infomax . In International Conference on Learning Representation (ICLR'19) . Petar Veli\u0109kovi\u0107, William Fedus, William L. Hamilton, Pietro Li\u00f2, Yoshua Bengio, and R. Devon Hjelm. 2018. Deep graph infomax. In International Conference on Learning Representation (ICLR'19)."},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2016.10.006"},{"key":"e_1_2_1_71_1","volume-title":"Proceedings of the 36th International Conference on Machine Learning. 6861--6871","author":"Wu Felix","unstructured":"Felix Wu , Amauri H. Souza , Tianyi Zhang , Christopher Fifty , Tao Yu , and Kilian Q. Weinberger . 2019. Simplifying graph convolutional networks . In Proceedings of the 36th International Conference on Machine Learning. 6861--6871 . Felix Wu, Amauri H. Souza, Tianyi Zhang, Christopher Fifty, Tao Yu, and Kilian Q. Weinberger. 2019. Simplifying graph convolutional networks. In Proceedings of the 36th International Conference on Machine Learning. 6861--6871."},{"key":"e_1_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"e_1_2_1_73_1","volume-title":"International Conference on Learning Representation (ICLR'19)","author":"Xu Keyulu","year":"2018","unstructured":"Keyulu Xu , Weihua Hu , Jure Leskovec , and Stefanie Jegelka . 2018 . How powerful are graph neural networks? In International Conference on Learning Representation (ICLR'19) . Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka. 2018. How powerful are graph neural networks? In International Conference on Learning Representation (ICLR'19)."},{"key":"e_1_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219890"},{"key":"e_1_2_1_75_1","volume-title":"Proceedings of the 32nd International Conference on Neural Information Processing Systems. Curran Associates Inc. 4805--4815","author":"Ying Rex","year":"2018","unstructured":"Rex Ying , Jiaxuan You , Christopher Morris , Xiang Ren , William L. Hamilton , and Jure Leskovec . 2018 . Hierarchical graph representation learning with differentiable pooling . In Proceedings of the 32nd International Conference on Neural Information Processing Systems. Curran Associates Inc. 4805--4815 . Retrieved from http:\/\/dl.acm.org\/citation.cfm?id=3327345.3327389. Rex Ying, Jiaxuan You, Christopher Morris, Xiang Ren, William L. Hamilton, and Jure Leskovec. 2018. Hierarchical graph representation learning with differentiable pooling. In Proceedings of the 32nd International Conference on Neural Information Processing Systems. Curran Associates Inc. 4805--4815. Retrieved from http:\/\/dl.acm.org\/citation.cfm?id=3327345.3327389."},{"key":"e_1_2_1_76_1","volume-title":"Proceedings of the 32nd AAAI Conference on Artificial Intelligence. 4434--4445","author":"Zhang Muhan","year":"2018","unstructured":"Muhan Zhang , Zhicheng Cui , Marion Neumann , and Yixin Chen . 2018 . An end-to-end deep learning architecture for graph classification . In Proceedings of the 32nd AAAI Conference on Artificial Intelligence. 4434--4445 . Muhan Zhang, Zhicheng Cui, Marion Neumann, and Yixin Chen. 2018. An end-to-end deep learning architecture for graph classification. In Proceedings of the 32nd AAAI Conference on Artificial Intelligence. 4434--4445."},{"key":"e_1_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.aiopen.2021.01.001"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3446217","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3446217","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:47:05Z","timestamp":1750178825000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3446217"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,10]]},"references-count":76,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2021,10,31]]}},"alternative-id":["10.1145\/3446217"],"URL":"https:\/\/doi.org\/10.1145\/3446217","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,10]]},"assertion":[{"value":"2020-01-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-12-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-05-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}