2.9k citations · 3.5k across the 25 of their papers we have counts for
27 papers
A Critical Re-evaluation of Benchmark Datasets for (Deep) Learning-Based Matching Algorithms
George Papadakis, Nishadi Kirielle, Peter Christen +1
Entity resolution (ER) is the process of identifying records that refer to the same entities within one or across multiple databases. Numerous techniques have been developed to tac…
Big Data is not the New Oil: Common Misconceptions about Population Data
Peter Christen, Rainer Schnell
Databases covering all individuals of a population are increasingly used for research and decision-making. The massive size of such databases is often mistaken as a guarantee for v…
Large Scale Record Linkage in the Presence of Missing Data
Thilina Ranbaduge, Peter Christen, Rainer Schnell
Record linkage is aimed at the accurate and efficient identification of records that represent the same entity within or across disparate databases. It is a fundamental task in dat…
Accurate and Efficient Suffix Tree Based Privacy-Preserving String Matching
Sirintra Vaiwsri, Thilina Ranbaduge, Peter Christen +1
The task of calculating similarities between strings held by different organizations without revealing these strings is an increasingly important problem in areas such as health in…
F*: An Interpretable Transformation of the F-measure
David J. Hand, Peter Christen, Nishadi Kirielle
The F-measure, also known as the F1-score, is widely used to assess the performance of classification algorithms. However, some researchers find it lacking in intuitive interpretat…
Pattern Masking for Dictionary Matching
Panagiotis Charalampopoulos, Huiping Chen, Peter Christen +4
In the Pattern Masking for Dictionary Matching (PMDM) problem, we are given a dictionary of strings, each of length , a query string of length , a…