Entity resolution-based Jaccard similarity coefficient for heterogeneous distributed databases

14Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Entity Resolution (ER) is a task for identifying same real world entity. It refers to data object matching or deduplication. It has been a leading research in the field of structure database. Due to its significance, entity resolution continues to be a most important challenge for heterogeneous distributed databases. Several methods have been proposed for the Entity resolution, but they have yielded unsatisfactory results. In this paper, we propose an efficient integrated solution to the entity resolution problem based on Jaccard similarity coefficient. Here we use Markov logic and Jaccard similarity coefficient for providing an efficient solution towards ER problem in heterogeneous distributed databases. The approach that we have implemented gives an overall success rate of about 98 %, thus proving better than the previously implemented algorithms.

Cite

CITATION STYLE

APA

Dharavath, R., & Singh, A. K. (2016). Entity resolution-based Jaccard similarity coefficient for heterogeneous distributed databases. In Advances in Intelligent Systems and Computing (Vol. 379, pp. 497–507). Springer Verlag. https://doi.org/10.1007/978-81-322-2517-1_48

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