Probabilistic Noise Identification and Data Cleaning - Robotics Institute Carnegie Mellon University

Probabilistic Noise Identification and Data Cleaning

Jeremy Martin Kubica and Andrew Moore
Conference Paper, Proceedings of 3rd IEEE International Conference on Data Mining (ICDM '03), pp. 131 - 138, November, 2003

Abstract

Real world data is never as perfect as we would like it to be and can often suffer from corruptions that may impact interpretations of the data, models created from the data, and decisions made based on the data. One approach to this problem is to identify and remove records that contain corruptions. Unfortunately, if only certain fields in a record have been corrupted then usable, uncorrupted data will be lost. In this paper we present LENS, an approach for identifying corrupted fields and using the remaining non-corrupted fields for subsequent modeling and analysis. Our approach uses the data to learn a probabilistic model containing three components: a generative model of the clean records, a generative model of the noise values, and a probabilistic model of the corruption process. We provide an algorithm for the unsupervised discovery of such models and empirically evaluate both its performance at detecting corrupted fields and, as one example application, the resulting improvement this gives to a classifier.

BibTeX

@conference{Kubica-2003-8813,
author = {Jeremy Martin Kubica and Andrew Moore},
title = {Probabilistic Noise Identification and Data Cleaning},
booktitle = {Proceedings of 3rd IEEE International Conference on Data Mining (ICDM '03)},
year = {2003},
month = {November},
editor = {Xindong Wu and Alex Tuzhilin and Jude Shavlik},
pages = {131 - 138},
publisher = {IEEE Computer Society},
keywords = {Data Cleaning, Machine Learning, Data Mining},
}