Salvato in:
| Autori principali: | , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | https://arxiv.org/abs/2503.13921 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866910058105798656 |
|---|---|
| author | Zhen, Cheng Prayoga Aryal, Nischal Termehchy, Arash Biwer, Garrett Alzamil, Lubna |
| author_facet | Zhen, Cheng Prayoga Aryal, Nischal Termehchy, Arash Biwer, Garrett Alzamil, Lubna |
| contents | Missing data often exists in real-world datasets, requiring significant time and effort for data repair to learn accurate models. In this paper, we show that imputing all missing values is not always necessary to achieve an accurate ML model. We introduce concepts of minimal and almost minimal repair, which are subsets of missing data items in training data whose imputation delivers accurate and reasonably accurate models, respectively. Imputing these subsets can significantly reduce the time, computational resources, and manual effort required for learning. We show that finding these subsets is NP-hard for some popular models and propose efficient approximation algorithms for wide range of models. Our extensive experiments indicate that our proposed algorithms can substantially reduce the time and effort required to learn on incomplete datasets. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_13921 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Learning Over Dirty Data with Minimal Repairs Zhen, Cheng Prayoga Aryal, Nischal Termehchy, Arash Biwer, Garrett Alzamil, Lubna Machine Learning Artificial Intelligence Missing data often exists in real-world datasets, requiring significant time and effort for data repair to learn accurate models. In this paper, we show that imputing all missing values is not always necessary to achieve an accurate ML model. We introduce concepts of minimal and almost minimal repair, which are subsets of missing data items in training data whose imputation delivers accurate and reasonably accurate models, respectively. Imputing these subsets can significantly reduce the time, computational resources, and manual effort required for learning. We show that finding these subsets is NP-hard for some popular models and propose efficient approximation algorithms for wide range of models. Our extensive experiments indicate that our proposed algorithms can substantially reduce the time and effort required to learn on incomplete datasets. |
| title | Learning Over Dirty Data with Minimal Repairs |
| topic | Machine Learning Artificial Intelligence |
| url | https://arxiv.org/abs/2503.13921 |