Data Cleaning and AutoML: Would an Optimizer Choose to Clean?
| dc.contributor.author | Neutatz, Felix | |
| dc.contributor.author | Chen, Binger | |
| dc.contributor.author | Alkhatib, Yazan | |
| dc.contributor.author | Ye, Jingwen | |
| dc.contributor.author | Abedjan, Ziawasch | |
| dc.date.accessioned | 2022-08-05T09:15:29Z | |
| dc.date.available | 2022-08-05T09:15:29Z | |
| dc.date.issued | 2022-05-13 | |
| dc.description.abstract | Data cleaning is widely acknowledged as an important yet tedious task when dealing with large amounts of data. Thus, there is always a cost-benefit trade-off to consider. In particular, it is important to assess this trade-off when not every data point and data error is equally important for a task. This is often the case when statistical analysis or machine learning (ML) models derive knowledge about data. If we only care about maximizing the utility score of the applications, such as accuracy or F1 scores, many tasks can afford some degree of data quality problems. Recent studies analyzed the impact of various data error types on vanilla ML tasks, showing that missing values and outliers significantly impact the outcome of such models. In this paper, we expand the setting to one where data cleaning is not considered in isolation but as an equal parameter among many other hyper-parameters that influence feature selection, regularization, and model selection. In particular, we use state-of-the-art AutoML frameworks to automatically learn the parameters that benefit a particular ML binary classification task. In our study, we see that specific cleaning routines still play a significant role but can also be entirely avoided if the choice of a specific model or the filtering of specific features diminishes the overall impact. | en |
| dc.description.sponsorship | TU Berlin, Open-Access-Mittel – 2022 | en |
| dc.description.sponsorship | BMBF, 01IS18025A, Verbundprojekt BIFOLD-BBDC: Berlin Institute for the Foundations of Learning and Data | en |
| dc.description.sponsorship | BMBF, 01IS18037A, Verbundprojekt BIFOLD-BZML: Berlin Institute for the Foundations of Learning and Data | en |
| dc.identifier.eissn | 1610-1995 | |
| dc.identifier.issn | 1618-2162 | |
| dc.identifier.uri | https://depositonce.tu-berlin.de/handle/11303/17202 | |
| dc.identifier.uri | http://dx.doi.org/10.14279/depositonce-15981 | |
| dc.language.iso | en | en |
| dc.rights.uri | https://creativecommons.org/licenses/by/4.0/ | en |
| dc.subject.ddc | 004 Datenverarbeitung; Informatik | de |
| dc.subject.other | machine learning | en |
| dc.subject.other | data cleaning | en |
| dc.subject.other | AutoML | en |
| dc.title | Data Cleaning and AutoML: Would an Optimizer Choose to Clean? | en |
| dc.type | Article | en |
| dc.type.version | publishedVersion | en |
| dcterms.bibliographicCitation.doi | 10.1007/s13222-022-00413-2 | en |
| dcterms.bibliographicCitation.journaltitle | Datenbank-Spektrum | en |
| dcterms.bibliographicCitation.originalpublishername | Springer Nature | en |
| dcterms.bibliographicCitation.originalpublisherplace | Heidelberg | en |
| dcterms.bibliographicCitation.pageend | 130 | en |
| dcterms.bibliographicCitation.pagestart | 121 | en |
| dcterms.bibliographicCitation.volume | 22 | en |
| tub.accessrights.dnb | free | en |
| tub.affiliation | Fak. 4 Elektrotechnik und Informatik::Inst. Softwaretechnik und Theoretische Informatik::FG Datenbanksysteme und Informationsmanagement (DIMA) | de |
| tub.affiliation.faculty | Fak. 4 Elektrotechnik und Informatik | de |
| tub.affiliation.group | FG Datenbanksysteme und Informationsmanagement (DIMA) | de |
| tub.affiliation.institute | Inst. Softwaretechnik und Theoretische Informatik | de |
| tub.publisher.universityorinstitution | Technische Universität Berlin | en |