Abstract
This chapter discusses the issue of whether it is possible to automate the design of rather complex workflows needed when addressing more complex data science tasks. The focus here is on symbolic approaches, which continue to be relevant. The chapter starts by discussing some more complex operators, including, for instance, conditional operators and operators used in iterative processing. Next, we discuss the issue of introduction of new concepts and the changes of granularity that can be achieved as a result. We review various approaches explored in the past, such as constructive induction, propositionalization, reformulation of rules, among others, but also draw attention to some new advances, such as feature construction in deep NNs. It is foreseeable that in the future both symbolic and subsymbolic approaches will coexist in systems exhibiting a kind of functional symbiosis. There are tasks that cannot be learned in one go, but rather require a sub-division into subtasks, a plan for learning the constituents, and joining the parts together. Some of these subtasks may be interdependent. Some tasks may require an iterative process in the process of learning. This chapter discusses various examples that can stimulate both further research and some practical solutions in this rather challenging area.
Chapter PDF
Similar content being viewed by others
References
Aha, D. W., Lapointe, S., Ling, C. X., and Matwin, S. (1994). Inverting implication with small training set. In Bergadano, F. and De Raedt, L., editors, Machine Learning: ECML-94, European Conference on Machine Learning, Catania, Italy, volume 784 of Lecture Notes in Artificial Intelligence, pages 31–48. Springer.
Baroglio, C., Giordana, A., and Saitta, L. (1992). Learning mutually dependent relations. Journal of Intelligent Information Systems, 1:159–176.
Brazdil, P. (1981). Model of Error Detection and Correction. PhD thesis, University of Edinburgh.
Brazdil, P. (1984). Use of derivation trees in discrimination. In O’Shea, T., editor, ECAI1984 - Proceedings of 6th European Conference on Artificial Intelligence, pages 239–244. North-Holland.
Burstall, R. M. and Darlington, J. (1977). A transformation system for developing recursive programs. J. ACM, 24(1):44–67.
Camacho, R. and Brazdil, P. (2001). Improving the robustness and encoding complexity of behavioural clones. In De Raedt, L. and Flach, P., editors, Proceedings of the 12th European Conference on Machine Learning (ECML ’01), LNAI 2167, pages 37–48, Freiburg, Germany. Springer.
De Raedt, L. (2008). Logical and Relational Learning. Springer.
Dean, T. and Boddy, M. (1988). Reasoning about partially ordered events. Artificial Intelligence, 36:375–399.
Diettrich, T. and Michalski, R. (1983). A comparative review of selected methods for learning from examples. In Michalski, R., Carbonell, J., and Mitchell, T., editors, Machine Learning: An Artificial Intelligence Approach, pages 41–82. Tioga Publishing Company.
Ferrucci, D., Levas, A., Bagchi, S., Gondek, D., and Mueller, E. (2013). Watson: Beyond Jeopardy! Artificial Intelligence, 199:93–105.
Fürnkranz, J. and Hüllermeier, E. (2003). Pairwise preference learning and ranking. In Lavrač, N., Gamberger, D., Blockeel, H., and Todorovski, L., editors, Proceedings of the 14th European Conference on Machine Learning (ECML2003), volume 2837 of LNAI, pages 145–156. Springer-Verlag.
Fürnkranz, J. and Hüllermeier, E. (2011). Preference Learning. Springer-Verlag.
Jorge, A. M. (1998). Iterative Induction of Logic Programs. PhD thesis, Faculty of Sciences, University of Porto.
Jorge, A. M. and Brazdil, P. (1996). Architecture for iterative learning of recursive definitions. In De Raedt, L., editor, Advances in Inductive Logic Programming, volume 32 of Frontiers in Artificial Intelligence and applications. IOS Press.
Kietz, J.-U., Serban, F., Bernstein, A., and Fischer, S. (2012). Designing KDD-Workflows via HTN-Planning for Intelligent Discovery Assistance. In Vanschoren, J., Brazdil, P., and Kietz, J.-U., editors, PlanLearn-2012, 5th Planning to Learn Workshop WS28 at ECAI-2012, Montpellier, France.
Lake, B. M., Ullman, T. D., Tenenbaum, J. B., and Gershman, S. J. (2017). Building machines that learn and think like people. Beh. and Brain Sciences, 40.
Lavrač, N. and Džeroski, S. (1994). Inductive Logic Programming: Techniques and Applications, chapter 5. LINUS: Using attribute-value learners in an ILP framework, pages 81–122. Ellis Horwood.
Lavrač, N., Džeroski, S., and Grobelnik, M. (1991). Learning non-recursive definitions of relations with LINUS. In Proceedings of the 5th Working Session on Learning, pages 265–281. Springer.
Mitchell, T. (1977). Version spaces: A candidate elimination approach to rule learning. PhD thesis, Electrical Engineering Department, Stanford University.
Mitchell, T. (1982). Generalization as Search. Artificial Intelligence, 18(2):203–226.
Muggleton, S. (1987). Duce: an oracle-based approach to constructive induction. In Proceedings of the 10th International Joint Conference on Artificial Intelligence, pages 287–292. Morgan Kaufmann.
Muggleton, S. and Buntine, R. (1988). Machine invention of first-order predicated by inverting resolution. In Proceedings of the 5th International Workshop on Machine Learning, pages 339–351. Morgan Kaufmann.
Muggleton, S. H. (1991). Inverting resolution principle. In Hayes, J. E., Michie, D., and Tyugu, Ė., editors, Machine Intelligence 12: Towards an Automated Logic and Thought.
Sammut, C. (1981). Concept learning by experiment. In Proceedings of the Seventh International Joint Conference on Artificial Intelligence, Vancouver.
Shapiro, E., editor (1996). Algorithmic Program Debugging. MIT Press.
Stone, P. (2000). Layered Learning in Multiagent Systems: A Winning Approach to Robotic Soccer. MIT Press.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This chapter is licensed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.
The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.
Copyright information
© 2022 The Author(s)
About this chapter
Cite this chapter
Brazdil, P., van Rijn, J.N., Soares, C., Vanschoren, J. (2022). Automating the Design of Complex Systems. In: Metalearning. Cognitive Technologies. Springer, Cham. https://doi.org/10.1007/978-3-030-67024-5_15
Download citation
DOI: https://doi.org/10.1007/978-3-030-67024-5_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-67023-8
Online ISBN: 978-3-030-67024-5
eBook Packages: Computer ScienceComputer Science (R0)