{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T16:05:07Z","timestamp":1778601907969,"version":"3.51.4"},"reference-count":43,"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\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1936103"],"award-info":[{"award-number":["U1936103"]}],"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":["61921003"],"award-info":[{"award-number":["61921003"]}],"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":["62202164"],"award-info":[{"award-number":["62202164"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"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.3273782","type":"journal-article","created":{"date-parts":[[2023,5,8]],"date-time":"2023-05-08T19:04:24Z","timestamp":1683572664000},"page":"12785-12798","source":"Crossref","is-referenced-by-count":12,"title":["MINING: Multi-Granularity Network Alignment Based on Contrastive Learning"],"prefix":"10.1109","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3242-150X","authenticated-orcid":false,"given":"Zhongbao","family":"Zhang","sequence":"first","affiliation":[{"name":"State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3424-206X","authenticated-orcid":false,"given":"Shuai","family":"Gao","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4266-7527","authenticated-orcid":false,"given":"Sen","family":"Su","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4562-2279","authenticated-orcid":false,"given":"Li","family":"Sun","sequence":"additional","affiliation":[{"name":"North China Electric Power University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-4983-1158","authenticated-orcid":false,"given":"Ruiyang","family":"Chen","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271675"},{"key":"ref35","first-page":"1","article-title":"Graph attention networks","author":"velickovic","year":"2018","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref12","article-title":"Deep adversarial network alignment","author":"derr","year":"2019"},{"key":"ref34","first-page":"1","article-title":"Semi-supervised classification with graph convolutional networks","author":"kipf","year":"2017","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.67.026112"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939766"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.12014"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271705"},{"key":"ref31","first-page":"1824","article-title":"Structural representation learning for user alignment across social networks","volume":"32","author":"liu","year":"2020","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-68288-4_37"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155456"},{"key":"ref33","first-page":"1881","article-title":"Network alignment with holistic embeddings","volume":"35","author":"huynh","year":"2023","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.3301996"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467331"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.144"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2432811"},{"key":"ref17","first-page":"1","article-title":"Learning deep representations by mutual information estimation and maximization","author":"hjelm","year":"2019","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3511945"},{"key":"ref16","article-title":"Self-supervised learning: Generative or contrastive","author":"liu","year":"2020"},{"key":"ref38","article-title":"Discrete geometric analysis of message passing algorithm on graphs","author":"watanabe","year":"2010"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00975"},{"key":"ref18","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":"ref24","first-page":"1024","article-title":"Inductive representation learning on large graphs","author":"hamilton","year":"2017","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271788"},{"key":"ref26","article-title":"Representation learning with contrastive predictive coding","author":"van den oord","year":"2018"},{"key":"ref25","first-page":"5171","article-title":"On variational bounds of mutual information","author":"poole","year":"2019","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref20","first-page":"5812","article-title":"Graph contrastive learning with augmentations","author":"you","year":"2020","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i12.17293"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i11.17206"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403168"},{"key":"ref21","article-title":"Deep graph contrastive representation learning","author":"zhu","year":"2020"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467227"},{"key":"ref28","first-page":"3111","article-title":"Distributed representations of words and phrases and their compositionality","author":"mikolov","year":"2013","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-24465-5_16"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983864"},{"key":"ref8","first-page":"1774","article-title":"Aligning users across social networks using network embedding","author":"liu","year":"2016","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3411924"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783268"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939849"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3068777.3068781"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313484"},{"key":"ref5","first-page":"1823","article-title":"Predict anchor links across social networks via an embedding approach","author":"man","year":"2016","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/3511808.3557364"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/10311056\/10120956.pdf?arnumber=10120956","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,11]],"date-time":"2023-12-11T20:53:45Z","timestamp":1702328025000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10120956\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,1]]},"references-count":43,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2023.3273782","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]]}}}