{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T14:58:54Z","timestamp":1773413934076,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,11,3]],"date-time":"2019-11-03T00:00:00Z","timestamp":1572739200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF CAREER Award","award":["1741634"],"award-info":[{"award-number":["1741634"]}]},{"name":"Amazon Research Award"},{"name":"NSF III","award":["1705169"],"award-info":[{"award-number":["1705169"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,11,3]]},"DOI":"10.1145\/3357384.3357979","type":"proceedings-article","created":{"date-parts":[[2019,11,4]],"date-time":"2019-11-04T14:11:35Z","timestamp":1572876695000},"page":"559-568","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":53,"title":["Learning to Identify High Betweenness Centrality Nodes from Scratch"],"prefix":"10.1145","author":[{"given":"Changjun","family":"Fan","sequence":"first","affiliation":[{"name":"National University of Defense Technology & University of California, Los Angeles, Changsha, China"}]},{"given":"Li","family":"Zeng","sequence":"additional","affiliation":[{"name":"National University of Defense Technology, Changsha, China"}]},{"given":"Yuhui","family":"Ding","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}]},{"given":"Muhao","family":"Chen","sequence":"additional","affiliation":[{"name":"University of California, Los Angeles & University of Pennsylvania, Los Angeles, CA, USA"}]},{"given":"Yizhou","family":"Sun","sequence":"additional","affiliation":[{"name":"University of California, Los Angeles, Los Angeles, CA, USA"}]},{"given":"Zhong","family":"Liu","sequence":"additional","affiliation":[{"name":"National University of Defense Technology, Changsha, China"}]}],"member":"320","published-online":{"date-parts":[[2019,11,3]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Ziyad AlGhamdi Fuad Jamour Spiros Skiadopoulos and Panos Kalnis. 2017. A benchmark for betweenness centrality approximation algorithms on large graphs. In SSDBM. 6.  Ziyad AlGhamdi Fuad Jamour Spiros Skiadopoulos and Panos Kalnis. 2017. A benchmark for betweenness centrality approximation algorithms on large graphs. In SSDBM. 6.","DOI":"10.1145\/3085504.3085510"},{"key":"e_1_3_2_1_2_1","volume-title":"Graph Edit Distance Computation via Graph Neural Networks. arXiv preprint arXiv:1808.05689","author":"Bai Yunsheng","year":"2018"},{"key":"e_1_3_2_1_3_1","volume-title":"Emergence of scaling in random networks. science","author":"Barab\u00e1si Albert-L\u00e1szl\u00f3","year":"1999"},{"key":"e_1_3_2_1_4_1","unstructured":"Michele Borassi and Emanuele Natale. 2016. KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation. In ESA .  Michele Borassi and Emanuele Natale. 2016. KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation. In ESA ."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1605083113"},{"key":"e_1_3_2_1_7_1","volume-title":"et almbox","author":"Chen Haochen","year":"2018"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Ting Chen and Yizhou Sun. 2017. Task-guided and path-augmented heterogeneous network embedding for author identification. In WSDM .  Ting Chen and Yizhou Sun. 2017. Task-guided and path-augmented heterogeneous network embedding for author identification. In WSDM .","DOI":"10.1145\/3018661.3018735"},{"key":"e_1_3_2_1_9_1","volume-title":"23rd International World Wide Web Conference. International World Wide Web Conference Committee, 339--340","author":"Chung Chin-Wan","year":"2014"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Claire Donnat Marinka Zitnik David Hallac and Jure Leskovec. 2018. Learning Structural Node Embeddings via Diffusion Wavelets. (2018).  Claire Donnat Marinka Zitnik David Hallac and Jure Leskovec. 2018. Learning Structural Node Embeddings via Diffusion Wavelets. (2018).","DOI":"10.1145\/3219819.3220025"},{"key":"e_1_3_2_1_11_1","volume-title":"Publ. Math. Debrecen","volume":"6","author":"ErdHos P","year":"1959"},{"key":"e_1_3_2_1_12_1","volume-title":"Ego network betweenness. Social networks","author":"Everett Martin","year":"2005"},{"key":"e_1_3_2_1_13_1","volume-title":"An efficient link prediction index for complex military organization. Physica A: Statistical Mechanics and its Applications","author":"Fan Changjun","year":"2017"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/3191835.3191883"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Aditya Grover and Jure Leskovec. 2016. node2vec: Scalable feature learning for networks. In KDD .  Aditya Grover and Jure Leskovec. 2016. node2vec: Scalable feature learning for networks. In KDD .","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_3_2_1_16_1","unstructured":"Will Hamilton Zhitao Ying and Jure Leskovec. 2017a. Inductive representation learning on large graphs. In NIPS .  Will Hamilton Zhitao Ying and Jure Leskovec. 2017a. Inductive representation learning on large graphs. In NIPS ."},{"key":"e_1_3_2_1_17_1","volume-title":"Representation learning on graphs: Methods and applications. arXiv","author":"Hamilton William L","year":"2017"},{"key":"e_1_3_2_1_18_1","volume-title":"Growing scale-free networks with tunable clustering. Physical review E","author":"Holme Petter","year":"2002"},{"key":"e_1_3_2_1_19_1","volume-title":"Chang No Yoon, and Seung Kee Han.","author":"Holme Petter","year":"2002"},{"key":"e_1_3_2_1_20_1","unstructured":"Thomas N Kipf and Max Welling. 2017. Semi-supervised classification with graph convolutional networks. In ICLR .  Thomas N Kipf and Max Welling. 2017. Semi-supervised classification with graph convolutional networks. In ICLR ."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-012-0076-6"},{"key":"e_1_3_2_1_22_1","volume-title":"Efficient extraction of high centrality vertices in distributed graphs","author":"Kumbhare Alok Gautam"},{"key":"e_1_3_2_1_23_1","volume-title":"Deeper Insights into Graph Convolutional Networks for Semi-Supervised Learning. arXiv","author":"Li Qimai","year":"2018"},{"key":"e_1_3_2_1_24_1","unstructured":"Yujia Li Daniel Tarlow Marc Brockschmidt and Richard Zemel. 2016. Gated graph sequence neural networks. In ICLR .  Yujia Li Daniel Tarlow Marc Brockschmidt and Richard Zemel. 2016. Gated graph sequence neural networks. In ICLR ."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Ahmad Mahmoody Charalampos E Tsourakakis and Eli Upfal. 2016. Scalable betweenness centrality maximization via sampling. In KDD .  Ahmad Mahmoody Charalampos E Tsourakakis and Eli Upfal. 2016. Scalable betweenness centrality maximization via sampling. In KDD .","DOI":"10.1145\/2939672.2939869"},{"key":"e_1_3_2_1_26_1","volume-title":"Compressive sensing of high betweenness centrality nodes in networks. Physica A: Statistical Mechanics and its Applications","author":"Mahyar Hamidreza","year":"2018"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0601602103"},{"key":"e_1_3_2_1_28_1","volume-title":"The graph-tool python library. figshare","author":"Peixoto Tiago P","year":"2014"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"J\u00fcrgen Pfeffer and Kathleen M Carley. 2012. k-centralities: Local approximations of global measures based on shortest paths. In WWW .  J\u00fcrgen Pfeffer and Kathleen M Carley. 2012. k-centralities: Local approximations of global measures based on shortest paths. In WWW .","DOI":"10.1145\/2187980.2188239"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-015-0423-0"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3208351"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1017\/nws.2016.20"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741093"},{"key":"e_1_3_2_1_35_1","unstructured":"Petar Velickovic Guillem Cucurull Arantxa Casanova Adriana Romero Pietro Lio and Yoshua Bengio. 2018. Graph attention networks. In ICLR .  Petar Velickovic Guillem Cucurull Arantxa Casanova Adriana Romero Pietro Lio and Yoshua Bengio. 2018. Graph attention networks. In ICLR ."},{"key":"e_1_3_2_1_36_1","unstructured":"Keyulu Xu Chengtao Li Yonglong Tian Tomohiro Sonobe Ken-ichi Kawarabayashi and Stefanie Jegelka. 2018. Representation Learning on Graphs with Jumping Knowledge Networks. In ICML .  Keyulu Xu Chengtao Li Yonglong Tian Tomohiro Sonobe Ken-ichi Kawarabayashi and Stefanie Jegelka. 2018. Representation Learning on Graphs with Jumping Knowledge Networks. In ICML ."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"Yuichi Yoshida. 2014. Almost linear-time algorithms for adaptive betweenness centrality using hypergraph sketches. In KDD .  Yuichi Yoshida. 2014. Almost linear-time algorithms for adaptive betweenness centrality using hypergraph sketches. In KDD .","DOI":"10.1145\/2623330.2623626"}],"event":{"name":"CIKM '19: The 28th ACM International Conference on Information and Knowledge Management","location":"Beijing China","acronym":"CIKM '19","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 28th ACM International Conference on Information and Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357384.3357979","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3357384.3357979","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:23:04Z","timestamp":1750202584000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357384.3357979"}},"subtitle":["A Novel Graph Neural Network Approach"],"short-title":[],"issued":{"date-parts":[[2019,11,3]]},"references-count":37,"alternative-id":["10.1145\/3357384.3357979","10.1145\/3357384"],"URL":"https:\/\/doi.org\/10.1145\/3357384.3357979","relation":{},"subject":[],"published":{"date-parts":[[2019,11,3]]},"assertion":[{"value":"2019-11-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}