Michael Affenzeller – författare

Symbolic regression (SR) is one of the most powerful machine learning techniques that produces transparent models, searching the space of mathematical expressions for a model that represents the relationship between the predictors and the dependent variable without the need of taking assumptions about the model structure. Currently, the most prevalent learning algorithms for SR are based on genetic programming (GP), an evolutionary algorithm inspired from the well-known principles of natural selection. This book is an in-depth guide to GP for SR, discussing its advanced techniques, as well as examples of applications in science and engineering.The basic idea of GP is to evolve a population of solution candidates in an iterative, generational manner, by repeated application of selection, crossover, mutation, and replacement, thus allowing the model structure, coefficients, and input variables to be searched simultaneously. Given that explainability and interpretability are key elements for integrating humans into the loop of learning in AI, increasing the capacity for data scientists to understand internal algorithmic processes and their resultant models has beneficial implications for the learning process as a whole.This book represents a practical guide for industry professionals and students across a range of disciplines, particularly data science, engineering, and applied mathematics. Focused on state-of-the-art SR methods and providing ready-to-use recipes, this book is especially appealing to those working with empirical or semi-analytical models in science and engineering.

Symbolic regression (SR) is one of the most powerful machine learning techniques that produces transparent models, searching the space of mathematical expressions for a model that represents the relationship between the predictors and the dependent variable without the need of taking assumptions about the model structure. Currently, the most prevalent learning algorithms for SR are based on genetic programming (GP), an evolutionary algorithm inspired from the well-known principles of natural selection. This book is an in-depth guide to GP for SR, discussing its advanced techniques, as well as examples of applications in science and engineering.The basic idea of GP is to evolve a population of solution candidates in an iterative, generational manner, by repeated application of selection, crossover, mutation, and replacement, thus allowing the model structure, coefficients, and input variables to be searched simultaneously. Given that explainability and interpretability are key elements for integrating humans into the loop of learning in AI, increasing the capacity for data scientists to understand internal algorithmic processes and their resultant models has beneficial implications for the learning process as a whole.This book represents a practical guide for industry professionals and students across a range of disciplines, particularly data science, engineering, and applied mathematics. Focused on state-of-the-art SR methods and providing ready-to-use recipes, this book is especially appealing to those working with empirical or semi-analytical models in science and engineering.

Genetic Algorithms and Genetic Programming: Modern Concepts and Practical Applications discusses algorithmic developments in the context of genetic algorithms (GAs) and genetic programming (GP). It applies the algorithms to significant combinatorial optimization problems and describes structure identification using HeuristicLab as a platform for algorithm development.The book focuses on both theoretical and empirical aspects. The theoretical sections explore the important and characteristic properties of the basic GA as well as main characteristics of the selected algorithmic extensions developed by the authors. In the empirical parts of the text, the authors apply GAs to two combinatorial optimization problems: the traveling salesman and capacitated vehicle routing problems. To highlight the properties of the algorithmic measures in the field of GP, they analyze GP-based nonlinear structure identification applied to time series and classification problems. Written by core members of the HeuristicLab team, this book provides a better understanding of the basic workflow of GAs and GP, encouraging readers to establish new bionic, problem-independent theoretical concepts. By comparing the results of standard GA and GP implementation with several algorithmic extensions, it also shows how to substantially increase achievable solution quality.

Genetic Algorithms and Genetic Programming: Modern Concepts and Practical Applications discusses algorithmic developments in the context of genetic algorithms (GAs) and genetic programming (GP). It applies the algorithms to significant combinatorial optimization problems and describes structure identification using HeuristicLab as a platform for algorithm development.The book focuses on both theoretical and empirical aspects. The theoretical sections explore the important and characteristic properties of the basic GA as well as main characteristics of the selected algorithmic extensions developed by the authors. In the empirical parts of the text, the authors apply GAs to two combinatorial optimization problems: the traveling salesman and capacitated vehicle routing problems. To highlight the properties of the algorithmic measures in the field of GP, they analyze GP-based nonlinear structure identification applied to time series and classification problems. Written by core members of the HeuristicLab team, this book provides a better understanding of the basic workflow of GAs and GP, encouraging readers to establish new bionic, problem-independent theoretical concepts. By comparing the results of standard GA and GP implementation with several algorithmic extensions, it also shows how to substantially increase achievable solution quality.

This multi-volume LNCS set, LNCS 15148-15151, constitutes the refereed proceedings of the 18th International Conference on Parallel Problem Solving from Nature, PPSN 2024, held in Hagenberg, Austria, in September 2024. The 101 full papers presented in these proceedings were carefully reviewed and selected from 294 submissions.

This multi-volume LNCS set, LNCS 15148-15151, constitutes the refereed proceedings of the 18th International Conference on Parallel Problem Solving from Nature, PPSN 2024, held in Hagenberg, Austria, in September 2024. The 101 full papers presented in these proceedings were carefully reviewed and selected from 294 submissions.

This multi-volume LNCS set, LNCS 15148-15151, constitutes the refereed proceedings of the 18th International Conference on Parallel Problem Solving from Nature, PPSN 2024, held in Hagenberg, Austria, in September 2024. The 101 full papers presented in these proceedings were carefully reviewed and selected from 294 submissions.

This multi-volume LNCS set, LNCS 15148-15151, constitutes the refereed proceedings of the 18th International Conference on Parallel Problem Solving from Nature, PPSN 2024, held in Hagenberg, Austria, in September 2024. The 101 full papers presented in these proceedings were carefully reviewed and selected from 294 submissions.

This three part LNCS volumes constitutes the refereed proceedings of the 19th International Conference on Computer-Aided Systems Theory, EUROCAST 2024, held in Las Palmas de Gran Canaria, Spain, during February 25 to March 1, 2024.

This three part LNCS volumes constitutes the refereed proceedings of the 19th International Conference on Computer-Aided Systems Theory, EUROCAST 2024, held in Las Palmas de Gran Canaria, Spain, during February 25 to March 1, 2024.

This three part LNCS volumes constitutes the refereed proceedings of the 19th International Conference on Computer-Aided Systems Theory, EUROCAST 2024, held in Las Palmas de Gran Canaria, Spain, during February 25 to March 1, 2024.

BrunoBuchberger This book is a synopsis of basic and applied research done at the various re search institutions of the Softwarepark Hagenberg in Austria. Starting with 15 coworkers in my Research Institute for Symbolic Computation (RISC), I initiated the Softwarepark Hagenberg in 1987 on request of the Upper Aus trian Government with the objective of creating a scienti?c, technological, and economic impulse for the region and the international community. In the meantime, in a joint e?ort, the Softwarepark Hagenberg has grown to the current (2009) size of over 1000 R&D employees and 1300 students in six research institutions, 40 companies and 20 academic study programs on the bachelor, master’s and PhD level. The goal of the Softwarepark Hagenberg is innovation of economy in one of the most important current technologies: software. It is the message of this book that this can only be achieved and guaranteed long term by “watering the root”, namely emphasis on research, both basic and applied. In this book, we summarize what has been achieved in terms of research in the various research institutions in the Softwarepark Hagenberg and what research vision we have for the imminent future. When I founded the Softwarepark Hagenberg, in addition to the “watering the root” principle, I had the vision that such a technology park can only prosper if we realize the “magic triangle”, i.e. the close interaction of research, academic education, and business applications at one site, see Figure 1.