Blink: Blank Node Matching Using Embeddings
A. Becker, M. Sherif, A.-C. Ngonga Ngomo, in: Lecture Notes in Computer Science, Springer Nature Switzerland, Cham, 2024.
Download
No fulltext has been uploaded.
Book Chapter
| Published
| English
Author
Department
Abstract
Knowledge graphs (KGs) differ significantly over multiple different versions of the same data source. They also often contain blank nodes that do not have a constant identifier over all versions. Linking such blank nodes from different versions is a challenging task. Previous works propose different approaches to create signatures for all blank nodes based on named nodes in their neighborhood to match blank nodes with similar signatures. However, these works struggle to find a good mapping when the difference between the KGs’ versions grows too large. In this work, we propose Blink, an embedding-based approach for blank node linking. Blink merges two KGs’ versions and embeds the merged graph into a latent vector space based on translational embeddings and subsequently matches the closest pairs of blank nodes from different graphs. We evaluate our approach using real-world datasets against state-of-the-art approaches by computing the blank node matching for isomorphic graphs and graphs that contain triple changes (i.e., added or removed triples). The results indicate that Blink achieves perfect accuracy for isomorphic graphs. For graph versions that contain changes, such as having up to 20% of triples removed in one version, Blink still produces a mapping with an Optimal Mapping Deviation Ratio of under 1%. These results show that Blink leads to a better linking of KGs over different versions and similar graphs adhering to the linked data guidelines.
Publishing Year
Book Title
Lecture Notes in Computer Science
Conference
ISWC 2024: : The 23ed International Semantic Web Conference
Conference Location
Baltimore, USA
Conference Date
2024-11-11 – 2024-11-15
ISBN
LibreCat-ID
Cite this
Becker A, Sherif M, Ngonga Ngomo A-C. Blink: Blank Node Matching Using Embeddings. In: Lecture Notes in Computer Science. Springer Nature Switzerland; 2024. doi:10.1007/978-3-031-77844-5_12
Becker, A., Sherif, M., & Ngonga Ngomo, A.-C. (2024). Blink: Blank Node Matching Using Embeddings. In Lecture Notes in Computer Science. ISWC 2024: : The 23ed International Semantic Web Conference, Baltimore, USA. Springer Nature Switzerland. https://doi.org/10.1007/978-3-031-77844-5_12
@inbook{Becker_Sherif_Ngonga Ngomo_2024, place={Cham}, title={Blink: Blank Node Matching Using Embeddings}, DOI={10.1007/978-3-031-77844-5_12}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Nature Switzerland}, author={Becker, Alexander and Sherif, Mohamed and Ngonga Ngomo, Axel-Cyrille}, year={2024} }
Becker, Alexander, Mohamed Sherif, and Axel-Cyrille Ngonga Ngomo. “Blink: Blank Node Matching Using Embeddings.” In Lecture Notes in Computer Science. Cham: Springer Nature Switzerland, 2024. https://doi.org/10.1007/978-3-031-77844-5_12.
A. Becker, M. Sherif, and A.-C. Ngonga Ngomo, “Blink: Blank Node Matching Using Embeddings,” in Lecture Notes in Computer Science, Cham: Springer Nature Switzerland, 2024.
Becker, Alexander, et al. “Blink: Blank Node Matching Using Embeddings.” Lecture Notes in Computer Science, Springer Nature Switzerland, 2024, doi:10.1007/978-3-031-77844-5_12.
Link(s) to Main File(s)
Access Level
