Entity Resolution in a Big Data Framework

Authors

  • Mayank Kejriwal University of Texas at Austin

DOI:

https://doi.org/10.1609/aaai.v29i1.9256

Keywords:

Data Matching, Entity Resolution, Big Data, Linked Data, Semantic Web

Abstract

Entity Resolution (ER) concerns identifying logically equivalent pairs of entities that may be syntactically disparate. Although ER is a long-standing problem in the artificial intelligence community, the growth of Linked Open Data, a collection of semi-structured datasets published and inter-connected on the Web, mandates a new approach. The thesis is that building a viable Entity Resolution solution for serving Big Data needs requires simultaneously resolving challenges of automation, heterogeneity, scalability and domain independence. The dissertation aims to build such a system and evaluate it on real-world datasets published already as Linked Open Data.

Downloads

Published

2015-03-04

How to Cite

Kejriwal, M. (2015). Entity Resolution in a Big Data Framework. Proceedings of the AAAI Conference on Artificial Intelligence, 29(1). https://doi.org/10.1609/aaai.v29i1.9256