Experience: Type alignment on DBpedia and Freebase
Mayank Kejriwal, Daniel P. Miranker

TL;DR
This paper presents a MapReduce-based method for aligning types across large-scale RDF knowledge graphs, specifically DBpedia and Freebase, to improve instance matching efficiency and accuracy.
Contribution
It introduces a novel large-scale type alignment algorithm and discusses evaluation strategies within the context of cross-domain knowledge graphs.
Findings
Type alignment improves instance matching efficiency.
Three evaluation methods for type alignment are proposed.
Alignment results show consistency across different evaluation strategies.
Abstract
Linked Open Data exhibits growth in both volume and variety of published data. Due to this variety, instances of many different types (e.g. Person) can be found in published datasets. Type alignment is the problem of automatically matching types (in a possibly many-many fashion) between two such datasets. Type alignment is an important preprocessing step in instance matching. Instance matching concerns identifying pairs of instances referring to the same underlying entity. By performing type alignment a priori, only instances conforming to aligned types are processed together, leading to significant savings. This article describes a type alignment experience with two large-scale cross-domain RDF knowledge graphs, DBpedia and Freebase, that contain hundreds, or even thousands, of unique types. Specifically, we present a MapReduce-based type alignment algorithm and show that there are at…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Quality and Management · Advanced Database Systems and Queries · Semantic Web and Ontologies
