{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T18:46:17Z","timestamp":1767033977621},"reference-count":65,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61906219"],"award-info":[{"award-number":["61906219"]}],"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":[[2021]]},"DOI":"10.1109\/tkde.2021.3115669","type":"journal-article","created":{"date-parts":[[2021,9,27]],"date-time":"2021-09-27T21:28:12Z","timestamp":1632778092000},"page":"1-1","source":"Crossref","is-referenced-by-count":8,"title":["Cross-Temporal Snapshot Alignment for Dynamic Networks"],"prefix":"10.1109","author":[{"given":"Shangsong","family":"Liang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaowei","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zaiqiao","family":"Meng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiang","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.2997861"},{"key":"ref2","first-page":"1774","article-title":"Aligning users across social networks using network embedding","volume-title":"Proc. 25th Int. Joint Conf. Artif. Intell.","author":"Liu"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D18-1032"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313499"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2911516"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/BigData47090.2019.9006430"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btx246"},{"key":"ref8","first-page":"5998","article-title":"Attention is all you need","volume-title":"Proc. 31st Int. Conf. Neural Inf. Process. Syst.","author":"Vaswani"},{"key":"ref9","first-page":"5998","article-title":"Attention is all you need","author":"Vaswani","year":"2017","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/N18-2074"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22263-4_1"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/NDT.2009.5272173"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2012.184"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/SocialCom.2013.53"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2872427.2883002"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33167-1_18"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783268"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2588559"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2015.114"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271788"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2009.0099"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btz119"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.12051"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2832211"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33014269"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3358056"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313625"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"ref30","first-page":"3111","article-title":"Distributed representations of words and phrases and their compositionality","volume-title":"Proc. 26th Int. Conf. Neural Inf. Process. Syst.","author":"Mikolov"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741093"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467327"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3377850"},{"key":"ref34","first-page":"1","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kipf"},{"key":"ref35","first-page":"1024","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. 31st Int. Conf. Neural Inf. Process. Syst.","author":"Hamilton"},{"key":"ref36","first-page":"1","article-title":"Graph attention networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Veli\u010dkovi\u0107"},{"key":"ref37","first-page":"6507","article-title":"Semi-supervisedly co-embedding attributed networks","volume-title":"Proc. 33rd Int. Conf. Neural Inf. Process. Syst.","author":"Meng"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/3289600.3291015"},{"key":"ref39","first-page":"3734","article-title":"Self-attention graph pooling","volume-title":"Proc. 36th Int. Conf. Mach. Learn.","author":"Lee"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2591009"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11257"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132919"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5984"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220054"},{"key":"ref45","first-page":"3462","article-title":"Know-evolve: Deep temporal reasoning for dynamic knowledge graphs","volume-title":"Proc. 34th Int. Conf. Mach. Learn.","author":"Trivedi"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.18653\/vl\/N19-142"},{"key":"ref47","first-page":"1","article-title":"Variational self-attention model for sentence representation","volume-title":"Proc. 3rd Workshop Bayesian Deep Learn.","author":"Zhang"},{"key":"ref48","first-page":"5753","article-title":"XLNet: Generalized autoregressive pretraining for language understanding","volume-title":"Proc. 33rd Int. Conf. Neural Inf. Process. Syst.","author":"Yang"},{"issue":"8","key":"ref49","article-title":"Language models are unsupervised multitask learners","volume":"1","author":"Radford","year":"2019","journal-title":"OpenAI Blog"},{"key":"ref50","first-page":"1","article-title":"ALBERT: A lite bert for self-supervised learning of language representations","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Lan"},{"key":"ref51","first-page":"1","article-title":"Are transformers universal approximators of sequence-to-sequence functions?","author":"Yun","year":"2019","journal-title":"Proc. Int. Conf. Learn. Representations"},{"key":"ref52","first-page":"2407","article-title":"Self-attentive hawkes process","volume-title":"Proc. Mach. Learn. Syst.","author":"Zhang"},{"key":"ref53","article-title":"RoBERTa: A robustly optimized BERT pretraining approach","author":"Liu","year":"2019","journal-title":"Proc. Int. Conf. Learn. Representations"},{"key":"ref54","first-page":"1","article-title":"Universal transformers","author":"Dehghani","year":"2018","journal-title":"Proc. Int. Conf. Learn. Representations"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623645"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1002\/asi.21015"},{"key":"ref57","article-title":"Snap datasets: Stanford large network dataset collection; 2014,","author":"Leskovec","year":"2016"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772756"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-68288-4_37"},{"key":"ref60","first-page":"1","article-title":"Inductive representation learning on temporal graphs","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Xu"},{"key":"ref61","first-page":"1","article-title":"Encoding word order in complex embeddings","author":"Wang","year":"2019","journal-title":"Proc. Int. Conf. Learn. Representations"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2023.127063"},{"key":"ref63","volume-title":"Search Engines: Information Retrieval in Practice","volume":"520","author":"Croft","year":"2010"},{"key":"ref64","first-page":"1","article-title":"Adam: A method for stochastic optimization","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kingma"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-011-0841-3"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/4358933\/09548829.pdf?arnumber=9548829","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T22:24:26Z","timestamp":1705011866000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9548829\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":65,"URL":"https:\/\/doi.org\/10.1109\/tkde.2021.3115669","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":[[2021]]}}}