Computing expectations and marginal likelihoods for permutations

Research output: Contribution to journalArticle

Full text download(s)

Published copy (DOI)

Author(s)

Department/unit(s)

Publication details

JournalComputational Statistics
DateAccepted/In press - 30 Apr 2019
DateE-pub ahead of print - 12 Jun 2019
DatePublished (current) - 12 Jun 2019
Number of pages21
Early online date12/06/19
Original languageEnglish

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.

Bibliographical note

© The Author(s) 2019

    Research areas

  • Identity resolution, Linkage error, Matrix permanent, Object tracking, Random permutation

Discover related content

Find related publications, people, projects, datasets and more using interactive charts.

View graph of relations