Node Embeddings for Graph Merging: Case of Knowledge Graph Construction

Abstract

Combining two graphs requires merging the nodes which are counterparts of each other. In this process errors occur, resulting in incorrect merging or incorrect failure to merge. We find a high prevalence of such errors when using AskNET, an algorithm for building Knowledge Graphs from text corpora. AskNET node matching method uses string similarity, which we propose to replace with vector embedding similarity. We explore graph-based and word-based embedding models and show an overall error reduction of from 56\% to 23.6\%, with a reduction of over a half in both types of incorrect node matching.

Tasks

Reproductions