Scalable Matching and Clustering of Entities with FAMER

• Main Authors: Alieh Saeedi, Markus Nentwig, Eric Peukert, Erhard Rahm
• Format: Article
• Language: English
• Published: Riga Technical University 2018-10-01
• Series: Complex Systems Informatics and Modeling Quarterly
• Subjects: Clustering; Matching; Distributed processing; Multi-source
• Online Access: https://csimq-journals.rtu.lv/article/view/2407

Entity resolution identifies semantically equivalent entities, e.g. describing the same product or customer. It is especially challenging for Big Data applications where large volumes of data from many sources have to be matched and integrated. We therefore introduce a scalable entity resolution framework called FAMER (FAst Multi-source Entity Resolution system) that is based on Apache Flink for distributed execution and that can holistically match entities from multiple sources. For the latter purpose, FAMER includes multiple clustering schemes that group matching entities from different sources within clusters. In addition to previously known clustering schemes FAMER includes new approaches tailored to multi-source entity resolution. We perform a detailed comparative evaluation of eight clustering schemes for different real-life and synthetically generated datasets. The evaluation considers both the match quality as well as the scalability for different numbers of machines and data sizes.