Pith. sign in

REVIEW 1 cited by

A Comprehensive Benchmark Framework for Active Learning Methods in Entity Matching

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2003.13114 v1 pith:RKOKA6MW submitted 2020-03-29 cs.DB cs.LG

classification cs.DBcs.LG
keywords learningactiveframeworkqualityentityexamplemodelselection
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Entity Matching (EM) is a core data cleaning task, aiming to identify different mentions of the same real-world entity. Active learning is one way to address the challenge of scarce labeled data in practice, by dynamically collecting the necessary examples to be labeled by an Oracle and refining the learned model (classifier) upon them. In this paper, we build a unified active learning benchmark framework for EM that allows users to easily combine different learning algorithms with applicable example selection algorithms. The goal of the framework is to enable concrete guidelines for practitioners as to what active learning combinations will work well for EM. Towards this, we perform comprehensive experiments on publicly available EM datasets from product and publication domains to evaluate active learning methods, using a variety of metrics including EM quality, #labels and example selection latencies. Our most surprising result finds that active learning with fewer labels can learn a classifier of comparable quality as supervised learning. In fact, for several of the datasets, we show that there is an active learning combination that beats the state-of-the-art supervised learning result. Our framework also includes novel optimizations that improve the quality of the learned model by roughly 9% in terms of F1-score and reduce example selection latencies by up to 10x without affecting the quality of the model.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. TransClean: Finding False Positives in Multi-Source Entity Matching under Real-World Conditions via Transitive Consistency

    cs.DB 2025-06 conditional novelty 6.0 of 10

    TransClean uses a model's predictions on transitive, implied record pairs to locate and remove false positive matches in multi-source entity resolution.

Pith tools