{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T05:27:57Z","timestamp":1780637277049,"version":"3.54.1"},"reference-count":65,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62172299"],"award-info":[{"award-number":["62172299"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Scientific Research Project of the Education Department of Zhejiang province","award":["Y202352570"],"award-info":[{"award-number":["Y202352570"]}]},{"DOI":"10.13039\/501100003399","name":"Science and Technology Commission of Shanghai Municipality","doi-asserted-by":"publisher","award":["22511105500"],"award-info":[{"award-number":["22511105500"]}],"id":[{"id":"10.13039\/501100003399","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput. Soc. Syst."],"published-print":{"date-parts":[[2025,10]]},"DOI":"10.1109\/tcss.2025.3551250","type":"journal-article","created":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T13:51:54Z","timestamp":1743601914000},"page":"3365-3379","source":"Crossref","is-referenced-by-count":3,"title":["Automated Graph Contrastive Learning Based on Node-Level and Edge-Level Learnable Augmentation"],"prefix":"10.1109","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-9088-5806","authenticated-orcid":false,"given":"Zeyu","family":"Zhao","sequence":"first","affiliation":[{"name":"College of Mathematics and Computer Science, Zhejiang A&F University, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5233-2192","authenticated-orcid":false,"given":"Jian","family":"Li","sequence":"additional","affiliation":[{"name":"College of Mathematics and Computer Science, Zhejiang A&F University, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7523-4827","authenticated-orcid":false,"given":"Guanjun","family":"Liu","sequence":"additional","affiliation":[{"name":"Key Laboratory of Embedded System and Service Computing, Ministry of Education, Tongji University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kipf","year":"2017"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2018.2871503"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2024.3423447"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2023.3335485"},{"key":"ref5","article-title":"Inductive representation learning on large graphs","volume":"30","author":"Hamilton","year":"2017","journal-title":"Proc. Neural Inf. Process. Syst."},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3695863"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICSS55994.2022.00019"},{"key":"ref8","first-page":"19075","article-title":"Handling missing data with graph representation learning","volume":"33","author":"You","year":"2020","journal-title":"Proc. Neural Inf. Process. Syst."},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s40747-024-01491-3"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2024.3349850"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2024.3374357"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449952"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i4.25553"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2020.11.016"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3437963.3441738"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16552"},{"key":"ref17","article-title":"Mixup: Beyond empirical risk minimization","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Zhang","year":"2018"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.114711"},{"key":"ref19","first-page":"26911","article-title":"Learning from counterfactual links for link prediction","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Zhao","year":"2022"},{"issue":"12","key":"ref20","first-page":"11015","article-title":"Data augmentation for graph neural networks","volume":"35","author":"Tong","year":"2021","journal-title":"Proc. AAAI Conf. Artif. Intell."},{"key":"ref21","first-page":"5812","article-title":"Graph contrastive learning with augmentations","volume":"33","author":"You","year":"2020","journal-title":"Proc. Neural Inf. Process. Syst."},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52688.2022.00016"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2984958"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2024.3358801"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-022-03233-9"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3151315"},{"key":"ref27","article-title":"Variational graph auto-encoders","author":"Kipf","year":"2016"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2017.2765202"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2023.3271140"},{"key":"ref32","article-title":"Deep graph contrastive representation learning","author":"Zhu","year":"2020"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.01505"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449802"},{"key":"ref35","first-page":"6827","article-title":"What makes for good views for contrastive learning?","volume":"33","author":"Tian","year":"2020","journal-title":"Proc. Neural Inf. Process. Syst."},{"key":"ref36","first-page":"12121","article-title":"Graph contrastive learning automated","volume-title":"Int. Conf. Mach. Learn. (PMLR)","author":"You","year":"2021"},{"key":"ref37","first-page":"15920","article-title":"Adversarial graph augmentation to improve graph contrastive learning","volume":"34","author":"Suresh","year":"2021","journal-title":"Proc. Neural Inf. Process. Syst."},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i8.20871"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3151829"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2023.127019"},{"key":"ref41","article-title":"Link prediction based on graph neural networks","volume":"31","author":"Zhang","year":"2018","journal-title":"Proc. Neural Inf. Process. Syst."},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2024.106207"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2023.120066"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2024.3371592"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/3575637.3575646"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2023.110518"},{"key":"ref47","article-title":"Hide-and-seek: A data augmentation technique for weakly-supervised localization and beyond","author":"Singh","year":"2018"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2023.3282258"},{"key":"ref49","first-page":"47","article-title":"A survey on deep graph generation: Methods and applications","volume-title":"Proc. Learn. Graphs Conf.","author":"Zhu","year":"2022"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.5555\/3524938.3525087"},{"key":"ref51","article-title":"Improved baselines with momentum contrastive learning","author":"Chen","year":"2020"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i18.17986"},{"key":"ref53","article-title":"Pre-training molecular graph representation with 3D geometry","author":"Liu","year":"2022","journal-title":"Proc. Workshop Geometrical Topological Representation Learn. (ICLR)"},{"key":"ref54","first-page":"36839","article-title":"Boosting graph contrastive learning via graph contrastive saliency","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wei","year":"2023"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2023.12.037"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2024.3370918"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2024.3453757"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2023\/260"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599768"},{"key":"ref60","article-title":"Adam: A method for stochastic optimization","author":"Kingma","year":"2014"},{"key":"ref61","article-title":"How powerful are graph neural networks?","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Xu","year":"2019"},{"key":"ref62","article-title":"TUDataset: A collection of benchmark datasets for learning with graphs","author":"Morris","year":"2020"},{"key":"ref63","article-title":"InfoGraph: Unsupervised and semi-supervised graph-level representation learning via mutual information maximization","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Sun","year":"2020"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1145\/3638054"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2024.120378"}],"container-title":["IEEE Transactions on Computational Social Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6570650\/11194048\/10947548.pdf?arnumber=10947548","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T17:50:10Z","timestamp":1759859410000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10947548\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10]]},"references-count":65,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tcss.2025.3551250","relation":{},"ISSN":["2329-924X","2373-7476"],"issn-type":[{"value":"2329-924X","type":"electronic"},{"value":"2373-7476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10]]}}}