An introduction to duplicate detection
Our rough guess is there are 19,250 words in this book.
At a pace averaging 250 words per minute, this book will take 1 hours and 17 minutes to read. With a half hour per day, this will take 3 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
Author
Contributions
- Herschel, Melanie - Contributor
Publication
2010 - Morgan & Claypool Publishers, San Rafael, Calif. (1537 Fourth Street, San Rafael, CA 94901 USA), California
Language
English
Word Count
19,250 words, Guess
Page Count
77 pages
Physical Format
Electronic resource
Identifiers
- Internet Archiveintroductiontodu00naum
- Internet Archiveintroductiontodu0000naum
- ISBN-139781608452217
- ISBN-139781608452200
- ISBN-101608452212
and 5 more
- ISBN-101608452204
- OCLC Control Number401167979
- Better World Books9781608452200
- Better World Books9781608452217
- Open LibraryOL25556151M
Classifications
- DDC005.7565
- LCCQA76.9.D3 N285 2010
- LCCQA76.9.D3 N38 2010
Alternate Titles
- Synthesis digital library of engineering and computer science.
Description
With the ever increasing volume of data, data quality problems abound. Multiple, yet different representations of the same real-world objects in data, duplicates, are one of the most intriguing data quality problems. The effects of such duplicates are detrimental; for instance, bank customers can obtain duplicate identities, inventory levels are monitored incorrectly, catalogs are mailed multiple times to the same household, etc. Automatically detecting duplicates is difficult: First, duplicate representations are usually not identical but slightly differ in their values. Second, in principle all pairs of records should be compared, which is infeasible for large volumes of data. This lecture examines closely the two main components to overcome these difficulties: (i) Similarity measures are used to automatically identify duplicates when comparing two records.Well-chosen similarity measures improve the effectiveness of duplicate detection. (ii) Algorithms are developed to perform on very large volumes of data in search for duplicates.Well-designed algorithms improve the efficiency of duplicate detection. Finally, we discuss methods to evaluate the success of duplicate detection.
Subjects
Series Statement
- Synthesis lectures on data management -- # 3
Other Editions
- An introduction to duplicate detection
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!