{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T01:16:35Z","timestamp":1780622195066,"version":"3.54.1"},"reference-count":22,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61672108"],"award-info":[{"award-number":["61672108"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Open Subject Funds of Science and Technology on Information Transmission and Dissemination in the Communication Networks Laboratory","award":["SKX182010049"],"award-info":[{"award-number":["SKX182010049"]}]},{"DOI":"10.13039\/501100002663","name":"Northwestern Polytechnical University","doi-asserted-by":"publisher","award":["500419319"],"award-info":[{"award-number":["500419319"]}],"id":[{"id":"10.13039\/501100002663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002663","name":"Northwestern Polytechnical University","doi-asserted-by":"publisher","award":["2019PTB-019"],"award-info":[{"award-number":["2019PTB-019"]}],"id":[{"id":"10.13039\/501100002663","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Industrial Internet Innovation and Development Project 2018 of China"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2951785","type":"journal-article","created":{"date-parts":[[2019,11,6]],"date-time":"2019-11-06T20:58:20Z","timestamp":1573073900000},"page":"162179-162191","source":"Crossref","is-referenced-by-count":2,"title":["Entity Alignment Algorithm Based on Dual-Attention and Incremental Learning Mechanism"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7848-5421","authenticated-orcid":false,"given":"Yang","family":"Yang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Maojie","family":"Hao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yonghua","family":"Huo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Liandong","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhipeng","family":"Gao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","first-page":"1","article-title":"Learning knowledge representation across knowledge graphs","author":"cai","year":"2017","journal-title":"Proc AAAI Workshop Knowl -Based Techn Problem Solving Reasoning (KnowProS)"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/611"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-018-1191-0"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0216046"},{"key":"ref14","article-title":"Efficient estimation of word representations in vector space","author":"tomas","year":"2013","journal-title":"arXiv 1301 3781 [cs]"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D17-1277"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/N18-1071"},{"key":"ref17","first-page":"1106","article-title":"ImageNet classification with deep convolutional neural networks","author":"krizhevsky","year":"2012","journal-title":"Proc Conf Neural Inf Process Syst (NIPS)"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/K16-1025"},{"key":"ref19","first-page":"5998","article-title":"Attention is all you need","author":"vaswani","year":"2017","journal-title":"Proc Conf Neural Inf Process Syst (NIPS)"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2017.11.064"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1186\/1472-6947-15-S1-S4"},{"key":"ref6","first-page":"1535","article-title":"Entity alignment algorithm for knowledge graph of representation learning","volume":"39","author":"zhu","year":"2018","journal-title":"J Northeast Univ (Nat Sci )"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25093-4_14"},{"key":"ref8","first-page":"2787","article-title":"Translating embeddings for modeling multi-relational data","author":"bordes","year":"2013","journal-title":"Proc 26th Int Conf Neural Inf Process Syst (NIPS)"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2754499"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MIS.2005.16"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1126\/science.130.3381.954"},{"key":"ref9","first-page":"985","article-title":"Knowledge graph completion with adaptive sparse transfer matrix","author":"ji","year":"2016","journal-title":"Proc AAAI Conf Artif Intell (AAAI)"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-017-6561-3"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/K17-1008"},{"key":"ref21","first-page":"2170","article-title":"Joint neural entity disambiguation with output space search","author":"shahbazi","year":"2018","journal-title":"Proc Int'l Conf Computational Linguistics (COLING)"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08892565.pdf?arnumber=8892565","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T19:39:52Z","timestamp":1628624392000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8892565\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2951785","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}