Improving Schema Matching with Linked Data

  • Assaf A
  • Louw E
  • Senart A
  • et al.
ArXiv: 1205.2691
N/ACitations
Citations of this article
36Readers
Mendeley users who have this article in their library.

Abstract

With today's public data sets containing billions of data items, more and more companies are looking to integrate external data with their traditional enterprise data to improve business intelligence analysis. These distributed data sources however exhibit heterogeneous data formats and terminologies and may contain noisy data. In this paper, we present a novel framework that enables business users to semi-automatically perform data integration on potentially noisy tabular data. This framework offers an extension to Google Refine with novel schema matching algorithms leveraging Freebase rich types. First experiments show that using Linked Data to map cell values with instances and column headers with types improves significantly the quality of the matching results and therefore should lead to more informed decisions.

Cite

CITATION STYLE

APA

Assaf, A., Louw, E., Senart, A., Follenfant, C., Troncy, R., & Trastour, D. (2012). Improving Schema Matching with Linked Data. Retrieved from http://arxiv.org/abs/1205.2691

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