BClean: A Bayesian Data Cleaning System
Jianbin Qin, Sifan Huang, Yaoshu Wang, Jing Zhu, Yifan Zhang, Yukai Miao, Rui Mao, Makoto Onizuka, Chuan Xiao
摘要
There is a considerable body of work on data cleaning which employs various principles to rectify erroneous data and transform a dirty dataset into a cleaner one. One of prevalent approaches is probabilistic methods, including Bayesian methods. However, existing probabilistic methods often assume a simplistic distribution (e.g., Gaussian distribution), which is frequently under-fitted in practice, or they necessitate experts to provide a complex prior distribution (e.g., via a programming language). This requirement is both labor-intensive and costly, rendering these methods less suitable for real-world applications. In this paper, we propose BClean, a Bayesian Cleaning system that features automatic Bayesian network construction and user interaction. We recast the data cleaning problem as a Bayesian inference that fully exploits the relationships between attributes in the observed dataset and any prior information provided by users. To this end, we present an automatic Bayesian network construction method that extends a structure learning-based functional dependency discovery method with similarity functions to capture the relationships between attributes. Furthermore, our system allows users to modify the generated Bayesian network in order to specify prior information or correct inaccuracies identified by the automatic generation process. We also design an effective scoring model (called the compensative scoring model) necessary for the Bayesian inference. To enhance the efficiency of data cleaning, we propose several approximation strategies for the Bayesian inference, including graph partitioning, domain pruning, and pre-detection. By evaluating on both real-world and synthetic datasets, we demonstrate that BClean is capable of achieving an F-measure of up to 0.9 in data cleaning, outperforming existing Bayesian methods by 2% and other data cleaning methods by 15%.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper1
问问它们各自怎么用它它引用的顶会 Paper5
- CleanML: A Study for Evaluating the Impact of Data Cleaning on ML Classification TasksPeng Li, Xi Rao, Jennifer Blase, Yue Zhang 等ICDE 2021 · 被引用 127 次
- A Statistical Perspective on Discovering Functional Dependencies in Noisy DataYunjia Zhang, Zhihan Guo, Theodoros RekatsinasSIGMOD 2020 · 被引用 45 次
- Parallel Discrepancy Detection and Incremental DetectionWenfei Fan, Chao Tian, Yanghao Wang, Qiang YinVLDB 2021 · 被引用 29 次
- Self-supervised and Interpretable Data Cleaning with Sequence Generative Adversarial NetworksJinfeng Peng, Derong Shen, Nan Tang, Tieying Liu 等VLDB 2023 · 被引用 24 次
- Parallel Rule Discovery from Large Datasets by SamplingWenfei Fan, Ziyan Han, Yaoshu Wang, Min XieSIGMOD 2022 · 被引用 21 次
相关 Paper
- DAFDiscover: Robust Mining Algorithm for Dynamic Approximate Functional Dependencies on Dirty DataXiaoou Ding, Yixing Lu, Hongzhi Wang, Chen Wang 等VLDB 2024 · 被引用 4 次
- Fast Discovery of Functional Dependencies via Bayesian Network LearningSiyi Yang, Shenglin Chen, Xi Wang, Yuhua Tang 等ICDE 2026
- Automatic Feasibility Study via Data Quality Analysis for ML: A Case-Study on Label NoiseCédric Renggli, Luka Rimanic, Luka Kolar, Wentao Wu 等ICDE 2023 · 被引用 8 次
- Minimum Change≠ Best Cleaning: Parallel and Incremental Error Detection under Integrity ConstraintsJiahui Chen, Yu Sun, Shaoxu Song, Haiwei Zhang 等SIGMOD 2026 · 被引用 2 次
- Learning Over Dirty Data Without CleaningJose Picado, John Davis, Arash Termehchy, Ga Young LeeSIGMOD 2020 · 被引用 13 次
