ACM Home Page
Please provide us with feedback. Feedback
Record linkage: similarity measures and algorithms
Full text PdfPdf (36 KB)
Source International Conference on Management of Data archive
Proceedings of the 2006 ACM SIGMOD international conference on Management of data table of contents
Chicago, IL, USA
TUTORIAL SESSION: Tutorial 3 table of contents
Pages: 802 - 803  
Year of Publication: 2006
ISBN:1-59593-434-0
Authors
Nick Koudas  University of Toronto
Sunita Sarawagi  IIT Bombay
Divesh Srivastava  AT&T Labs-Research
Sponsors
ACM: Association for Computing Machinery
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Citation Count: 17
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1142473.1142599
What is a DOI?

ABSTRACT

This tutorial provides a comprehensive and cohesive overview of the key research results in the area of record linkage methodologies and algorithms for identifying approximate duplicate records, and available tools for this purpose. It encompasses techniques introduced in several communities including databases, information retrieval, statistics and machine learning. It aims to identify similarities and differences across the techniques as well as their merits and limitations.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
C. Batini, T. Catarci, and M. Scannapieco. A survey of data quality issues in cooperative information systems. Pre-conference ER tutorial, 2004.
2
 
3

CITED BY  17

Collaborative Colleagues:
Nick Koudas: colleagues
Sunita Sarawagi: colleagues
Divesh Srivastava: colleagues