Active sampling for entity matching with guarantees

Kedar Bellare, Suresh Iyengar, Aditya Parameswaran, Vibhor Rastogi

Research output: Contribution to journalArticlepeer-review

Abstract

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 sub linear 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.

Original languageEnglish (US)
Article number12
JournalACM Transactions on Knowledge Discovery from Data
Volume7
Issue number3
DOIs
StatePublished - Sep 2013

Keywords

  • Active learning
  • Deduplication
  • Entity matching
  • Imbalanced data

ASJC Scopus subject areas

  • Computer Science(all)

Fingerprint Dive into the research topics of 'Active sampling for entity matching with guarantees'. Together they form a unique fingerprint.

Cite this