Reference reconciliation in complex information spaces
Authors:
Open Access
- 14 June 2005
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 85-96
Abstract
Reference reconciliation is the problem of identifying when different references (i.e., sets of attribute values) in a dataset correspond to the same real-world entity. Most previous literature assumed references to a single class that had a fair number of attributes (e.g., research publications). We consider complex information spaces: our references belong to multiple related classes and each reference may have very few attribute values. A prime example of such a space is Personal Information Management, where the goal is to provide a coherent view of all the information on one's desktop.Our reconciliation algorithm has three principal features. First, we exploit the associations between references to design new methods for reference comparison. Second, we propagate information between reconciliation decisions to accumulate positive and negative evidences. Third, we gradually enrich references by merging attribute values. Our experiments show that (1) we considerably improve precision and recall over standard methods on a diverse set of personal information datasets, and (2) there are advantages to using our algorithm even on a standard citation dataset benchmark.Keywords
This publication has 14 references indexed in Scilit:
- Exploiting relationships for domain-independent data cleaning2005
- Adaptive name matching in information integrationIEEE Intelligent Systems, 2003
- Adaptive duplicate detection using learnable string similarity measures2003
- Stuff I've seen2003
- Robust and efficient fuzzy match for online data cleaning2003
- Haystack: A Platform for Authoring End User Semantic Web ApplicationsLecture Notes in Computer Science, 2003
- Learning domain-independent string transformation weights for high accuracy object identification2002
- Interactive deduplication using active learning2002
- Hardening soft information sources2000
- Efficient clustering of high-dimensional data sets with application to reference matching2000