On active learning of record matching packages

We consider the problem of learning a record matching package (classifier) in an active learning setting. In active learning, the learning algorithm picks the set of examples to be labeled, unlike more traditional passive learning setting where a user selects the labeled examples. Active learning is important for record matching since manually identifying a suitable set of labeled examples is difficult. Previous algorithms that use active learning for record matching have serious limitations: The packages that they learn lack quality guarantees and the algorithms do not scale to large input sizes. We present new algorithms for this problem that overcome these limitations. Our algorithms are fundamentally different from traditional active learning approaches, and are designed ground up to exploit problem characteristics specific to record matching. We include a detailed experimental evaluation on realworld data demonstrating the effectiveness of our algorithms. Categories and Subjec...

• Type: Conference
• Year: 2010
• Where: SIGMOD
• Authors: Arvind Arasu, Michaela Götz, Raghav Kaushik
• Keywords: Active Learning, Database, Record Matching, Record Matching Package, SIGMOD 2010