An Effective and Efficient Entity Alignment Decoding Algorithm via Third-Order Tensor Isomorphism

32Citations
Citations of this article
38Readers
Mendeley users who have this article in their library.

Abstract

Entity alignment (EA) aims to find the equivalent entity pairs between KGs, which is a crucial step for integrating multi-source KGs. For a long time, most researchers have regarded EA as a pure graph representation learning task and focused on improving graph encoders while paying little attention to the decoding process. In this paper, we propose an effective and efficient EA Decoding Algorithm via Third-order Tensor Isomorphism (DATTI). Specifically, we derive two sets of isomorphism equations: (1) Adjacency tensor isomorphism equations and (2) Gramian tensor isomorphism equations. By combining these equations, DATTI could effectively utilize the adjacency and inner correlation isomorphisms of KGs to enhance the decoding process of EA. Extensive experiments on public datasets indicate that our decoding algorithm can deliver significant performance improvements even on the most advanced EA methods, while the extra required time is less than 3 seconds.

Cite

CITATION STYLE

APA

Mao, X., Ma, M., Yuan, H., Zhu, J., Wang, Z., Xie, R., … Lan, M. (2022). An Effective and Efficient Entity Alignment Decoding Algorithm via Third-Order Tensor Isomorphism. In Proceedings of the Annual Meeting of the Association for Computational Linguistics (Vol. 1, pp. 5888–5898). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/2022.acl-long.405

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free