{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T21:10:50Z","timestamp":1780434650908,"version":"3.54.1"},"reference-count":77,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Science and Technology Innovation 2030","award":["2021ZD0201405"],"award-info":[{"award-number":["2021ZD0201405"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2023,12,1]]},"DOI":"10.1109\/tkde.2023.3271677","type":"journal-article","created":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T18:46:42Z","timestamp":1682966802000},"page":"12873-12886","source":"Crossref","is-referenced-by-count":39,"title":["OMG: Towards Effective Graph Classification Against Label Noise"],"prefix":"10.1109","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0177-8514","authenticated-orcid":false,"given":"Nan","family":"Yin","sequence":"first","affiliation":[{"name":"Mohamed Bin Zayed University of Artificial Intelligence, Abu Dhabi, UAE"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5659-3464","authenticated-orcid":false,"given":"Li","family":"Shen","sequence":"additional","affiliation":[{"name":"JD Explore Academy, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1059-0441","authenticated-orcid":false,"given":"Mengzhu","family":"Wang","sequence":"additional","affiliation":[{"name":"National University of Defense Technology, Changsha, Hunan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7987-3714","authenticated-orcid":false,"given":"Xiao","family":"Luo","sequence":"additional","affiliation":[{"name":"University of California, Los Angeles, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7552-201X","authenticated-orcid":false,"given":"Zhigang","family":"Luo","sequence":"additional","affiliation":[{"name":"National University of Defense Technology, Changsha, Hunan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7225-5449","authenticated-orcid":false,"given":"Dacheng","family":"Tao","sequence":"additional","affiliation":[{"name":"University of Sydney, Camperdown, NSW, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref13","first-page":"2539","article-title":"Weisfeiler-Lehman graph kernels","volume":"12","author":"shervashidze","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref57","article-title":"Bootstrap your own latent-a new approach to self-supervised learning","author":"grill","year":"2021","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2005.132"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btz768"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3446776"},{"key":"ref59","first-page":"395","article-title":"Vicinal risk minimization","author":"chapelle","year":"2001","journal-title":"Proc Conf Neural Inf Process Syst"},{"key":"ref14","article-title":"How powerful are graph neural networks?","author":"xu","year":"2019","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref58","first-page":"9929","article-title":"Understanding contrastive representation learning through alignment and uniformity on the hypersphere","author":"wang","year":"2020","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref53","article-title":"Noisy feature mixup","author":"lim","year":"2021"},{"key":"ref52","first-page":"11285","article-title":"Class2Simi: A noise reduction perspective on learning with noisy labels","author":"wu","year":"2021","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972825.71"},{"key":"ref55","first-page":"1294","article-title":"Are graph augmentations necessary? Simple graph contrastive learning for recommendation","author":"yu","year":"2022","journal-title":"Proc Int ACM SIGIR Conf Res Develop Inf Retrieval"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403117"},{"key":"ref54","first-page":"6438","article-title":"Manifold mixup: Better representations by interpolating hidden states","author":"verma","year":"2019","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.00160"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.240"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553380"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.00119"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3173318"},{"key":"ref50","first-page":"4805","article-title":"Hierarchical graph representation learning with differentiable pooling","author":"ying","year":"2018","journal-title":"Proc Conf Neural Inf Process Syst"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512156"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i12.17293"},{"key":"ref48","article-title":"Infograph: Unsupervised and semi-supervised graph-level representation learning via mutual information maximization","author":"sun","year":"2020","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref47","article-title":"Deep graph infomax","author":"velickovic","year":"2019","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref42","first-page":"5812","article-title":"Graph contrastive learning with augmentations","author":"you","year":"2020","journal-title":"Proc Conf Neural Inf Process Syst"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539248"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/317"},{"key":"ref43","first-page":"12121","article-title":"Graph contrastive learning automated","author":"you","year":"2021","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref49","first-page":"1263","article-title":"Neural message passing for quantum chemistry","author":"gilmer","year":"2017","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref8","article-title":"Accurate learning of graph representations with graph multiset pooling","author":"baek","year":"2021","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/392"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btx029"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3070843"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.3028705"},{"key":"ref6","first-page":"2186","article-title":"Anonymous walk embeddings","author":"ivanov","year":"2018","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00116"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/204"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i12.17319"},{"key":"ref34","first-page":"8536","article-title":"Co-teaching: Robust training of deep neural networks with extremely noisy labels","author":"han","year":"2018","journal-title":"Proc Conf Neural Inf Process Syst"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00975"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2022.3170559"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58520-4_21"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i12.17303"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.00536"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.39"},{"key":"ref33","article-title":"Robust training with ensemble consensus","author":"lee","year":"2020","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref77","first-page":"22118","article-title":"Open graph benchmark: Datasets for machine learning on graphs","author":"hu","year":"2020","journal-title":"Proc Conf Neural Inf Process Syst"},{"key":"ref32","first-page":"2206","article-title":"Can cross entropy loss be robust to label noise?","author":"feng","year":"2021","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref76","first-page":"2579","article-title":"Visualizing data using t-SNE","volume":"9","author":"van der maaten","year":"2008","journal-title":"J Mach Learn Res"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.3033673"},{"key":"ref1","article-title":"Semi-supervised classification with graph convolutional networks","author":"kipf","year":"2017","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449802"},{"key":"ref38","first-page":"1597","article-title":"A simple framework for contrastive learning of visual representations","author":"chen","year":"2020","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/17.1.107"},{"key":"ref70","first-page":"291","article-title":"Subgraph matching kernels for attributed graphs","author":"kriege","year":"2012","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783417"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449951"},{"key":"ref24","first-page":"9952","article-title":"Haar graph pooling","author":"wang","year":"2020","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1021\/jm00106a046"},{"key":"ref23","first-page":"545","article-title":"Hierarchical multi-view graph pooling with structure learning","volume":"35","author":"zhang","year":"2023","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"ref67","article-title":"Robust early-learning: Hindering the memorization of noisy labels","author":"xia","year":"2021","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref26","first-page":"1196","article-title":"Learning with noisy labels","author":"natarajan","year":"2013","journal-title":"Proc Conf Neural Inf Process Syst"},{"key":"ref25","article-title":"StructPool: Structured graph pooling via conditional random fields","author":"yuan","year":"2020","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bti1007"},{"key":"ref20","first-page":"3734","article-title":"Self-attention graph pooling","author":"lee","year":"2019","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref64","first-page":"2156","article-title":"Provably powerful graph networks","author":"maron","year":"2019","journal-title":"Proc Conf Neural Inf Process Syst"},{"key":"ref63","first-page":"2014","article-title":"Learning convolutional neural networks for graphs","author":"niepert","year":"2016","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref22","first-page":"18839","article-title":"Federated graph classification over Non-IID graphs","author":"xie","year":"2021","journal-title":"Proc Conf Neural Inf Process Syst"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52688.2022.00016"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11782"},{"key":"ref65","first-page":"2625","article-title":"Weisfeiler and Lehman go cellular: CW networks","author":"bodnar","year":"2021","journal-title":"Proc Conf Neural Inf Process Syst"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV48922.2021.00935"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3152527"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.00684"},{"key":"ref60","article-title":"Intriguing properties of neural networks","author":"szegedy","year":"2013","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref62","article-title":"A simple yet effective baseline for non-attributed graph classification","author":"cai","year":"2019","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref61","article-title":"Mixup: Beyond empirical risk minimization","author":"zhang","year":"2018","journal-title":"Proc Int Conf Learn Representations"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/10311056\/10113198.pdf?arnumber=10113198","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,11]],"date-time":"2023-12-11T20:53:36Z","timestamp":1702328016000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10113198\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,1]]},"references-count":77,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2023.3271677","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":[[2023,12,1]]}}}