{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T02:35:48Z","timestamp":1772159748620,"version":"3.50.1"},"reference-count":74,"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":[{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"publisher","award":["202006320051"],"award-info":[{"award-number":["202006320051"]}],"id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"publisher"}]},{"name":"ARC Future Fellowship","award":["FT210100303"],"award-info":[{"award-number":["FT210100303"]}]}],"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.3269795","type":"journal-article","created":{"date-parts":[[2023,4,28]],"date-time":"2023-04-28T14:26:51Z","timestamp":1682692011000},"page":"12932-12943","source":"Crossref","is-referenced-by-count":5,"title":["Progressive Hard Negative Masking: From Global Uniformity to Local Tolerance"],"prefix":"10.1109","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7042-5640","authenticated-orcid":false,"given":"Qingqiang","family":"Sun","sequence":"first","affiliation":[{"name":"School of Computer Science and Engineering, University of New South Wales, Sydney, NSW, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6572-2600","authenticated-orcid":false,"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, University of New South Wales, Sydney, NSW, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2396-7225","authenticated-orcid":false,"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[{"name":"Antai College of Economics and Management, Shanghai Jiao Tong University University, Shanghai, China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1038\/nature14539"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2009.5206848"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.243"},{"key":"ref5","article-title":"BERT: Pre-training of deep bidirectional transformers for language understanding","author":"Devlin","year":"2018"},{"key":"ref6","first-page":"5754","article-title":"XLNet: Generalized autoregressive pretraining for language understanding","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Yang"},{"key":"ref7","article-title":"Semi-supervised classification with graph convolutional networks","author":"Kipf","year":"2016"},{"key":"ref8","article-title":"Graph attention networks","author":"Veli\u010dkovi\u0107","year":"2017"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10602-1_48"},{"key":"ref10","article-title":"Representation learning with contrastive predictive coding","author":"Oord","year":"2018"},{"key":"ref11","article-title":"Learning deep representations by mutual information estimation and maximization","author":"Hjelm","year":"2018"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00975"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.5555\/3524938.3525087"},{"key":"ref14","article-title":"Deep graph infomax","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Velickovic"},{"key":"ref15","article-title":"Deep graph contrastive representation learning","author":"Zhu","year":"2020"},{"key":"ref16","first-page":"15509","article-title":"Learning representations by maximizing mutual information across views","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"32","author":"Bachman"},{"key":"ref17","first-page":"297","article-title":"Noise-contrastive estimation: A new estimation principle for unnormalized statistical models","volume-title":"Proc. 13th Int. Conf. Artif. Intell. Statist. Workshop Conf. Proc.","author":"Gutmann"},{"key":"ref18","first-page":"6827","article-title":"What makes for good views for contrastive learning?","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Tian"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3090866"},{"key":"ref20","first-page":"9929","article-title":"Understanding contrastive representation learning through alignment and uniformity on the hypersphere","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wang"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.00252"},{"key":"ref22","article-title":"Contrastive learning with hard negative samples","author":"Robinson","year":"2020"},{"key":"ref23","article-title":"Conditional negative sampling for contrastive learning of visual representations","author":"Wu","year":"2020"},{"key":"ref24","first-page":"21798","article-title":"Hard negative mixing for contrastive learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Kalantidis"},{"key":"ref25","article-title":"i-Mix: A strategy for regularizing contrastive representation learning","author":"Lee","year":"2020"},{"key":"ref26","first-page":"10530","article-title":"Towards domain-agnostic contrastive learning","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Verma"},{"key":"ref27","first-page":"8765","article-title":"Debiased contrastive learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Chuang"},{"key":"ref28","article-title":"An empirical study of graph contrastive learning","author":"Zhu","year":"2021"},{"key":"ref29","first-page":"24332","article-title":"ProGCL: Rethinking hard negative mining in graph contrastive learning","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Xia"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11604"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00610"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/473"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.5121\/ijdkp.2013.3408"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3297001.3297062"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2019.01.012"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553380"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3069908"},{"key":"ref38","first-page":"1189","article-title":"Self-paced learning for latent variable models","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Kumar"},{"key":"ref39","article-title":"Active learning literature survey","author":"Settles","year":"2009"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1136\/vr.j3532"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/p19-1123"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.acl-main.689"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i05.6513"},{"key":"ref44","first-page":"751","article-title":"From baby steps to leapfrog: How \u201cless is more","volume-title":"Proc. Hum. Lang. Technol.: Annu. Conf. North Amer. Chapter Assoc. Comput. Linguistics","author":"Spitkovsky"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45439-5_46"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/N19-1119"},{"key":"ref47","article-title":"InfoGraph: Unsupervised and semi-supervised graph-level representation learning via mutual information maximization","author":"Sun","year":"2019"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380112"},{"key":"ref49","first-page":"4116","article-title":"Contrastive multi-view representation learning on graphs","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Hassani"},{"key":"ref50","first-page":"5812","article-title":"Graph contrastive learning with augmentations","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"You"},{"key":"ref51","first-page":"30414","article-title":"InfoGCL: Information-aware graph contrastive learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Xu"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/3488560.3498416"},{"key":"ref53","first-page":"21872","article-title":"Disentangled contrastive learning on graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Li"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403168"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/204"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2023.3271871"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3532058"},{"key":"ref58","first-page":"19580","article-title":"Directed graph contrastive learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Tong"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.109973"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3131584"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2022.3170559"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2022.3172903"},{"key":"ref63","first-page":"5171","article-title":"On variational bounds of mutual information","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Poole"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449802"},{"key":"ref65","article-title":"On mutual information maximization for representation learning","author":"Tschannen","year":"2019"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741093"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v31i1.10488"},{"key":"ref69","article-title":"Wiki-CS: A wikipedia-based benchmark for graph neural networks","author":"Mernyei","year":"2020"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"ref71","article-title":"Variational graph auto-encoders","author":"Kipf","year":"2016"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1016\/0377-0427(87)90125-7"},{"issue":"11","key":"ref73","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":"ref74","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2078195"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/10311056\/10111083.pdf?arnumber=10111083","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,13]],"date-time":"2024-05-13T13:39:18Z","timestamp":1715607558000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10111083\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,1]]},"references-count":74,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2023.3269795","relation":{"has-preprint":[{"id-type":"doi","id":"10.36227\/techrxiv.21203096","asserted-by":"object"},{"id-type":"doi","id":"10.36227\/techrxiv.21203096.v1","asserted-by":"object"}]},"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]]}}}