Bipartite Graph Matching Algorithms for Clean-Clean Entity Resolution: An Empirical Evaluation
Abstract
Entity Resolution (ER) is the task of finding records that refer to the same real-world entities. A common scenario is when entities across two clean sources need to be resolved, which we refer to as Clean-Clean ER. In this paper, we perform an extensive empirical evaluation of 8 bipartite graph matching algorithms that take in as input a bipartite similarity graph and provide as output a set of matched entities. We consider a wide range of matching algorithms, including algorithms that have not previously been applied to ER, or have been evaluated only in other ER settings. We assess the relative performance of the algorithms with respect to accuracy and time efficiency over 10 established, real datasets, from which we extract >700 different similarity graphs. Our results provide insights into the relative performance of these algorithms and guidelines for choosing the best one, depending on the data at hand.
Cite
@article{arxiv.2112.14030,
title = {Bipartite Graph Matching Algorithms for Clean-Clean Entity Resolution: An Empirical Evaluation},
author = {George Papadakis and Vasilis Efthymiou and Emanouil Thanos and Oktie Hassanzadeh},
journal= {arXiv preprint arXiv:2112.14030},
year = {2022}
}
Comments
extended version of paper accepted at EDBT 2022