DBIRApr 17, 2012

Bayesian Data Cleaning for Web Data

arXiv:1204.3677v19 citations
Originality Incremental advance
AI Analysis

This addresses the challenge of data cleaning for web databases where curated data is unavailable, offering a solution to a domain-specific problem.

The paper tackles the problem of cleaning inconsistent web data without needing a clean training sample, by proposing a fully probabilistic framework that learns generative and error models directly from noisy data, and demonstrates its effectiveness in rectifying web data.

Data Cleaning is a long standing problem, which is growing in importance with the mass of uncurated web data. State of the art approaches for handling inconsistent data are systems that learn and use conditional functional dependencies (CFDs) to rectify data. These methods learn data patterns--CFDs--from a clean sample of the data and use them to rectify the dirty/inconsistent data. While getting a clean training sample is feasible in enterprise data scenarios, it is infeasible in web databases where there is no separate curated data. CFD based methods are unfortunately particularly sensitive to noise; we will empirically demonstrate that the number of CFDs learned falls quite drastically with even a small amount of noise. In order to overcome this limitation, we propose a fully probabilistic framework for cleaning data. Our approach involves learning both the generative and error (corruption) models of the data and using them to clean the data. For generative models, we learn Bayes networks from the data. For error models, we consider a maximum entropy framework for combing multiple error processes. The generative and error models are learned directly from the noisy data. We present the details of the framework and demonstrate its effectiveness in rectifying web data.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes