{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,30]],"date-time":"2026-07-30T14:08:50Z","timestamp":1785420530683,"version":"3.56.0"},"publisher-location":"New York, NY, USA","reference-count":45,"publisher":"ACM","funder":[{"name":"National Natural Science Foundation of China","award":["62302451"],"award-info":[{"award-number":["62302451"]}]},{"name":"National Natural Science Foundation of China","award":["62276233"],"award-info":[{"award-number":["62276233"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,4,13]]},"DOI":"10.1145\/3774904.3792709","type":"proceedings-article","created":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T21:54:39Z","timestamp":1775771679000},"page":"1505-1516","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["CLGNN: A Contrastive Learning-based GNN for Temporal Betweenness Prediction under Extreme Value Imbalance"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3334-1701","authenticated-orcid":false,"given":"Tianming","family":"Zhang","sequence":"first","affiliation":[{"name":"Zhejiang University of Technology, Hangzhou, Zhejiang, China and Zhejiang Key Laboratory of Visual Information Intelligent Processing, Hangzhou, Zhejiang, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-6971-5858","authenticated-orcid":false,"given":"Renbo","family":"Zhang","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, Zhejiang, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1772-6863","authenticated-orcid":false,"given":"Zhengyi","family":"Yang","sequence":"additional","affiliation":[{"name":"The University of New South Wales, Sydney, New South Wales, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3816-8450","authenticated-orcid":false,"given":"Yunjun","family":"Gao","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, Zhejiang, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1062-6309","authenticated-orcid":false,"given":"Bin","family":"Cao","sequence":"additional","affiliation":[{"name":"Zhejiang University of Technology, Hangzhou, Zhejiang, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0140-7043","authenticated-orcid":false,"given":"Jing","family":"Fan","sequence":"additional","affiliation":[{"name":"Zhejiang University of Technology, Hangzhou, Zhejiang, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,4,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218127407018403"},{"key":"e_1_3_2_1_3_1","unstructured":"Shaked Brody Uri Alon and Eran Yahav. 2022. How Attentive are Graph Attention Networks?. In ICLR."},{"key":"e_1_3_2_1_4_1","first-page":"2084","article-title":"Algorithmic Aspects of Temporal Betweenness","author":"Bu\u00df Sebastian","year":"2020","unstructured":"Sebastian Bu\u00df, Hendrik Molter, Rolf Niedermeier, and Maciej Rymar. 2020. Algorithmic Aspects of Temporal Betweenness. In KDD. 2084-2092.","journal-title":"KDD."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2007.1060"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.3390\/app15116003"},{"key":"e_1_3_2_1_7_1","first-page":"196","article-title":"Bavarian","author":"Cousins Cyrus","year":"2021","unstructured":"Cyrus Cousins, Chloe Wohlgemuth, and Matteo Riondato. 2021. Bavarian: Betweenness Centrality Approximation with Variance-Aware Rademacher Averages. In SIGKDD. 196-206.","journal-title":"Betweenness Centrality Approximation with Variance-Aware Rademacher Averages. In SIGKDD."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00779-005-0046-3"},{"key":"e_1_3_2_1_9_1","first-page":"433","article-title":"A Divide-and-Conquer Algorithm for Betweenness Centrality","author":"Erd\u00f6s D\u00f3ra","year":"2015","unstructured":"D\u00f3ra Erd\u00f6s, Vatche Ishakian, Azer Bestavros, and Evimaria Terzi. 2015. A Divide-and-Conquer Algorithm for Betweenness Centrality. In SIAM. 433-441.","journal-title":"SIAM."},{"key":"e_1_3_2_1_10_1","first-page":"559","article-title":"Learning to Identify High Betweenness Centrality Nodes from Scratch","author":"Fan Changjun","year":"2019","unstructured":"Changjun Fan, Li Zeng, Yuhui Ding, Muhao Chen, Yizhou Sun, and Zhong Liu. 2019. Learning to Identify High Betweenness Centrality Nodes from Scratch: A Novel Graph Neural Network Approach. In CIKM. 559-568.","journal-title":"A Novel Graph Neural Network Approach. In CIKM."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.csda.2011.09.003"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0107878"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1140\/epjds\/s13688-018-0140-1"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.2307\/2346830"},{"key":"e_1_3_2_1_15_1","unstructured":"Franziska Heeg and Ingo Scholtes. 2024. Using Time-Aware Graph Neural Networks to Predict Temporal Centralities in Dynamic Graphs. In NeurIPS."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jtbi.2010.11.033"},{"key":"e_1_3_2_1_17_1","first-page":"1343","article-title":"KONECT: the Koblenz network collection","author":"Kunegis J\u00e9r\u00f4me","year":"2013","unstructured":"J\u00e9r\u00f4me Kunegis. 2013. KONECT: the Koblenz network collection. In ACM WWW. 1343-1350.","journal-title":"ACM WWW."},{"key":"e_1_3_2_1_18_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3696410.3714943"},{"key":"e_1_3_2_1_20_1","first-page":"2149","article-title":"Fast Approximations of Betweenness Centrality with Graph Neural Networks","author":"Maurya Sunil Kumar","year":"2019","unstructured":"Sunil Kumar Maurya, Xin Liu, and Tsuyoshi Murata. 2019. Fast Approximations of Betweenness Centrality with Graph Neural Networks. In CIKM. 2149-2152.","journal-title":"CIKM."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3446217"},{"key":"e_1_3_2_1_22_1","first-page":"285","article-title":"A threshold selection method from gray-level histograms","volume":"11","author":"Nobuyuki Otsu","year":"1975","unstructured":"Nobuyuki Otsu et al., 1975. A threshold selection method from gray-level histograms. Automatica, Vol. 11, 285-296 (1975), 23-27.","journal-title":"Automatica"},{"key":"e_1_3_2_1_23_1","volume-title":"Netzschleuder: Network Catalogue. https:\/\/networks.skewed.de\/.","author":"Peixoto Tiago P.","year":"2020","unstructured":"Tiago P. Peixoto. 2020. Netzschleuder: Network Catalogue. https:\/\/networks.skewed.de\/."},{"key":"e_1_3_2_1_24_1","volume-title":"Learning on Graphs Conference. PMLR, 51-1.","author":"Qarkaxhija Lisi","year":"2022","unstructured":"Lisi Qarkaxhija, Vincenzo Perri, and Ingo Scholtes. 2022. De bruijn goes neural: Causality-aware graph neural networks for time series data on dynamic graphs. In Learning on Graphs Conference. PMLR, 51-1."},{"key":"e_1_3_2_1_25_1","volume-title":"Kshitij Shukla, and Kishore Kothapalli.","author":"Regunta Sai Charan","year":"2023","unstructured":"Sai Charan Regunta, Sai Harsh Tondomker, Kshitij Shukla, and Kishore Kothapalli. 2023. Efficient parallel algorithms for dynamic closeness- and betweenness centrality. Concurr. Comput. Pract. Exp., Vol. 35, 17 (2023)."},{"key":"e_1_3_2_1_26_1","volume-title":"Bronstein","author":"Rossi Emanuele","year":"2020","unstructured":"Emanuele Rossi, Ben Chamberlain, Fabrizio Frasca, Davide Eynard, Federico Monti, and Michael M. Bronstein. 2020. Temporal Graph Networks for Deep Learning on Dynamic Graphs. arXiv preprint arXiv: 2006.10637 (2020)."},{"key":"e_1_3_2_1_27_1","volume-title":"Ahmed","author":"Rossi Ryan A.","year":"2015","unstructured":"Ryan A. Rossi and Nesreen K. Ahmed. 2015. The Network Data Repository with Interactive Graph Analytics and Visualization. https:\/\/networkrepository.com\/temporal-networks.php"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-0427(87)90125-7"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512204"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3022668"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3746252.3761008"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289263"},{"key":"e_1_3_2_1_33_1","first-page":"94568","article-title":"Temporal Graph Neural Tangent Kernel with Graphon-Guaranteed","volume":"37","author":"Tieu Khoi","year":"2024","unstructured":"Khoi Tieu, Dixin Fu, Yizhou Zhu, Jiaqi Chen, Binhang Yuan, and Pan Li. 2024. Temporal Graph Neural Tangent Kernel with Graphon-Guaranteed. NeurIPS, Vol. 37 (2024), 94568-94606.","journal-title":"NeurIPS"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s41060-019-00189-x"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0073970"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589334.3645622"},{"key":"e_1_3_2_1_37_1","unstructured":"Da Xu Chuanwei Ruan Evren K\u00f6rpeoglu Sushant Kumar and Kannan Achan. 2020. Inductive representation learning on temporal graphs. In ICLR."},{"key":"e_1_3_2_1_38_1","volume-title":"UniDyG: A Unified and Effective Representation Learning Approach for Large Dynamic Graphs","author":"Xu Yuanyuan","year":"2025","unstructured":"Yuanyuan Xu, Wenjie Zhang, Xuemin Lin, and Ying Zhang. 2025a. UniDyG: A Unified and Effective Representation Learning Approach for Large Dynamic Graphs. IEEE Transactions on Knowledge and Data Engineering (2025), 4373-4388."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2024.3394161"},{"key":"e_1_3_2_1_40_1","volume-title":"TimeSGN: Scalable and Effective Temporal Graph Neural Network. In 2024 IEEE 40th International Conference on Data Engineering (ICDE). 3297-3310","author":"Xu Yuanyuan","year":"2024","unstructured":"Yuanyuan Xu, Wenjie Zhang, Ying Zhang, Maria Orlowska, and Xuemin Lin. 2024. TimeSGN: Scalable and Effective Temporal Graph Neural Network. In 2024 IEEE 40th International Conference on Data Engineering (ICDE). 3297-3310."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3690624.3709327"},{"key":"e_1_3_2_1_42_1","volume-title":"NeurIPS","volume":"32","author":"Yang Derek","year":"2019","unstructured":"Derek Yang, Li Zhao, Zichuan Lin, Tao Qin, Jiang Bian, and Tie-Yan Liu. 2019. Fully parameterized quantile function for distributional reinforcement learning. NeurIPS, Vol. 32 (2019)."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589334.3645432"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589334.3645438"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2024.3363695"}],"event":{"name":"WWW '26: The ACM Web Conference 2026","location":"Dubai United Arab Emirates","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the ACM Web Conference 2026"],"original-title":[],"deposited":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T16:32:50Z","timestamp":1775838770000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3774904.3792709"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,12]]},"references-count":45,"alternative-id":["10.1145\/3774904.3792709","10.1145\/3774904"],"URL":"https:\/\/doi.org\/10.1145\/3774904.3792709","relation":{},"subject":[],"published":{"date-parts":[[2026,4,12]]},"assertion":[{"value":"2026-04-12","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}