Skip to main content

Reinforcement Learning for Data Preparation with Active Reward Learning

  • Conference paper
  • First Online:
Internet Science (INSCI 2019)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 11938))

Included in the following conference series:

Abstract

Data cleaning and data preparation have been long-standing challenges in data science to avoid incorrect results, biases, and misleading conclusions obtained from “dirty” data. For a given dataset and data analytics task, a plethora of data preprocessing techniques and alternative data cleaning strategies are available, but they may lead to dramatically different outputs with unequal result quality performances. For adequate data preparation, the users generally do not know how to start with or which methods to use. Most current work can be classified into two categories: (1) they propose new data cleaning algorithms specific to certain types of data anomalies usually considered in isolation and without a “pipeline vision” of the entire data preprocessing strategy; (2) they develop automated machine learning approaches (AutoML) that can optimize the hyper-parameters of a considered ML model with a list of by-default preprocessing methods. We argue that more efforts should be devoted to proposing a principled and adaptive data preparation approach to help and learn from the user for selecting the optimal sequence of data preparation tasks to obtain the best quality performance of the final result. In this paper, we extend Learn2Clean, a method based on Q-Learning, a model-free reinforcement learning technique that selects, for a given dataset, a given ML model, and a preselected quality performance metric, the optimal sequence of tasks for preprocessing the data such that the quality metric is maximized. We will discuss some new results of Learn2Clean for semi-automating data preparation with “the human in the loop” using active reward learning and Q-learning.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    https://www.kaggle.com/surveys/2017.

  2. 2.

    https://github.com/LaureBerti/Learn2Clean.

  3. 3.

    We use subscripts to denote the sequences of actions annotated by the human analyst, i.e., \(\mathbf{q}_{1:n}=\{q(\mathcal {S}_1),\ldots ,q(\mathcal {S}_n) \})\) with related reward \(\mathbf{R}_{1:n}=\{R(\mathcal {S}_1),\ldots ,R(\mathcal {S}_n) \})\).

  4. 4.

    https://www.kaggle.com/datasets.

References

  1. Berti-Équille, L.: Learn2Clean: optimizing the sequence of tasks for web data preparation. In: Proceedings of the The Web Conference 2019 (2019)

    Google Scholar 

  2. Fan, W.: Data quality: from theory to practice. SIGMOD Rec. 44(3), 7–18 (2015)

    Article  Google Scholar 

  3. Feurer, M., Klein, A., Eggensperger, K., Springenberg, J., Blum, M., Hutter, F.: Efficient and robust automated machine learning. Adv. Neural Inf. Process. Syst. 28, 2962–2970 (2015)

    Google Scholar 

  4. Ilyas, I.F., Chu, X.: Trends in cleaning relational data: consistency and deduplication. Found. Trends Databases 5(4), 281–393 (2015)

    Article  Google Scholar 

  5. Konda, P., et al.: Magellan: toward building entity matching management systems. PVLDB 9(12), 1197–1208 (2016)

    Google Scholar 

  6. Konda, P., et al.: Magellan: toward building entity matching management systems. Proc. VLDB Endow. 9(12), 1197–1208 (2016)

    Article  Google Scholar 

  7. Krishnan, S., Franklin, M.J., Goldberg, K., Wu, E.: Boostclean: automated error detection and repair for machine learning. CoRR abs/1711.01299 (2017)

    Google Scholar 

  8. Matthew Hoffman, E.B., de Freitas, N.: Portfolio allocation for Bayesian optimization. In: 27th Conference on Uncertainty in Artificial Intelligence (UAI2011) (2011)

    Google Scholar 

  9. Navarro, G.: Approximate string matching. In: Encyclopedia of Algorithms, pp. 102–106 (2016)

    Chapter  Google Scholar 

  10. Rasmussen, C.E., Williams, C.K.I.: Gaussian Processes for Machine Learning (Adaptive Computation and Machine Learning). The MIT Press, Cambridge (2005)

    Book  Google Scholar 

  11. Rekatsinas, T., Chu, X., Ilyas, I.F., Ré, C.: HoloClean: holistic data repairs with probabilistic inference. PVLDB 10(11), 1190–1201 (2017)

    Google Scholar 

  12. Sarawagi, S., Bhamidipaty, A.: Interactive deduplication using active learning. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2002, pp. 269–278. ACM, New York (2002)

    Google Scholar 

  13. Schafer, J.: Analysis of Incomplete Multivariate Data. Chapman & Hall (1997)

    Google Scholar 

  14. Sutton, R.S., Barto, A.G.: Introduction to Reinforcement Learning. MIT Press, Cambridge (1998)

    Book  Google Scholar 

  15. Watkins, C.J.C.H., Dayan, P.: Technical note: Q-learning. Mach. Learn. 8(3–4), 1190–1201 (1992)

    Google Scholar 

  16. Yakout, M., Berti-Équille, L., Elmagarmid, A.K.: Don’t be scared: use scalable automatic repairing with maximal likelihood and bounded changes. In: Proceedings of the ACM SIGMOD, pp. 553–564 (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Laure Berti-Equille .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Berti-Equille, L. (2019). Reinforcement Learning for Data Preparation with Active Reward Learning. In: El Yacoubi, S., Bagnoli, F., Pacini, G. (eds) Internet Science. INSCI 2019. Lecture Notes in Computer Science(), vol 11938. Springer, Cham. https://doi.org/10.1007/978-3-030-34770-3_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-34770-3_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-34769-7

  • Online ISBN: 978-3-030-34770-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics