Probabilistic Record Linkage and Deduplication after Indexing, Blocking, and Filtering
56 mins 59 secs,
217.87 MB,
iPod Video
480x270,
29.97 fps,
44100 Hz,
522.02 kbits/sec
Share this media item:
Embed this media item:
Embed this media item:
About this item
| Description: |
Murray, J (Carnegie Mellon University)
Friday 8th July 2016 - 14:30 to 15:30 |
|---|
| Created: | 2016-07-18 17:18 |
|---|---|
| Collection: | Data Linkage and Anonymisation |
| Publisher: | Isaac Newton Institute |
| Copyright: | Murray, J |
| Language: | eng (English) |
| Distribution: |
World
(downloadable)
|
| Explicit content: | No |
| Aspect Ratio: | 16:9 |
| Screencast: | No |
| Bumper: | UCS Default |
| Trailer: | UCS Default |
| Abstract: | When linking two databases (or deduplicating a single database) the number of possible links grows rapidly in the size of the databases under consideration, and in most applications it is necessary to first reduce the number of record pairs that will be compared. Spurred by practical considerations, a range of indexing or blocking methods have been developed for this task. However, methods for inferring linkage structure that account for indexing, blocking, and filtering steps have not seen commensurate development. I review the implications of indexing, blocking and filtering, focusing primarily on the popular Fellegi-Sunter framework and proposing a new model to account for particular forms of indexing and filtering. |
|---|---|
Available Formats
| Format | Quality | Bitrate | Size | |||
|---|---|---|---|---|---|---|
| MPEG-4 Video | 640x360 | 1.94 Mbits/sec | 829.18 MB | View | Download | |
| WebM | 640x360 | 421.2 kbits/sec | 175.85 MB | View | Download | |
| iPod Video * | 480x270 | 522.02 kbits/sec | 217.87 MB | View | Download | |
| MP3 | 44100 Hz | 249.78 kbits/sec | 104.34 MB | Listen | Download | |
| Auto | (Allows browser to choose a format it supports) | |||||