Active Sampling for Entity Matching with Guarantees

Kedar Bellare

doi:10.1145/2500490

Active Sampling for Entity Matching with Guarantees

2013-09-01

11

OA

AI

DOI：10.1145/2500490

Save

View PDF

Abstract

En 中文

In entity matching, a fundamental issue while training a classifier to label pairs of entities as either duplicates or nonduplicates is the one of selecting informative training examples. Although active learning presents an attractive solution to this problem, previous approaches minimize the misclassification rate (0-1 loss) of the classifier, which is an unsuitable metric for entity matching due to class imbalance (i.e., many more nonduplicate pairs than duplicate pairs). To address this, a recent paper [Arasu et al. 2010] proposes to maximize recall of the classifier under the constraint that its precision should be greater than a specified threshold. However, the proposed technique requires the labels of all n input pairs in the worst case. Our main result is an active learning algorithm that approximately maximizes recall of the classifier while respecting a precision constraint with provably sublinear label complexity (under certain distributional assumptions). Our algorithm uses as a black box any active learning module that minimizes 0-1 loss. We show that label complexity of our algorithm is at most log n times the label complexity of the black box, and also bound the difference in the recall of classifier learnt by our algorithm and the recall of the optimal classifier satisfying the precision constraint. We provide an empirical evaluation of our algorithm on several real-world matching data sets that demonstrates the effectiveness of our approach.

Keywords:

Algorithms

Experimentation

Theory

Performance

Entity matching

deduplication

active learning

imbalanced data

Active Sampling for Entity Matching with Guarantees

Abstract

AI Summary

Journal

Organization