{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T13:07:32Z","timestamp":1775912852790,"version":"3.50.1"},"reference-count":52,"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":"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\/501100018537","name":"National Science and Technology Major Project","doi-asserted-by":"publisher","award":["2021ZD0114501"],"award-info":[{"award-number":["2021ZD0114501"]}],"id":[{"id":"10.13039\/501100018537","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1109\/tkde.2024.3471659","type":"journal-article","created":{"date-parts":[[2024,9,30]],"date-time":"2024-09-30T17:30:31Z","timestamp":1727717431000},"page":"8066-8078","source":"Crossref","is-referenced-by-count":1,"title":["Efficient and Effective Augmentation Framework With Latent Mixup and Label-Guided Contrastive Learning for Graph Classification"],"prefix":"10.1109","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-6590-2905","authenticated-orcid":false,"given":"Aoting","family":"Zeng","sequence":"first","affiliation":[{"name":"East China Normal University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3049-9917","authenticated-orcid":false,"given":"Liping","family":"Wang","sequence":"additional","affiliation":[{"name":"East China Normal University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6572-2600","authenticated-orcid":false,"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of New South Wales, Sydney, NSW, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2396-7225","authenticated-orcid":false,"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3581783.3612360"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3271677"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3313059"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btz718"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3105544"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3119626"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.3390\/ijgi12030100"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.aiopen.2021.01.001"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11782"},{"key":"ref11","first-page":"1","article-title":"A fair comparison of graph neural networks for graph classification","volume-title":"Proc. 8th Int. Conf. Learn. Representations","author":"Errica"},{"key":"ref12","first-page":"1","article-title":"ISONN: Isomorphic neural network for graph repre-sentation learning and classification","volume-title":"Proc. Graph Representation Learn. Workshop 33rd Conf. Neural Inf. Process. Syst.","author":"Meng"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449802"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i12.17315"},{"key":"ref15","first-page":"5812","article-title":"Graph contrastive learning with augmentations","volume-title":"Proc. Neural Inf. Process. Syst. Neural Inf. Process. Syst.","author":"You"},{"key":"ref16","first-page":"1","article-title":"DropEdge: Towards deep graph convolutional networks on node classification","author":"Rong","year":"2019","journal-title":"Proc. Int. Conf. Learn. Representations"},{"key":"ref17","article-title":"GraphCrop: Subgraph cropping for graph classification","author":"Wang","year":"2020"},{"key":"ref18","first-page":"8230","article-title":"G-Mixup: Graph data augmentation for graph classification","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Han"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i7.20767"},{"key":"ref20","first-page":"21335","article-title":"Graph mixup with soft alignments","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Ling"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449796"},{"key":"ref22","first-page":"1","article-title":"mixup: Beyond empirical risk minimization","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Zhang"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00612"},{"key":"ref24","first-page":"6438","article-title":"Manifold mixup: Better representations by interpolating hidden states","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Verma"},{"key":"ref25","article-title":"Augmenting data with mixup for sentence classification: An empirical study","author":"Guo","year":"2019"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2022.emnlp-main.57"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.acl-main.194"},{"key":"ref28","first-page":"1","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kipf"},{"key":"ref29","first-page":"1","article-title":"How powerful are graph neural networks?","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Xu"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/BF00994018"},{"key":"ref31","first-page":"5275","article-title":"Puzzle mix: Exploiting saliency and local statistics for optimal mixup","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Kim"},{"key":"ref32","article-title":"Tudataset: A collection of benchmark datasets for learning with graphs","author":"Morris","year":"2020"},{"key":"ref33","first-page":"22118","article-title":"Open graph benchmark: Datasets for machine learning on graphs","volume":"33","author":"Hu","year":"2020","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref34","first-page":"15920","article-title":"Adversarial graph augmentation to improve graph contrastive learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Suresh"},{"key":"ref35","first-page":"1","article-title":"Spectral augmentation for self-supervised learning on graphs","volume-title":"Proc. 11th Int. Conf. Learn. Representations","author":"Lin"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i8.20871"},{"issue":"56","key":"ref37","first-page":"1929","article-title":"Dropout: A simple way to prevent neural networks from overfitting","volume":"15","author":"Srivastava","year":"2014","journal-title":"J. Mach. Learn. Res."},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i1.19938"},{"key":"ref39","first-page":"1","article-title":"Saliencymix: A saliency guided data augmentation strategy for better regularization","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Uddin"},{"key":"ref40","first-page":"1","article-title":"Co-mixup: Saliency guided joint mixup with supermodular diversity","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kim"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.01358"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52688.2022.01858"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.01462"},{"key":"ref44","first-page":"14224","article-title":"Tokenmixup: Efficient attention-guided token-level data augmentation for transformers","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Choi"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.findings-acl.285"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.emnlp-main.691"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV51070.2023.01442"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP39728.2021.9414483"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/MMSP53017.2021.9733591"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403168"},{"key":"ref51","article-title":"Deep graph contrastive representation learning","author":"Zhu","year":"2020"},{"key":"ref52","first-page":"18661","article-title":"Supervised contrastive learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Khosla"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/69\/10750897\/10700965.pdf?arnumber=10700965","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T00:36:52Z","timestamp":1732667812000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10700965\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12]]},"references-count":52,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2024.3471659","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12]]}}}