FTRLIM: Distributed Instance Matching Framework for Large-Scale Knowledge Graph Fusion
Open Access
Abstract
Instance matching is a key task in knowledge graph fusion, and it is critical to improving the efficiency of instance matching, given the increasing scale of knowledge graphs. Blocking algorithms selecting candidate instance pairs for comparison is one of the effective methods to achieve the goal. In this paper, we propose a novel blocking algorithm named MultiObJ, which constructs indexes for instances based on the Ordered Joint of Multiple Objects’ features to limit the number of candidate instance pairs. Based on MultiObJ, we further propose a distributed framework named Follow-the-Regular-Leader Instance Matching (FTRLIM), which matches instances between large-scale knowledge graphs with approximately linear time complexity. FTRLIM has participated in OAEI 2019 and achieved the best matching quality with significantly efficiency. In this research, we construct three data collections based on a real-world large-scale knowledge graph. Experiment results on the constructed data collections and two real-world datasets indicate that MultiObJ and FTRLIM outperform other state-of-the-art methods.Keywords
Funding Information
- Science and Technology Commission of Shanghai Municipality (20511102703)
- National Natural Science Foundation of China (61702374)
This publication has 48 references indexed in Scilit:
- An unsupervised instance matcher for schema-free RDF dataJournal of Web Semantics, 2015
- Ontology matching: A literature reviewExpert Systems with Applications, 2015
- The EBI RDF platform: linked open data for the life sciencesBioinformatics, 2014
- An effective method of large scale ontology matchingJournal of Biomedical Semantics, 2014
- Large scale instance matching via multiple indexes and candidate selectionKnowledge-Based Systems, 2013
- PARISProceedings of the VLDB Endowment, 2011
- Ontology matching with semantic verificationJournal of Web Semantics, 2009
- MapReduceCommunications of the ACM, 2008
- Tane: An Efficient Algorithm for Discovering Functional and Approximate DependenciesThe Computer Journal, 1999
- An Introduction to the Resource Description FrameworkBulletin of the American Society for Information Science and Technology, 1998