{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T01:10:57Z","timestamp":1777338657627,"version":"3.51.4"},"reference-count":66,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"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":["62325604"],"award-info":[{"award-number":["62325604"]}],"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":["62276271"],"award-info":[{"award-number":["62276271"]}],"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":[[2024,12]]},"DOI":"10.1109\/tkde.2024.3464516","type":"journal-article","created":{"date-parts":[[2024,9,26]],"date-time":"2024-09-26T17:50:41Z","timestamp":1727373041000},"page":"8206-8219","source":"Crossref","is-referenced-by-count":18,"title":["FedEAN: Entity-Aware Adversarial Negative Sampling for Federated Knowledge Graph Reasoning"],"prefix":"10.1109","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2489-573X","authenticated-orcid":false,"given":"Lingyuan","family":"Meng","sequence":"first","affiliation":[{"name":"School of Computer, National University of Defense Technology, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4837-455X","authenticated-orcid":false,"given":"Ke","family":"Liang","sequence":"additional","affiliation":[{"name":"School of Computer, National University of Defense Technology, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9044-4841","authenticated-orcid":false,"given":"Hao","family":"Yu","sequence":"additional","affiliation":[{"name":"School of Computer, National University of Defense Technology, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9894-0062","authenticated-orcid":false,"given":"Yue","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Computer, National University of Defense Technology, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1491-4594","authenticated-orcid":false,"given":"Sihang","family":"Zhou","sequence":"additional","affiliation":[{"name":"College of Intelligence Science and Technology, National University of Defense Technology, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3900-4204","authenticated-orcid":false,"given":"Meng","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Computer, National University of Defense Technology, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9066-1475","authenticated-orcid":false,"given":"Xinwang","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Computer, National University of Defense Technology, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2023.3291563"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2024.106479"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3577031"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2024.3362584"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/tpami.2024.3417451"},{"key":"ref6","article-title":"A survey of deep graph clustering: Taxonomy, challenge, and application","author":"Liu","year":"2022"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3511998"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2754499"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i9.28935"},{"key":"ref10","first-page":"1","article-title":"Deep temporal graph clustering","volume-title":"Proc. 12th Int. Conf. Learn. Representations","author":"Liu"},{"key":"ref11","article-title":"G$^{2}$2uardFL: Safeguarding federated learning against backdoor attacks through attributed client graph clustering","author":"Yu","year":"2023"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2024.3386168"},{"key":"ref13","doi-asserted-by":"crossref","DOI":"10.24963\/ijcai.2024\/687","article-title":"FactCHD: Benchmarking fact-conflicting hallucination detection","author":"Chen","year":"2024"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.112948"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3060755"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2023.3253246"},{"key":"ref17","first-page":"1273","article-title":"Communication-efficient learning of deep networks from decentralized data","volume-title":"Proc. 20th Int. Conf. Artif. Intell. Statist.","author":"McMahan"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2020.2975749"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52729.2023.02350"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3570361.3592505"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i8.26187"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.109459"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583305"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2022.findings-emnlp.43"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3502223.3502233"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TGRS.2022.3179891"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3588432.3591500"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52688.2022.01765"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v31i1.10804"},{"key":"ref30","first-page":"1057","article-title":"Policy gradient methods for reinforcement learning with function approximation","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Sutton"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.106775"},{"key":"ref32","article-title":"Federated learning for ranking browser history suggestions","author":"Hartmann","year":"2019"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i08.7021"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.jbi.2019.103291"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOMWKSHPS57453.2023.10226030"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.cmpb.2022.107318"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TMI.2022.3202106"},{"key":"ref38","first-page":"429","article-title":"Federated optimization in heterogeneous networks","volume-title":"Proc. Mach. Learn. Syst.","volume":"2","author":"Li"},{"key":"ref39","first-page":"5132","article-title":"SCAFFOLD: Stochastic controlled averaging for federated learning","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Karimireddy"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.01057"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3282989"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2022.findings-naacl.121"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2024.acl-long.178"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2024.3352100"},{"key":"ref45","first-page":"1","article-title":"Reasoning on graphs: Faithful and interpretable large language model reasoning","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Luo"},{"key":"ref46","article-title":"Large language models-guided dynamic adaptation for temporal knowledge graph reasoning","author":"Wang","year":"2024"},{"key":"ref47","article-title":"ChatRule: Mining logical rules with large language models for knowledge graph reasoning","author":"Luo","year":"2023"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/3539618.3591743"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TGRS.2024.3370633"},{"key":"ref50","first-page":"2787","article-title":"Translating embeddings for modeling multi-relational data","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Bordes"},{"key":"ref51","article-title":"Embedding entities and relations for learning and inference in knowledge bases","author":"Yang","year":"2014"},{"key":"ref52","first-page":"2071","article-title":"Complex embeddings for simple link prediction","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Trouillon"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482252"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/3241539.3241582"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2022.3205705"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-99-9896-8_6"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1145\/3589334.3645422"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2021.3068842"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/ICAR46387.2019.8981655"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.32473\/flairs.v35i.130722"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D15-1174"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/P15-1067"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-022-03983-6"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.2970044"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.5555\/3454287.3455008"},{"key":"ref66","article-title":"Adam: A method for stochastic optimization","author":"Kingma","year":"2014"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/69\/10750897\/10694741.pdf?arnumber=10694741","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T00:34:38Z","timestamp":1732667678000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10694741\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12]]},"references-count":66,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2024.3464516","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":[[2024,12]]}}}