Abstract
This paper demonstrates how we can re-purpose sophisticated algorithms from a range of fields to help us compute expected permutations
and marginal likelihoods. The results are of particular use in the fields of
record linkage or identity resolution, where we are interested in finding pairs
of records across data sets that refer to the same individual. All calculations
discussed can be reproduced with the accompanying R package expperm.
and marginal likelihoods. The results are of particular use in the fields of
record linkage or identity resolution, where we are interested in finding pairs
of records across data sets that refer to the same individual. All calculations
discussed can be reproduced with the accompanying R package expperm.
| Original language | English |
|---|---|
| Number of pages | 21 |
| Journal | Computational Statistics |
| Early online date | 12 Jun 2019 |
| DOIs | |
| Publication status | Published - 12 Jun 2019 |
Bibliographical note
© The Author(s) 2019Keywords
- Identity resolution
- Linkage error
- Matrix permanent
- Object tracking
- Random permutation