TransClean: Finding False Positives in Multi-Source Entity Matching under Real-World Conditions via Transitive Consistency
Not on the map. Why?
Abstract (arXiv)
We present TransClean, a method for detecting false positive predictions of entity matching algorithms under real-world conditions characterized by large-scale, noisy, and unlabeled multi-source datasets that undergo distributional shifts. TransClean is explicitly designed to operate with multiple data sources in an efficient, robust and fast manner while accounting for edge cases and requiring limited manual labeling. TransClean leverages the Transitive Consistency of a matching, a measure of the consistency of a pairwise matching model f_theta on the matching it produces G_f_theta, based both on its predictions on directly evaluated record pairs and its predictions on implied record pairs. TransClean iteratively modifies a matching through gradually removing false positive matches while removing as few true positive matches as possible. In each of these steps, the estimation of the Transitive Consistency is exclusively done through model evaluations and produces quantities that can be used as proxies of the amounts of true and false positives in the matching while not requiring any manual labeling, producing an estimate of the quality of the matching and indicating which record groups are likely to contain false positives. In our experiments, we compare combining TransClean with a naively trained pairwise matching model (DistilBERT) and with a state-of-the-art end-to-end matching method (CLER) and illustrate the flexibility of TransClean in being able to detect most of the false positives of either setup across a variety of datasets. Our experiments show that TransClean induces an average +24.42 F1 score improvement for entity matching in a multi-source setting when compared to traditional pair-wise matching algorithms.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 17 of its 63 references that are in the map. First posted on arXiv 4 Jun 2025.
Builds on
17 of 63 references.
References · 17
- 2017Attention Is All You Needcited by 60,361
- 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,307
- 2017DeepER -- Deep Entity Resolutioncited by 54
- 2019Low-resource Deep Entity Resolution with Transfer and Active Learningcited by 37
- 2024Match, Compare, or Select? An Investigation of Large Language Models for Entity Matchingcited by 32
- 2022Supervised Contrastive Learning for Product Matchingcited by 24
- 2020Modeling and mitigating human annotation errors to design efficient stream processing systems with human-in-the-loop machine learningcited by 21
- 2022Sudowoodo: Contrastive Self-supervised Learning for Multi-purpose Data Integration and Preparationcited by 19
- 2020Modeling Voting for System Combination in Machine Translationcited by 18
- 2020A Comprehensive Benchmark Framework for Active Learning Methods in Entity Matchingcited by 17
- 2023WDC Products: A Multi-Dimensional Entity Matching Benchmarkcited by 17
- 2019AutoBlock: A Hands-off Blocking Framework for Entity Matchingcited by 12
5 more
- 2021Alaska: A Flexible Benchmark for Data Integration Taskscited by 7
- 2023The Battleship Approach to the Low Resource Entity Matching Problemcited by 4
- 2018r-HUMO: A Risk-Aware Human-Machine Cooperation Framework for Entity Resolution with Quality Guaranteescited by 3
- 2019Towards Interpretable and Learnable Risk Analysis for Entity Resolutioncited by 3
- 2018Improving Machine-based Entity Resolution with Limited Human Effort: A Risk Perspectivecited by 1
Built on by
Citing papers per year: 2026: 1.
1 paper.