Entity Resolution Methods–A Survey
Ammu Archa.P1, Lekshmy.D.Kumar2

1Ammu Archa.P, Student, Department of Computer Science & Engineering, SCTCE, Thiruvananthapuram (Kerala), India.
2Lekshmy.D.Kumar, Assistant Professor, Department of Computer Science & Engineering, SCTCE, Thiruvananthapuram (Kerala), India.

Manuscript received on 13 June 2016 | Revised Manuscript received on 20 June 2016 | Manuscript Published on 30 June 2016 | PP: 163-165 | Volume-5 Issue-5, June 2016 | Retrieval Number: E4642065516/16©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: In the real world, entities have two or more references in databases. Such multiple representations do not share anything in common and thus make duplicate detection a difficult task. Entity resolution or record linkage or deduplication is the process of identifying the records that refer to the same entity. Entity resolution is a challenging task particularly for entities that are highly heterogeneous and of low data quality. Due to the high importance and difficulty of the entity resolution problem, there are numerous approaches that have been proposed to solve ER problems. As there are different entity resolution approaches there is a strong need for comparative evaluations of different schemes. In this paper, different frameworks for entity resolution are studied.
Keywords: ER Diagram

Scope of the Article: Surveying