Author:
Brazdil Pavel,van Rijn Jan N.,Soares Carlos,Vanschoren Joaquin
Abstract
AbstractThis 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.
Publisher
Springer International Publishing
Reference26 articles.
1. 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.
2. Baroglio, C., Giordana, A., and Saitta, L. (1992). Learning mutually dependent relations. Journal of Intelligent Information Systems, 1:159–176.
3. Brazdil, P. (1981). Model of Error Detection and Correction. PhD thesis, University of Edinburgh.
4. 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.
5. Burstall, R. M. and Darlington, J. (1977). A transformation system for developing recursive programs. J. ACM, 24(1):44–67.