Detecting Multi-Relationship Links in Sparse Datasets

Dongyun Nie, Mark Roantree

2019

Abstract

Application areas such as healthcare and insurance see many patients or clients with their lifetime record spread across the databases of different providers. Record linkage is the task where algorithms are used to identify the same individual contained in different datasets. In cases where unique identifiers are found, linking those records is a trivial task. However, there are very high numbers of individuals who cannot be matched as common identifiers do not exist across datasets and their identifying information is not exact or often, quite different (e.g. a change of address). In this research, we provide a new approach to record linkage which also includes the ability to detect relationships between customers (e.g. family). A validation is presented which highlights the best parameter and configuration settings for the types of relationship links that are required.

Paper Citation

in Harvard Style

Nie D. and Roantree M. (2019). Detecting Multi-Relationship Links in Sparse Datasets.In Proceedings of the 21st International Conference on Enterprise Information Systems - Volume 1: ICEIS, ISBN 978-989-758-372-8, pages 149-157. DOI: 10.5220/0007696901490157

in Bibtex Style

@conference{iceis19,
author={Dongyun Nie and Mark Roantree},
title={Detecting Multi-Relationship Links in Sparse Datasets},
booktitle={Proceedings of the 21st International Conference on Enterprise Information Systems - Volume 1: ICEIS,},
year={2019},
pages={149-157},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0007696901490157},
isbn={978-989-758-372-8},
}

in EndNote Style

TY - CONF

JO - Proceedings of the 21st International Conference on Enterprise Information Systems - Volume 1: ICEIS,
TI - Detecting Multi-Relationship Links in Sparse Datasets
SN - 978-989-758-372-8
AU - Nie D.
AU - Roantree M.
PY - 2019
SP - 149
EP - 157
DO - 10.5220/0007696901490157