Modern Bayesian Record Linkage: Some Recent Developments and Open Challenges
1 hour 4 mins,
118.30 MB,
MP3
44100 Hz,
252.36 kbits/sec
Share this media item:
Embed this media item:
Embed this media item:
About this item
| Description: |
Steorts, R (Duke University)
Thursday 7th July 2016 - 16:00 to 17:00 |
|---|
| Created: | 2016-07-18 17:23 |
|---|---|
| Collection: | Data Linkage and Anonymisation |
| Publisher: | Isaac Newton Institute |
| Copyright: | Steorts, R |
| Language: | eng (English) |
| Distribution: |
World
(downloadable)
|
| Explicit content: | No |
| Aspect Ratio: | 16:9 |
| Screencast: | No |
| Bumper: | UCS Default |
| Trailer: | UCS Default |
| Abstract: | Record linkage, also known as de-duplication, entity resolution, and coreference resolution is the process of merging together noisy databases to remove duplicate entities. Record linkage is becoming more essential in the age of big data, where duplicates are ever present in such applications as official statistics, human rights, genetics, electronic medical data, and so on. We briefly review the genesis of record linkage with the work of Newcombe in 1959, and then move to recent Bayesian developments using novel clustering approaches in recent work. We speak of recent challenges that have been overcome and ones that are present, needing guidance and attention. |
|---|---|
Available Formats
| Format | Quality | Bitrate | Size | |||
|---|---|---|---|---|---|---|
| MPEG-4 Video | 640x360 | 1.95 Mbits/sec | 940.25 MB | View | Download | |
| WebM | 640x360 | 612.82 kbits/sec | 287.26 MB | View | Download | |
| iPod Video | 480x270 | 527.19 kbits/sec | 247.12 MB | View | Download | |
| MP3 * | 44100 Hz | 252.36 kbits/sec | 118.30 MB | Listen | Download | |
| Auto | (Allows browser to choose a format it supports) | |||||