{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T04:51:00Z","timestamp":1781758260150,"version":"3.54.5"},"reference-count":87,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["FL-170100117"],"award-info":[{"award-number":["FL-170100117"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["IC-190100031"],"award-info":[{"award-number":["IC-190100031"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CNS-2154191"],"award-info":[{"award-number":["CNS-2154191"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"United States Department of Agriculture (USDA) National Institute of Food and Agriculture","award":["2022-67022-36603"],"award-info":[{"award-number":["2022-67022-36603"]}]},{"name":"UConn Scholarship Facilitation Fund (SFF) Award"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Neural Netw. Learning Syst."],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1109\/tnnls.2023.3303454","type":"journal-article","created":{"date-parts":[[2023,8,21]],"date-time":"2023-08-21T17:55:46Z","timestamp":1692640546000},"page":"17398-17410","source":"Crossref","is-referenced-by-count":8,"title":["Ricci Curvature-Based Graph Sparsification for Continual Graph Representation Learning"],"prefix":"10.1109","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0694-3654","authenticated-orcid":false,"given":"Xikun","family":"Zhang","sequence":"first","affiliation":[{"name":"Sydney AI Centre and the School of Computer Science, Faculty of Engineering, The University of Sydney, Darlington, 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":"Department of Computer Science and Engineering, University of Connecticut, Storrs, CT, 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":"Sydney AI Centre and the School of Computer Science, Faculty of Engineering, The University of Sydney, Darlington, NSW, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1609.02907"},{"key":"ref2","first-page":"1263","article-title":"Neural message passing for quantum chemistry","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Gilmer"},{"key":"ref3","first-page":"1024","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Hamilton"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1037\/0033-295X.102.3.419"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.tics.2016.05.004"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.587"},{"key":"ref7","first-page":"6467","article-title":"Gradient episodic memory for continual learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Lopez-Paz"},{"key":"ref8","first-page":"11816","article-title":"Gradient based sample selection for online continual learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Aljundi"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16602"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52688.2022.01335"},{"key":"ref11","article-title":"Understanding over-squashing and bottlenecks on graphs via curvature","author":"Topping","year":"2021","journal-title":"arXiv:2111.14522"},{"key":"ref12","article-title":"Curvature graph network","volume-title":"Proc. ICLR","author":"Ye"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.124"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020492"},{"key":"ref15","first-page":"688","article-title":"Improved large-scale graph learning through ridge spectral sparsification","volume-title":"Proc. ICML","author":"Calandriello"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.2016.7899979"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150479"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772762"},{"key":"ref19","article-title":"Gnnexplainer: Generating explanations for graph neural networks","volume-title":"Proc. NIPS","volume":"32","author":"Ying"},{"key":"ref20","first-page":"19620","article-title":"Parameterized explainer for graph neural network","volume-title":"Proc. NIPS","volume":"33","author":"Luo"},{"key":"ref21","first-page":"11458","article-title":"Robust graph representation learning via neural sparsification","volume-title":"Proc. ICML","author":"Zheng"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.3044146"},{"key":"ref23","first-page":"1335","article-title":"Sparsified subgraph memory for continual graph representation learninggated information bottleneck for generalization in sequential environments","volume-title":"Proc. IEEE Int. Conf. Data Mining (ICDM)","author":"Zhang"},{"key":"ref24","first-page":"3762","article-title":"Orthogonal gradient descent for continual learning","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Farajtabar"},{"issue":"13","key":"ref25","doi-asserted-by":"crossref","first-page":"3521","DOI":"10.1073\/pnas.1611835114","article-title":"Overcoming catastrophic forgetting in neural networks","volume":"114","author":"James","year":"2017","journal-title":"Proc. Nat. Acad. Sci. USA"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2773081"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01219-9_9"},{"key":"ref28","article-title":"Supermasks in superposition","author":"Wortsman","year":"2020","journal-title":"arXiv:2006.14769"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00046"},{"key":"ref30","article-title":"Scalable and order-robust continual learning with additive parameter decomposition","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Yoon"},{"key":"ref31","article-title":"Lifelong learning with dynamically expandable networks","author":"Yoon","year":"2017","journal-title":"arXiv:1708.01547"},{"key":"ref32","article-title":"Progressive neural networks","author":"Rusu","year":"2016","journal-title":"arXiv:1606.04671"},{"key":"ref33","first-page":"1240","article-title":"Online learned continual compression with adaptive quantization modules","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Caccia"},{"key":"ref34","first-page":"1952","article-title":"Online continual learning from imbalanced data","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Chrysakis"},{"key":"ref35","first-page":"2990","article-title":"Continual learning with deep generative replay","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Shin"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512176"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2022.3186909"},{"key":"ref38","article-title":"Overcoming catastrophic forgetting in graph neural networks","author":"Liu","year":"2020","journal-title":"arXiv:2012.06002"},{"key":"ref39","article-title":"Lifelong graph learning","author":"Wang","year":"2020","journal-title":"arXiv:2009.00647"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3412754"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2021.3056071"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/3511808.3557427"},{"key":"ref43","article-title":"Graph neural networks with continual learning for fake news detection from social media","author":"Han","year":"2020","journal-title":"arXiv:2007.03316"},{"key":"ref44","doi-asserted-by":"crossref","first-page":"824655","DOI":"10.3389\/frai.2022.824655","article-title":"Catastrophic forgetting in deep graph networks: A graph classification benchmark","volume":"5","author":"Carta","year":"2022","journal-title":"Frontiers Artif. Intell."},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.emnlp-main.237"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.119098"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/3477314.3507113"},{"key":"ref48","article-title":"A continual relation extraction approach for knowledge graph completeness (short paper)","volume-title":"Proc. 26th Int. Conf. Theory Pract. Digit. Libraries (TPDL), CEUR Workshop","author":"Efeoglu"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN55064.2022.9892557"},{"key":"ref50","article-title":"Lifelong learning of graph neural networks for open-world node classification","author":"Galke","year":"2020","journal-title":"arXiv:2006.14422"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3411963"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220024"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/3184558.3191526"},{"issue":"1","key":"ref54","first-page":"571","article-title":"Dynamic network embedding by modeling triadic closure process","volume-title":"Proc. AAAI Conf. Artif. Intell.","volume":"32","author":"Zhou"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401092"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3358106"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3450112"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.6142"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2019.2935173"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2022.3144343"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.01434"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2021.3082067"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58589-1_15"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-002-0743-x"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2016\/06\/063206"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.2748\/tmj\/1325886283"},{"key":"ref68","first-page":"6666","article-title":"Generative causal explanations for graph neural networks","volume-title":"Proc. ICML","author":"Lin"},{"key":"ref69","article-title":"Graph information bottleneck for subgraph recognition","author":"Yu","year":"2020","journal-title":"arXiv:2010.05563"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2022.3165618"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2022.3171398"},{"key":"ref72","article-title":"DropEdge: Towards deep graph convolutional networks on node classification","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Rong"},{"key":"ref73","first-page":"13006","article-title":"CGLB: Benchmark tasks for continual graph learning","volume-title":"Proc. 36th Conf. Neural Inf. Process. Syst. Datasets Benchmarks Track","author":"Zhang"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009953814988"},{"key":"ref75","first-page":"22118","article-title":"Open graph benchmark: Datasets for machine learning on graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Hu"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482193"},{"key":"ref77","first-page":"6861","article-title":"Simplifying graph convolutional networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wu"},{"key":"ref78","article-title":"Graph attention networks","author":"Veli\u010dkovi\u0107","year":"2017","journal-title":"arXiv:1710.10903"},{"key":"ref79","article-title":"How powerful are graph neural networks?","author":"Xu","year":"2018","journal-title":"arXiv:1810.00826"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV48922.2021.00116"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00552"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00459"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i8.20871"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3532058"},{"key":"ref85","first-page":"19580","article-title":"Directed graph contrastive learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Tong"},{"key":"ref86","first-page":"7793","article-title":"Beyond homophily in graph neural networks: Current limitations and effective designs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Zhu"},{"key":"ref87","article-title":"Understanding and improving graph injection attack by promoting unnoticeability","author":"Chen","year":"2022","journal-title":"arXiv:2202.08057"}],"container-title":["IEEE Transactions on Neural Networks and Learning Systems"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/5962385\/10772360\/10225445-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5962385\/10772360\/10225445.pdf?arnumber=10225445","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T19:08:00Z","timestamp":1733252880000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10225445\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12]]},"references-count":87,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tnnls.2023.3303454","relation":{},"ISSN":["2162-237X","2162-2388"],"issn-type":[{"value":"2162-237X","type":"print"},{"value":"2162-2388","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12]]}}}