Linking temporal records
Authors:
Open Access
- 1 August 2011
- journal article
- Published by Association for Computing Machinery (ACM) in Proceedings of the VLDB Endowment
- Vol. 4 (11) , 956-967
Abstract
Many data sets contain temporal records over a long period of time; each record is associated with a time stamp and describes some aspects of a real-world entity at that particular time ( e.g. , author information in DBLP). In such cases, we often wish to identify records that describe the same entity over time and so be able to enable interesting longitudinal data analysis. However, existing record linkage techniques ignore the temporal information and can fall short for temporal data. This paper studies linking temporal records. First, we apply time decay to capture the effect of elapsed time on entity value evolution. Second, instead of comparing each pair of records locally, we propose clustering methods that consider time order of the records and make global decisions. Experimental results show that our algorithms significantly outperform traditional linkage methods on various temporal data sets.Keywords
This publication has 15 references indexed in Scilit:
- Behavior based record linkageProceedings of the VLDB Endowment, 2010
- Framework for evaluating clustering algorithms in duplicate detectionProceedings of the VLDB Endowment, 2009
- Ricochet: A Family of Unconstrained Algorithms for Graph Clustering2009
- Record linkage2006
- Exploiting relationships for object consolidation2005
- Graph Clustering and Minimum Cut TreesInternet Mathematics, 2004
- Maintaining time-decaying stream aggregates2003
- A survey of temporal knowledge discovery paradigms and methodsIEEE Transactions on Knowledge and Data Engineering, 2002
- Efficient clustering of high-dimensional data sets with application to reference matching2000
- Temporal and real-time databases: a surveyIEEE Transactions on Knowledge and Data Engineering, 1995