{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T02:51:55Z","timestamp":1783133515342,"version":"3.54.6"},"publisher-location":"New York, NY, USA","reference-count":107,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,8,24]],"date-time":"2024-08-24T00:00:00Z","timestamp":1724457600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,8,25]]},"DOI":"10.1145\/3637528.3671732","type":"proceedings-article","created":{"date-parts":[[2024,8,25]],"date-time":"2024-08-25T04:55:12Z","timestamp":1724561712000},"page":"4326-4337","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Topology-aware Embedding Memory for Continual Learning on Expanding Networks"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0694-3654","authenticated-orcid":false,"given":"Xikun","family":"Zhang","sequence":"first","affiliation":[{"name":"The University of Sydney, Sydney, NSW, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7027-7916","authenticated-orcid":false,"given":"Dongjin","family":"Song","sequence":"additional","affiliation":[{"name":"University of Connecticut, Storrs, CT, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3704-4432","authenticated-orcid":false,"given":"Yixin","family":"Chen","sequence":"additional","affiliation":[{"name":"Washington University, Saint Louis, St. Louis, MO, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7225-5449","authenticated-orcid":false,"given":"Dacheng","family":"Tao","sequence":"additional","affiliation":[{"name":"The University of Sydney, Sydney, NSW, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,8,24]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Greg Ver Steeg, and Aram Galstyan","author":"Abu-El-Haija Sami","year":"2019","unstructured":"Sami Abu-El-Haija, Bryan Perozzi, Amol Kapoor, Nazanin Alipourfard, Kristina Lerman, Hrayr Harutyunyan, Greg Ver Steeg, and Aram Galstyan. 2019. Mixhop: Higher-order graph convolutional architectures via sparsified neighborhood mixing. In ICML. PMLR, 21--29."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482193"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01219-9_9"},{"key":"e_1_3_2_2_4_1","unstructured":"Rahaf Aljundi Min Lin Baptiste Goujaud and Yoshua Bengio. 2019. Gradient based sample selection for online continual learning. In NeurIPS. 11816--11825."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSTARS.2021.3084408"},{"key":"e_1_3_2_2_6_1","unstructured":"Lucas Caccia Eugene Belilovsky Massimo Caccia and Joelle Pineau. 2020. Online learned continual compression with adaptive quantization modules. In ICML. PMLR 1240--1250."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512176"},{"key":"e_1_3_2_2_8_1","volume-title":"Catastrophic Forgetting in Deep Graph Networks: an Introductory Benchmark for Graph Classification. arXiv preprint arXiv:2103.11750","author":"Carta Antonio","year":"2021","unstructured":"Antonio Carta, Andrea Cossu, Federico Errica, and Davide Bacciu. 2021. Catastrophic Forgetting in Deep Graph Networks: an Introductory Benchmark for Graph Classification. arXiv preprint arXiv:2103.11750 (2021)."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01252-6_33"},{"key":"e_1_3_2_2_10_1","volume-title":"Fastgcn: fast learning with graph convolutional networks via importance sampling. arXiv preprint arXiv:1801.10247","author":"Chen Jie","year":"2018","unstructured":"Jie Chen, Tengfei Ma, and Cao Xiao. 2018. Fastgcn: fast learning with graph convolutional networks via importance sampling. arXiv preprint arXiv:1801.10247 (2018)."},{"key":"e_1_3_2_2_11_1","volume-title":"Stochastic training of graph convolutional networks with variance reduction. arXiv preprint arXiv:1710.10568","author":"Chen Jianfei","year":"2017","unstructured":"Jianfei Chen, Jun Zhu, and Le Song. 2017. Stochastic training of graph convolutional networks with variance reduction. arXiv preprint arXiv:1710.10568 (2017)."},{"key":"e_1_3_2_2_12_1","volume-title":"On graph neural networks versus graph-augmented mlps. arXiv preprint arXiv:2010.15116","author":"Chen Lei","year":"2020","unstructured":"Lei Chen, Zhengdao Chen, and Joan Bruna. 2020. On graph neural networks versus graph-augmented mlps. arXiv preprint arXiv:2010.15116 (2020)."},{"key":"e_1_3_2_2_13_1","volume-title":"Are powerful graph neural nets necessary? a dissection on graph classification. arXiv preprint arXiv:1905.04579","author":"Chen Ting","year":"2019","unstructured":"Ting Chen, Song Bian, and Yizhou Sun. 2019. Are powerful graph neural nets necessary? a dissection on graph classification. arXiv preprint arXiv:1905.04579 (2019)."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557047"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330925"},{"key":"e_1_3_2_2_16_1","volume-title":"ICML. PMLR","author":"Chrysakis Aristotelis","year":"2020","unstructured":"Aristotelis Chrysakis and Marie-Francine Moens. 2020. Online continual learning from imbalanced data. In ICML. PMLR, 1952--1961."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403192"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i4.25539"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2021.3056071"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSLW53931.2022.9820066"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP43922.2022.9747156"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/IEEECONF56349.2022.10052045"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449927"},{"key":"e_1_3_2_2_24_1","volume-title":"International Conference on Artificial Intelligence and Statistics. PMLR, 3762--3773","author":"Farajtabar Mehrdad","year":"2020","unstructured":"Mehrdad Farajtabar, Navid Azizan, Alex Mott, and Ang Li. 2020. Orthogonal gradient descent for continual learning. In International Conference on Artificial Intelligence and Statistics. PMLR, 3762--3773."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCI.2022.3222049"},{"key":"e_1_3_2_2_26_1","unstructured":"Yutong Feng Jianwen Jiang and Yue Gao. 2020. Incremental Learning on Growing Graphs. (2020)."},{"key":"e_1_3_2_2_27_1","volume-title":"Gnnautoscale: Scalable and expressive graph neural networks via historical embeddings. In ICML. PMLR, 3294--3304.","author":"Fey Matthias","year":"2021","unstructured":"Matthias Fey, Jan E Lenssen, Frank Weichert, and Jure Leskovec. 2021. Gnnautoscale: Scalable and expressive graph neural networks via historical embeddings. In ICML. PMLR, 3294--3304."},{"key":"e_1_3_2_2_28_1","volume-title":"Sign: Scalable inception graph neural networks. arXiv preprint arXiv:2004.11198","author":"Frasca Fabrizio","year":"2020","unstructured":"Fabrizio Frasca, Emanuele Rossi, Davide Eynard, Ben Chamberlain, Michael Bronstein, and Federico Monti. 2020. Sign: Scalable inception graph neural networks. arXiv preprint arXiv:2004.11198 (2020)."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","unstructured":"Lukas Galke Benedikt Franke Tobias Zielke and Ansgar Scherp. 2021. Lifelong Learning of Graph Neural Networks for Open-World Node Classification. In 2021 IJCNN. 1--8. https:\/\/doi.org\/10.1109\/IJCNN52387.2021.9533412","DOI":"10.1109\/IJCNN52387.2021.9533412"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2023.04.022"},{"key":"e_1_3_2_2_31_1","volume-title":"The 2010","author":"Gallicchio Claudio","unstructured":"Claudio Gallicchio and Alessio Micheli. 2010. Graph echo state networks. In The 2010 IJCNN. IEEE, 1--8."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5803"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00459"},{"key":"e_1_3_2_2_34_1","unstructured":"Justin Gilmer Samuel S Schoenholz Patrick F Riley Oriol Vinyals and George E Dahl. 2017. Neural message passing for quantum chemistry. In ICML. PMLR 1263--1272."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3450112"},{"key":"e_1_3_2_2_36_1","unstructured":"Will Hamilton Zhitao Ying and Jure Leskovec. 2017. Inductive representation learning on large graphs. In NeurIPS. 1024--1034."},{"key":"e_1_3_2_2_37_1","volume-title":"Graph neural networks with continual learning for fake news detection from social media. arXiv preprint arXiv:2007.03316","author":"Han Yi","year":"2020","unstructured":"Yi Han, Shanika Karunasekera, and Christopher Leckie. 2020. Graph neural networks with continual learning for fake news detection from social media. arXiv preprint arXiv:2007.03316 (2020)."},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPRW50498.2020.00118"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","unstructured":"Marcel Hoffmann Lukas Galke and Ansgar Scherp. 2023. Open-World Lifelong Graph Learning. In 2023 IJCNN. 1--9. https:\/\/doi.org\/10.1109\/IJCNN54540.2023.10191071","DOI":"10.1109\/IJCNN54540.2023.10191071"},{"key":"e_1_3_2_2_40_1","first-page":"22118","article-title":"Open graph benchmark: Datasets for machine learning on graphs","volume":"33","author":"Hu Weihua","year":"2020","unstructured":"Weihua Hu, Matthias Fey, Marinka Zitnik, Yuxiao Dong, Hongyu Ren, Bowen Liu, Michele Catasta, and Jure Leskovec. 2020. Open graph benchmark: Datasets for machine learning on graphs. NeurIPS, Vol. 33 (2020), 22118--22133.","journal-title":"NeurIPS"},{"key":"e_1_3_2_2_41_1","volume-title":"Empowering Time Series Analysis with Large Language Models: A Survey. arXiv preprint arXiv:2402.03182","author":"Jiang Yushan","year":"2024","unstructured":"Yushan Jiang, Zijie Pan, Xikun Zhang, Sahil Garg, Anderson Schneider, Yuriy Nevmyvaka, and Dongjin Song. 2024. Empowering Time Series Analysis with Large Language Models: A Survey. arXiv preprint arXiv:2402.03182 (2024)."},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2022\/438"},{"key":"e_1_3_2_2_43_1","volume-title":"Kipf and Max Welling","author":"Thomas","year":"2017","unstructured":"Thomas N. Kipf and Max Welling. 2017. Semi-Supervised Classification with Graph Convolutional Networks. In ICLR. https:\/\/openreview.net\/forum?id=SJU4ayYgl"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1611835114"},{"key":"e_1_3_2_2_45_1","volume-title":"Predict then propagate: Graph neural networks meet personalized pagerank. arXiv preprint arXiv:1810.05997","author":"Klicpera Johannes","year":"2018","unstructured":"Johannes Klicpera, Aleksandar Bojchevski, and Stephan G\u00fcnnemann. 2018. Predict then propagate: Graph neural networks meet personalized pagerank. arXiv preprint arXiv:1810.05997 (2018)."},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i11.26534"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2773081"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3539618.3591991"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i10.17049"},{"key":"e_1_3_2_2_50_1","volume-title":"CaT: Balanced Continual Graph Learning with Graph Condensation. arXiv preprint arXiv:2309.09455","author":"Liu Yilun","year":"2023","unstructured":"Yilun Liu, Ruihong Qiu, and Zi Huang. 2023. CaT: Balanced Continual Graph Learning with Graph Condensation. arXiv preprint arXiv:2309.09455 (2023)."},{"key":"e_1_3_2_2_51_1","unstructured":"David Lopez-Paz and Marc'Aurelio Ranzato. 2017. Gradient episodic memory for continual learning. In NeurIPS. 6467--6476."},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401092"},{"key":"e_1_3_2_2_53_1","volume-title":"Is homophily a necessity for graph neural networks? arXiv preprint arXiv:2106.06134","author":"Ma Yao","year":"2021","unstructured":"Yao Ma, Xiaorui Liu, Neil Shah, and Jiliang Tang. 2021. Is homophily a necessity for graph neural networks? arXiv preprint arXiv:2106.06134 (2021)."},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009953814988"},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/3184558.3191526"},{"key":"e_1_3_2_2_56_1","volume-title":"Revisiting graph neural networks: All we have is low-pass filters. arXiv preprint arXiv:1905.09550","author":"Nt Hoang","year":"2019","unstructured":"Hoang Nt and Takanori Maehara. 2019. Revisiting graph neural networks: All we have is low-pass filters. arXiv preprint arXiv:1905.09550 (2019)."},{"key":"e_1_3_2_2_58_1","unstructured":"Daiqing Qi Handong Zhao Yun Fu and Sheng Li. [n. d.]. Data-Free Continual Graph Learning. ([n. d.])."},{"key":"e_1_3_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/3511808.3557427"},{"key":"e_1_3_2_2_60_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.587"},{"key":"e_1_3_2_2_61_1","volume-title":"Progressive neural networks. arXiv preprint arXiv:1606.04671","author":"Rusu Andrei A","year":"2016","unstructured":"Andrei A Rusu, Neil C Rabinowitz, Guillaume Desjardins, Hubert Soyer, James Kirkpatrick, Koray Kavukcuoglu, Razvan Pascanu, and Raia Hadsell. 2016. Progressive neural networks. arXiv preprint arXiv:1606.04671 (2016)."},{"key":"e_1_3_2_2_62_1","volume-title":"Jaehong Kim, and Jiwon Kim.","author":"Shin Hanul","year":"2017","unstructured":"Hanul Shin, Jung Kwon Lee, Jaehong Kim, and Jiwon Kim. 2017. Continual learning with deep generative replay. In NeurIPS. 2990--2999."},{"key":"e_1_3_2_2_63_1","volume-title":"Towards Robust Inductive Graph Incremental Learning via Experience Replay. arXiv preprint arXiv:2302.03534","author":"Su Junwei","year":"2023","unstructured":"Junwei Su and Chuan Wu. 2023. Towards Robust Inductive Graph Incremental Learning via Experience Replay. arXiv preprint arXiv:2302.03534 (2023)."},{"key":"e_1_3_2_2_64_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i4.25586"},{"key":"e_1_3_2_2_65_1","volume-title":"Self-Supervised Continual Graph Learning in Adaptive Riemannian Spaces. arXiv preprint arXiv:2211.17068","author":"Sun Li","year":"2022","unstructured":"Li Sun, Junda Ye, Hao Peng, Feiyang Wang, and Philip S Yu. 2022. Self-Supervised Continual Graph Learning in Adaptive Riemannian Spaces. arXiv preprint arXiv:2211.17068 (2022)."},{"key":"e_1_3_2_2_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/3488560.3498455"},{"key":"e_1_3_2_2_67_1","article-title":"Visualizing data using t-SNE","volume":"9","author":"der Maaten Laurens Van","year":"2008","unstructured":"Laurens Van der Maaten and Geoffrey Hinton. 2008. Visualizing data using t-SNE. Journal of Machine Learning Research, Vol. 9, 11 (2008).","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_2_68_1","volume-title":"Graph attention networks. arXiv preprint arXiv:1710.10903","author":"Velivckovic Petar","year":"2017","unstructured":"Petar Velivckovic, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Lio, and Yoshua Bengio. 2017. Graph attention networks. arXiv preprint arXiv:1710.10903 (2017)."},{"key":"e_1_3_2_2_69_1","unstructured":"Chen Wang Yuheng Qiu and Sebastian Scherer. 2020. Bridging graph network to lifelong learning with feature interaction. (2020)."},{"key":"e_1_3_2_2_70_1","volume-title":"Lifelong graph learning. arXiv preprint arXiv:2009.00647","author":"Wang Chen","year":"2020","unstructured":"Chen Wang, Yuheng Qiu, and Sebastian Scherer. 2020. Lifelong graph learning. arXiv preprint arXiv:2009.00647 (2020)."},{"key":"e_1_3_2_2_71_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00552"},{"key":"e_1_3_2_2_72_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3411963"},{"key":"e_1_3_2_2_73_1","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539336"},{"key":"e_1_3_2_2_74_1","doi-asserted-by":"publisher","DOI":"10.1162\/qss_a_00021"},{"key":"e_1_3_2_2_75_1","first-page":"243","article-title":"Bring order into the samples: A novel scalable method for influence maximization","volume":"29","author":"Wang Xiaoyang","year":"2016","unstructured":"Xiaoyang Wang, Ying Zhang, Wenjie Zhang, Xuemin Lin, and Chen Chen. 2016. Bring order into the samples: A novel scalable method for influence maximization. IEEE TKDE, Vol. 29, 2 (2016), 243--256.","journal-title":"IEEE TKDE"},{"key":"e_1_3_2_2_76_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-00123-9_59"},{"key":"e_1_3_2_2_77_1","volume-title":"Supermasks in superposition. arXiv preprint arXiv:2006.14769","author":"Wortsman Mitchell","year":"2020","unstructured":"Mitchell Wortsman, Vivek Ramanujan, Rosanne Liu, Aniruddha Kembhavi, Mohammad Rastegari, Jason Yosinski, and Ali Farhadi. 2020. Supermasks in superposition. arXiv preprint arXiv:2006.14769 (2020)."},{"key":"e_1_3_2_2_78_1","unstructured":"Felix Wu Amauri Souza Tianyi Zhang Christopher Fifty Tao Yu and Kilian Weinberger. 2019. Simplifying graph convolutional networks. In ICML. PMLR 6861--6871."},{"key":"e_1_3_2_2_79_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV48922.2021.00116"},{"key":"e_1_3_2_2_80_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2021.3082067"},{"key":"e_1_3_2_2_81_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00046"},{"key":"e_1_3_2_2_82_1","volume-title":"How powerful are graph neural networks? arXiv preprint arXiv:1810.00826","author":"Xu Keyulu","year":"2018","unstructured":"Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka. 2018. How powerful are graph neural networks? arXiv preprint arXiv:1810.00826 (2018)."},{"key":"e_1_3_2_2_83_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3412754"},{"key":"e_1_3_2_2_84_1","volume-title":"Two sides of the same coin: Heterophily and oversmoothing in graph convolutional neural networks. In 2022 IEEE ICDM","author":"Yan Yujun","unstructured":"Yujun Yan, Milad Hashemi, Kevin Swersky, Yaoqing Yang, and Danai Koutra. 2022. Two sides of the same coin: Heterophily and oversmoothing in graph convolutional neural networks. In 2022 IEEE ICDM. IEEE, 1287--1292."},{"key":"e_1_3_2_2_85_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i9.26283"},{"key":"e_1_3_2_2_86_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.6142"},{"key":"e_1_3_2_2_87_1","volume-title":"International Conference on Learning Representation.","author":"Yoon Jaehong","year":"2020","unstructured":"Jaehong Yoon, Saehoon Kim, Eunho Yang, and Sung Ju Hwang. 2020. Scalable and order-robust continual learning with additive parameter decomposition. In International Conference on Learning Representation."},{"key":"e_1_3_2_2_88_1","volume-title":"Lifelong learning with dynamically expandable networks. arXiv preprint arXiv:1708.01547","author":"Yoon Jaehong","year":"2017","unstructured":"Jaehong Yoon, Eunho Yang, Jeongtae Lee, and Sung Ju Hwang. 2017. Lifelong learning with dynamically expandable networks. arXiv preprint arXiv:1708.01547 (2017)."},{"key":"e_1_3_2_2_89_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220024"},{"key":"e_1_3_2_2_90_1","volume-title":"Prudence Wong, and Victor Chang.","author":"Yuan Qiao","year":"2023","unstructured":"Qiao Yuan, Sheng-Uei Guan, Pin Ni, Tianlun Luo, Ka Lok Man, Prudence Wong, and Victor Chang. 2023. Continual Graph Learning: A Survey. arXiv preprint arXiv:2301.12230 (2023)."},{"key":"e_1_3_2_2_91_1","volume-title":"NeurIPS","volume":"34","author":"Zeng Hanqing","year":"2021","unstructured":"Hanqing Zeng, Muhan Zhang, Yinglong Xia, Ajitesh Srivastava, Andrey Malevich, Rajgopal Kannan, Viktor Prasanna, Long Jin, and Ren Chen. 2021. Decoupling the depth and scope of graph neural networks. NeurIPS, Vol. 34 (2021)."},{"key":"e_1_3_2_2_92_1","volume-title":"Continual Learning on Dynamic Graphs via Parameter Isolation. arXiv preprint arXiv:2305.13825","author":"Zhang Peiyan","year":"2023","unstructured":"Peiyan Zhang, Yuchen Yan, Chaozhuo Li, Senzhang Wang, Xing Xie, Guojie Song, and Sunghun Kim. 2023. Continual Learning on Dynamic Graphs via Parameter Isolation. arXiv preprint arXiv:2305.13825 (2023)."},{"key":"e_1_3_2_2_93_1","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539121"},{"key":"e_1_3_2_2_94_1","volume-title":"Topology-aware Embedding Memory for Learning on Expanding Graphs. arXiv preprint arXiv:2401.13200","author":"Zhang Xikun","year":"2024","unstructured":"Xikun Zhang, Dongjin Song, Yixin Chen, and Dacheng Tao. 2024. Topology-aware Embedding Memory for Learning on Expanding Graphs. arXiv preprint arXiv:2401.13200 (2024)."},{"key":"e_1_3_2_2_95_1","volume-title":"Thirty-sixth Conference on Neural Information Processing Systems Datasets and Benchmarks Track.","author":"Zhang Xikun","year":"2022","unstructured":"Xikun Zhang, Dongjin Song, and Dacheng Tao. 2022. Cglb: Benchmark tasks for continual graph learning. In Thirty-sixth Conference on Neural Information Processing Systems Datasets and Benchmarks Track."},{"key":"e_1_3_2_2_96_1","volume-title":"Sparsified Subgraph Memory for Continual Graph Representation Learning. In 2022 IEEE ICDM","author":"Zhang Xikun","unstructured":"Xikun Zhang, Dongjin Song, and Dacheng Tao. 2022. Sparsified Subgraph Memory for Continual Graph Representation Learning. In 2022 IEEE ICDM. IEEE, 1335--1340."},{"key":"e_1_3_2_2_97_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2022.3186909"},{"key":"e_1_3_2_2_98_1","volume-title":"Ricci Curvature-Based Graph Sparsification for Continual Graph Representation Learning","author":"Zhang Xikun","year":"2023","unstructured":"Xikun Zhang, Dongjin Song, and Dacheng Tao. 2023. Ricci Curvature-Based Graph Sparsification for Continual Graph Representation Learning. IEEE TNNLS (2023)."},{"key":"e_1_3_2_2_99_1","volume-title":"Continual Learning on Graphs: Challenges, Solutions, and Opportunities. arXiv preprint arXiv:2402.11565","author":"Zhang Xikun","year":"2024","unstructured":"Xikun Zhang, Dongjin Song, and Dacheng Tao. 2024. Continual Learning on Graphs: Challenges, Solutions, and Opportunities. arXiv preprint arXiv:2402.11565 (2024)."},{"key":"e_1_3_2_2_100_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.01434"},{"key":"e_1_3_2_2_101_1","doi-asserted-by":"crossref","unstructured":"Xikun Zhang Chang Xu and Dacheng Tao. 2020. On dropping clusters to regularize graph convolutional neural networks. In ECCV.","DOI":"10.1007\/978-3-030-58589-1_15"},{"key":"e_1_3_2_2_102_1","first-page":"3047","article-title":"Graph edge convolutional neural networks for skeleton-based action recognition","volume":"31","author":"Zhang Xikun","year":"2019","unstructured":"Xikun Zhang, Chang Xu, Xinmei Tian, and Dacheng Tao. 2019. Graph edge convolutional neural networks for skeleton-based action recognition. IEEE TNNLS, Vol. 31, 8 (2019), 3047--3060.","journal-title":"IEEE TNNLS"},{"key":"e_1_3_2_2_103_1","volume-title":"Graph neural networks for graphs with heterophily: A survey. arXiv preprint arXiv:2202.07082","author":"Zheng Xin","year":"2022","unstructured":"Xin Zheng, Yixin Liu, Shirui Pan, Miao Zhang, Di Jin, and Philip S Yu. 2022. Graph neural networks for graphs with heterophily: A survey. arXiv preprint arXiv:2202.07082 (2022)."},{"key":"e_1_3_2_2_104_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16602"},{"key":"e_1_3_2_2_105_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3358106"},{"key":"e_1_3_2_2_106_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11257"},{"key":"e_1_3_2_2_107_1","unstructured":"Hao Zhu and Piotr Koniusz. 2020. Simple spectral graph convolution. In ICLR."},{"key":"e_1_3_2_2_108_1","first-page":"7793","article-title":"Beyond homophily in graph neural networks: Current limitations and effective designs","volume":"33","author":"Zhu Jiong","year":"2020","unstructured":"Jiong Zhu, Yujun Yan, Lingxiao Zhao, Mark Heimann, Leman Akoglu, and Danai Koutra. 2020. Beyond homophily in graph neural networks: Current limitations and effective designs. NeurIPS, Vol. 33 (2020), 7793--7804.","journal-title":"NeurIPS"}],"event":{"name":"KDD '24: The 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Barcelona Spain","acronym":"KDD '24","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3637528.3671732","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3637528.3671732","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:06:01Z","timestamp":1750291561000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3637528.3671732"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,24]]},"references-count":107,"alternative-id":["10.1145\/3637528.3671732","10.1145\/3637528"],"URL":"https:\/\/doi.org\/10.1145\/3637528.3671732","relation":{},"subject":[],"published":{"date-parts":[[2024,8,24]]},"assertion":[{"value":"2024-08-24","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}