REIN: A Comprehensive Benchmark Framework for Data Cleaning Methods in ML Pipelines

Mohamed Abdelaal, Christian Hammacher, Harald Schoening
2/9/2023
cs.DBcs.LG

No official code found. Best implementation: mohamedyd/rein-benchmark (16 stars, last commit 2024-07-24).

Abstract

Nowadays, machine learning (ML) plays a vital role in many aspects of our daily life. In essence, building well-performing ML applications requires the provision of high-quality data throughout the entire life-cycle of such applications. Nevertheless, most of the real-world tabular data suffer from different types of discrepancies, such as missing values, outliers, duplicates, pattern violation, and inconsistencies. Such discrepancies typically emerge while collecting, transferring, storing, and/or integrating the data. To deal with these discrepancies, numerous data cleaning methods have been introduced. However, the majority of such methods broadly overlook the requirements imposed by downstream ML models. As a result, the potential of utilizing these data cleaning methods in ML pipelines is predominantly unrevealed. In this work, we introduce a comprehensive benchmark, called REIN1, to thoroughly investigate the impact of data cleaning methods on various ML models. Through the benchmark, we provide answers to important research questions, e.g., where and whether data cleaning is a necessary step in ML pipelines. To this end, the benchmark examines 38 simple and advanced error detection and repair methods. To evaluate these methods, we utilized a wide collection of ML models trained on 14 publicly-available datasets covering different domains and encompassing realistic as well as synthetic error profiles.

View on arXivView PDF

Code Implementations(1)

A comprehensive benchmark for data cleaning methods and their impact of ML models

165M, C++May 27, 20222 years ago

Similar Papers

Cite this paper

@article{abdelaal2023rein,
  title  = {REIN: A Comprehensive Benchmark Framework for Data Cleaning Methods in ML Pipelines},
  author = {Mohamed Abdelaal and Christian Hammacher and Harald Schoening},
  year   = {2023},
  eprint = {2302.04702},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2302.04702v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2302.04702.svg)](https://codeofpaper.com/paper/2302.04702)

Discussion