Context-aware instance matching through graph embedding in lexical semantic space

3Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Instance matching is one of the processes that facilitate the integration of independently designed knowledge bases. It aims to link co-referent instances with an owl:sameAs connection to allow knowledge bases to complement each other. In this work, we present VDLS, an approach for automatic alignment of instances in RDF knowledge base graphs. VDLS generates for each instance a virtual document from its local description (i.e., data-type properties) and instances related to it through object-type properties (i.e., neighbors). We transform the instance matching problem into a document matching problem and solve it by a vector space embedding technique. We consider the pre-trained word embeddings to assess words similarities at both the lexical and semantic levels. We evaluate our approach on multiple knowledge bases from the instance track of OAEI. The experiments show that VDLS gets prominent results compared to several state-of-the-art existing approaches.

Cite

CITATION STYLE

APA

Assi, A., Mcheick, H., & Dhifli, W. (2019). Context-aware instance matching through graph embedding in lexical semantic space. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11606 LNAI, pp. 422–433). Springer Verlag. https://doi.org/10.1007/978-3-030-22999-3_37

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