Rule-Based Entity Resolution on Database with Hidden Temporal Information (Extended Abstract)

In this paper, we deal with the problem of rule-based entity resolution on imprecise temporal data. We use record matching dependencies and data currency constraints to derive temporal records' information and trend of their attributes' evolvement with elapsing of time. We firstly block records into smaller blocks, and then by exploring data currency constraints. We propose a temporal clustering approach with two steps, i.e., the skeleton clustering and the banding clustering. Experiments show that our method achieves both high accuracy and efficiency with hidden temporal information on datasets without imprecise timestamps.

[1]  Renée J. Miller,et al.  Framework for Evaluating Clustering Algorithms in Duplicate Detection , 2009, Proc. VLDB Endow..

[2]  Divesh Srivastava,et al.  Linking temporal records , 2011, Frontiers of Computer Science.

[3]  Jef Wijsen,et al.  Determining the Currency of Data , 2011, TODS.

[4]  Jianzhong Li,et al.  Reasoning about Record Matching Rules , 2009, Proc. VLDB Endow..

[5]  Divesh Srivastava,et al.  Linking temporal records , 2011, VLDB 2011.

[6]  Jianzhong Li,et al.  Rule-Based Entity Resolution on Database with Hidden Temporal Information , 2018, IEEE Transactions on Knowledge and Data Engineering.