Matching Knowledge Graphs in Entity Embedding Spaces: An Experimental Study
Open Access
- 3 May 2023
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 35 (12) , 12770-12784
Abstract
Entity alignment (EA) identifies equivalent entities that locate in different knowledge graphs (KGs), and has attracted growing research interests over the last few years with the advancement of KG embedding techniques. Although a pile of embedding-based EA frameworks have been developed, they mainly focus on improving the performance of entity representation learning , while largely overlook the subsequent stage that matches KGs in entity embedding spaces . Nevertheless, accurately matching entities based on learned entity representations is crucial to the overall alignment performance, as it coordinates individual alignment decisions and determines the global matching result. Hence, it is essential to understand how well existing solutions for matching KGs in entity embedding spaces perform on present benchmarks, as well as their strengths and weaknesses. To this end, in this article we provide a comprehensive survey and evaluation of matching algorithms for KGs in entity embedding spaces in terms of effectiveness and efficiency on both classic settings and new scenarios that better mirror real-life challenges. Based on in-depth analysis, we provide useful insights into the design trade-offs and good paradigms of existing works, and suggest promising directions for future development.Keywords
Funding Information
- National Key R&D Program of China (2020AAA0108800)
- National Natural Science Foundation of China (62272469, 71971212)
This publication has 59 references indexed in Scilit:
- Secure Stable Matching at Scale2016
- WikidataCommunications of the ACM, 2014
- SIGMa2013
- PARISProceedings of the VLDB Endowment, 2011
- LogMap: Logic-Based and Scalable Ontology Matching2011
- Freebase2008
- Deferred acceptance algorithms: history, theory, practice, and open questionsInternational Journal of Game Theory, 2008
- Yago2007
- A shortest augmenting path algorithm for dense and sparse linear assignment problemsComputing, 1987
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955