2006 DomIndepDataCleanViaERGraph

• (Kalashnikov and Mehrotra, 2006) ⇒ Dmitri V. Kalashnikov, and Sharad Mehrotra. (2006). “Domain-independent Data Cleaning Via Analysis of Entity-Relationship Graph.” In: ACM Transactions on Database Systems (ACM TODS), Vol. 31(2). doi:10.1145/1138394.1138401

Subject Headings: Data Cleaning, Entity Resolution, Graph Analysis, Reference Disambiguation, Relationship Analysis, RelDC

Cited By

• http://scholar.google.com/scholar?q=%22Domain-independent+data+cleaning+via+analysis+of+entity-relationship+graph%22+2006
• http://dl.acm.org/citation.cfm?id=1138394.1138401&preflayout=flat#citedby

Quotes

Author Keywords

• Connection strength; RelDC; data cleaning; entity resolution; graph analysis; reference disambiguation; relationship analysis

Quotes

Abstract

In this paper, we address the problem of reference disambiguation. Specifically, we consider a situation where entities in the database are referred to using descriptions (e.g., a set of instantiated attributes). The objective of reference disambiguation is to identify the unique entity to which each description corresponds. The key difference between the approach we propose (called RelDC) and the traditional techniques is that RelDC analyzes not only object features but also inter-object relationships to improve the disambiguation quality. Our extensive experiments over two real data sets and over synthetic datasets show that analysis of relationships significantly improves quality of the result.

References

,

	Author	volume	Date Value	title	type	journal	titleUrl	doi	note	year
2006 DomIndepDataCleanViaERGraph	Dmitri V. Kalashnikov Sharad Mehrotra			Domain-independent Data Cleaning Via Analysis of Entity-Relationship Graph			http://www.ics.uci.edu/~dvk/pub/TODS06 dvk.pdf