{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T07:11:56Z","timestamp":1768633916231,"version":"3.49.0"},"reference-count":51,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100018537","name":"National Science and Technology Major Project","doi-asserted-by":"publisher","award":["2021ZD0112500"],"award-info":[{"award-number":["2021ZD0112500"]}],"id":[{"id":"10.13039\/501100018537","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62372211"],"award-info":[{"award-number":["62372211"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62272191"],"award-info":[{"award-number":["62272191"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Science and Technology Development Program of Jilin Province","award":["20250102216JC"],"award-info":[{"award-number":["20250102216JC"]}]},{"DOI":"10.13039\/501100004608","name":"Natural Science Foundation of Jiangsu Province","doi-asserted-by":"publisher","award":["BK20210642"],"award-info":[{"award-number":["BK20210642"]}],"id":[{"id":"10.13039\/501100004608","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1109\/tpami.2025.3574354","type":"journal-article","created":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T13:36:41Z","timestamp":1749130601000},"page":"8073-8087","source":"Crossref","is-referenced-by-count":2,"title":["AdaGCL+: An Adaptive Subgraph Contrastive Learning Toward Tackling Topological Bias"],"prefix":"10.1109","volume":"47","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0845-9521","authenticated-orcid":false,"given":"Yili","family":"Wang","sequence":"first","affiliation":[{"name":"School of Artificial Intelligence, Jilin University, Changchun, China"}]},{"given":"Yaohua","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Artificial Intelligence, Nanjing University of Information Science and Technology, Nanjing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9170-2424","authenticated-orcid":false,"given":"Ninghao","family":"Liu","sequence":"additional","affiliation":[{"name":"University of Georgia, Athens, GA, USA"}]},{"given":"Rui","family":"Miao","sequence":"additional","affiliation":[{"name":"School of Artificial Intelligence, Jilin University, Changchun, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3288-5195","authenticated-orcid":false,"given":"Ying","family":"Wang","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Jilin University, Changchun, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9448-7689","authenticated-orcid":false,"given":"Xin","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Artificial Intelligence, Jilin University, Changchun, China"}]}],"member":"263","reference":[{"key":"ref1","first-page":"6861","article-title":"Simplifying graph convolutional networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wu"},{"key":"ref2","first-page":"21834","article-title":"Dirichlet energy constrained learning for deep graph neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zhou"},{"key":"ref3","first-page":"4917","article-title":"Towards deeper graph neural networks with differentiable group normalization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zhou"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2022.3174515"},{"key":"ref5","first-page":"1025","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Hamilton"},{"key":"ref6","article-title":"Semi-supervised classification with graph convolutional networks","author":"Kipf","year":"2016"},{"key":"ref7","article-title":"Graph attention networks","author":"Veli\u010dkovi\u0107","year":"2017"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539249"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i4.20316"},{"key":"ref10","article-title":"EXACT: Scalable graph neural networks training via extreme activation compression","volume-title":"Proc. 10th Int. Conf. Learn. Representations","author":"Liu"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2024.124472"},{"key":"ref12","article-title":"FastGCN: Fast learning with graph convolutional networks via importance sampling","author":"Chen","year":"2018"},{"key":"ref13","article-title":"Stochastic training of graph convolutional networks with variance reduction","author":"Chen","year":"2017"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330925"},{"key":"ref15","article-title":"InfoGraph: Unsupervised and semi-supervised graph-level representation learning via mutual information maximization","author":"Sun","year":"2019"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.5555\/3495724.3497510"},{"key":"ref17","first-page":"12310","article-title":"Barlow twins: Self-supervised learning via redundancy reduction","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Zbontar"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.5555\/3524938.3525087"},{"key":"ref19","first-page":"30414","article-title":"InfoGCL: Information-aware graph contrastive learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Xu"},{"key":"ref20","article-title":"Learning graph augmentations to learn graph representations","author":"Hassani","year":"2022"},{"key":"ref21","first-page":"12121","article-title":"Graph contrastive learning automated","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"You"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/473"},{"key":"ref23","article-title":"DropEdge: Towards deep graph convolutional networks on node classification","author":"Rong","year":"2019"},{"key":"ref24","article-title":"Bootstrapped representation learning on graphs","author":"Thakoor","year":"2021"},{"key":"ref25","first-page":"5812","article-title":"Graph contrastive learning with augmentations","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"You"},{"key":"ref26","first-page":"15920","article-title":"Adversarial graph augmentation to improve graph contrastive learning","volume":"34","author":"Suresh","year":"2021","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref27","first-page":"6","article-title":"How powerful are graph neural networks?","volume-title":"Proc. 7th Int. Conf. Learn. Representations","author":"Xu","year":"2019"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219890"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219947"},{"key":"ref30","article-title":"Sign: Scalable inception graph neural networks","author":"Rossi","year":"2020"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403296"},{"key":"ref32","article-title":"GraphSAINT: Graph sampling based inductive learning method","author":"Zeng","year":"2019"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977653.ch7"},{"key":"ref34","article-title":"Cap: Co-adversarial perturbation on weights and features for improving generalization of graph neural networks","author":"Xue","year":"2021"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403168"},{"key":"ref36","article-title":"Deep graph infomax","volume-title":"Proc. Int. Conf. Learn. Representations (Poster)","author":"Velickovic"},{"key":"ref37","first-page":"4116","article-title":"Contrastive multi-view representation learning on graphs","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Hassani"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.109631"},{"key":"ref39","first-page":"20407","article-title":"Contrastive graph structure learning via information bottleneck for recommendation","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Wei"},{"key":"ref40","first-page":"1","article-title":"LightGCL: Simple yet effective graph contrastive learning for recommendation","volume-title":"Proc. 11th Int. Conf. Learn. Representations","author":"Cai"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449802"},{"key":"ref42","first-page":"6827","article-title":"What makes for good views for contrastive learning?","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Tian"},{"key":"ref43","first-page":"2958","article-title":"Adversarial weight perturbation helps robust generalization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Wu"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3172903"},{"key":"ref45","first-page":"22118","article-title":"Open graph benchmark: Datasets for machine learning on graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Hu"},{"key":"ref46","first-page":"20437","article-title":"Graph information bottleneck","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Wu"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58539-6_33"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1162\/qss_a_00021"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM50108.2020.00031"},{"key":"ref50","first-page":"10809","article-title":"Rethinking and scaling up graph contrastive learning: An extremely efficient approach with group discrimination","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zheng"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/3511808.3557228"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/34\/11118328\/11025469.pdf?arnumber=11025469","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T17:44:34Z","timestamp":1754588674000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11025469\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9]]},"references-count":51,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2025.3574354","relation":{},"ISSN":["0162-8828","2160-9292","1939-3539"],"issn-type":[{"value":"0162-8828","type":"print"},{"value":"2160-9292","type":"electronic"},{"value":"1939-3539","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9]]}}}