Show simple item record

Files in this item

Thumbnail

Item metadata

dc.contributor.advisorKirby, Graham N. C.
dc.contributor.advisorDearle, Alan
dc.contributor.authorDalton, Thomas Stanley
dc.coverage.spatialxviii, 235, [32] p.en_US
dc.date.accessioned2023-01-19T15:59:52Z
dc.date.available2023-01-19T15:59:52Z
dc.date.issued2022-06-15
dc.identifier.urihttps://hdl.handle.net/10023/26784
dc.description.abstractData linkage algorithms join datasets by identifying commonalities between them. The ability to evaluate the efficacy of different algorithms is a challenging problem that is often overlooked. If incorrect links are made or links are missed by a linkage algorithm then conclusions based on its linkage may be unfounded. Evaluating linkage quality is particularly challenging in domains where datasets are large and the number of links is low. Example domains include historical population data, bibliographic data, and administrative data. In these domains the evaluation of linkage quality is not well understood. A common approach to evaluating linkage quality is the use of metrics, most commonly precision, recall, and F-measure. These metrics indicate how often links are missed or false links are made. To calculate a metric, datasets are used where the true links and non-links are known. The linkage algorithm attempts to link the datasets and the constructed set of links is compared with the set of true links. In these domains we can rarely have confidence that the evaluation datasets contain all the true links and that no false links have been included. If such errors exist in the evaluation datasets, the calculated metrics may not truly reflect the performance of the linkage algorithm. This presents issues when making comparisons between linkage algorithms. To rigorously evaluate the efficacy of linkage algorithms, it is necessary to objectively measure an algorithm’s linkage quality with a range of different configuration parameters and datasets. These many datasets must be of appropriate scale and have ground truth which denotes all true links and non-links. Evaluating algorithms using shared standardised datasets enables objective comparisons between linkage algorithms. To facilitate objective linkage evaluation, a set of standardised datasets need to be shared and widely adopted. This thesis establishes an approach for the construction of synthetic datasets that can be used to evaluate linkage algorithms. This thesis addresses the following research questions: • What are appropriate approaches to the evaluation of linkage algorithms? • Is it feasible to synthesise realistic evaluation data? • Is synthetic evaluation data with perfect ground truth useful for evaluation? • How should synthesised data be statistically validated for correctness? • How should sets of synthesised data be used to evaluate linkage? • How can the evaluation of linkage algorithms be effectively communicated? This thesis makes a number of contributions, most notably a framework for the comprehensive evaluation of data linkage algorithms, thus significantly improving the comparability of linkage algorithms, especially in domains lacking evaluation data. The thesis demonstrates these techniques within the population reconstruction domain. Integral to the evaluation framework, approaches to synthesis and statistical validation of evaluation datasets have been investigated, resulting in a simulation model able to create many, characteristically varied, large-scale datasets.en_US
dc.language.isoenen_US
dc.subjectData linkageen_US
dc.subjectRecord linkageen_US
dc.subjectEvaluationen_US
dc.subjectSynthetic dataen_US
dc.subjectGround truthen_US
dc.subjectSynthetic ground truthen_US
dc.subjectGold standarden_US
dc.subjectLinkage evaluationen_US
dc.subject.lccQA76.9E95D2
dc.subject.lcshComputer algorithms--Evaluationen
dc.subject.lcshLinked dataen
dc.titleEvaluating data linkage algorithms with perfect synthetic ground truthen_US
dc.typeThesisen_US
dc.contributor.sponsorEngineering and Physical Sciences Research Council (EPSRC)en_US
dc.type.qualificationlevelDoctoralen_US
dc.type.qualificationnamePhD Doctor of Philosophyen_US
dc.publisher.institutionThe University of St Andrewsen_US
dc.identifier.doihttps://doi.org/10.17630/sta/247
dc.identifier.grantnumberEP/M508214/1en_US


This item appears in the following Collection(s)

Show simple item record