Robust temporal graph clustering for group record linkage

Charini Nanayakkara*, Peter Christen, Thilina Ranbaduge

*Corresponding author for this work

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    7 Citations (Scopus)

    Abstract

    Research in the social sciences is increasingly based on large and complex data collections, where individual data sets from different domains need to be linked to allow advanced analytics. A popular type of data used in such a context are historical registries containing birth, death, and marriage certificates. Individually, such data sets however limit the types of studies that can be conducted. Specifically, it is impossible to track individuals, families, or households over time. Once such data sets are linked and family trees are available it is possible to, for example, investigate how education, health, mobility, and employment influence the lives of people over two or even more generations. The linkage of historical records is challenging because of data quality issues and because often there are no ground truth data available. Unsupervised techniques need to be employed, which generally are based on similarity graphs generated by comparing individual records. In this paper we present a novel temporal clustering approach aimed at linking records of the same group (such as all births by the same mother) where temporal constraints (such as intervals between births) need to be enforced. We combine a connected component approach with an iterative merging step which considers temporal constraints to obtain accurate clustering results. Experiments on a real Scottish data set show the superiority of our approach over a previous clustering approach for record linkage.

    Original languageEnglish
    Title of host publicationAdvances in Knowledge Discovery and Data Mining - 23rd Pacific-Asia Conference, PAKDD 2019, Proceedings
    EditorsZhiguo Gong, Sheng-Jun Huang, Min-Ling Zhang, Zhi-Hua Zhou, Qiang Yang
    PublisherSpringer Verlag
    Pages526-538
    Number of pages13
    ISBN (Print)9783030161446
    DOIs
    Publication statusPublished - 2019
    Event23rd Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2019 - Macau, China
    Duration: 14 Apr 201917 Apr 2019

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume11440 LNAI
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Conference

    Conference23rd Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2019
    Country/TerritoryChina
    CityMacau
    Period14/04/1917/04/19

    Fingerprint

    Dive into the research topics of 'Robust temporal graph clustering for group record linkage'. Together they form a unique fingerprint.

    Cite this