Oliver Kramer - Böcker

The book provides a structured introduction to core areas of artificial intelligence, including machine learning, deep learning, large language models, and agent-based systems. It combines theoretical foundations with practical implementation, using tools such as scikit-learn, Keras, and Ollama. Each chapter includes code examples, exercises, and links to interactive notebooks. The focus lies on conveying applicable knowledge for real-world use. The book is intended for students and practitioners in computer science or related fields and can be used for teaching, self-study, or reference in applied contexts.

Practical optimization problems are often hard to solve, in particular when they are black boxes and no further information about the problem is available except via function evaluations. This work introduces a collection of heuristics and algorithms for black box optimization with evolutionary algorithms in continuous solution spaces.

This bookintroduces numerous algorithmic hybridizations between both worlds that showhow machine learning can improve and support evolution strategies. The set ofmethods comprises covariance matrix estimation, meta-modeling of fitness andconstraint functions, dimensionality reduction for search and visualization ofhigh-dimensional optimization processes, and clustering-based niching. Aftergiving an introduction to evolution strategies and machine learning, the bookbuilds the bridge between both worlds with an algorithmic and experimentalperspective. Experiments mostly employ a (1+1)-ES and are implemented in Pythonusing the machine learning library scikit-learn. The examples are conducted ontypical benchmark problems illustrating algorithmic concepts and theirexperimental behavior. The book closes with a discussion of related lines ofresearch.

This book constitutes revised selected papers from the 4th ECML PKDD Workshop on Data Analytics for Renewable Energy Integration, DARE 2016, held in Riva del Garda, Italy, in September 2016.

This book introduces readers to genetic algorithms (GAs) with an emphasis on making the concepts, algorithms, and applications discussed as easy to understand as possible. Further, it avoids a great deal of formalisms and thus opens the subject to a broader audience in comparison to manuscripts overloaded by notations and equations.The book is divided into three parts, the first of which provides an introduction to GAs, starting with basic concepts like evolutionary operators and continuing with an overview of strategies for tuning and controlling parameters. In turn, the second part focuses on solution space variants like multimodal, constrained, and multi-objective solution spaces. Lastly, the third part briefly introduces theoretical tools for GAs, the intersections and hybridizations with machine learning, and highlights selected promising applications.

This book constitutes revised selected papers from the 5th ECML PKDD Workshop on Data Analytics for Renewable Energy Integration, DARE 2017, held in Skopje, Macedonia, in September 2017.

This bookintroduces numerous algorithmic hybridizations between both worlds that showhow machine learning can improve and support evolution strategies. Aftergiving an introduction to evolution strategies and machine learning, the bookbuilds the bridge between both worlds with an algorithmic and experimentalperspective.

This book introduces readers to genetic algorithms (GAs) with an emphasis on making the concepts, algorithms, and applications discussed as easy to understand as possible.

Evolutionary algorithms are successful biologically inspired meta-heuristics. Their success depends on adequate parameter settings. The question arises: how can evolutionary algorithms learn parameters automatically during the optimization? Evolution strategies gave an answer decades ago: self-adaptation. Their self-adaptive mutation control turned out to be exceptionally successful. But nevertheless self-adaptation has not achieved the attention it deserves.This book introduces various types of self-adaptive parameters for evolutionary computation. Biased mutation for evolution strategies is useful for constrained search spaces. Self-adaptive inversion mutation accelerates the search on combinatorial TSP-like problems. After the analysis of self-adaptive crossover operators the book concentrates on premature convergence of self-adaptive mutation control at the constraint boundary. Besides extensive experiments, statistical tests and some theoretical investigations enrich the analysis of the proposed concepts.

Computational Intelligence (CI) bezeichnet ein Teilgebiet der Künstlichen Intelligenz, das biologische inspirierte Modelle algorithmisch umsetzt. Evolutionäre Algorithmen orientieren sich an der darwinistischen Evolution und suchen mit Hilfe von Crossover, Mutation und Selektion eine optimale Lösung. Die Fuzzy-Logik ermöglicht als unscharfe Logik eine kognitive Modellierung von Wissen und Inferenzprozessen. Neuronale Netze imitieren funktionale Aspekte des Gehirns für Aufgaben wie Klassifikation und Mustererkennung. Neuere Ansätze der CI wie Reinforcement Learning ermöglichen, das Verhalten künstlicher Agenten in unbekannten Umgebungen zu steuern. Die Schwarmintelligenz modelliert Algorithmen, die auf Basis vieler einfacher Komponenten intelligente Leistungen vollführen. Zu guter Letzt lösen künstliche Immunsysteme eine Reihe von Problemen, ähnlich wie ihr biologisches Pendant. Ein kompakter und übersichtlicher mit vielen Beispielen gespickter Einstieg in die verschiedenen Verfahren der CI.

Evolutionary algorithms are successful biologically inspired meta-heuristics. Their success depends on adequate parameter settings. The question arises: how can evolutionary algorithms learn parameters automatically during the optimization? Evolution strategies gave an answer decades ago: self-adaptation. Their self-adaptive mutation control turned out to be exceptionally successful. But nevertheless self-adaptation has not achieved the attention it deserves.This book introduces various types of self-adaptive parameters for evolutionary computation. Biased mutation for evolution strategies is useful for constrained search spaces. Self-adaptive inversion mutation accelerates the search on combinatorial TSP-like problems. After the analysis of self-adaptive crossover operators the book concentrates on premature convergence of self-adaptive mutation control at the constraint boundary. Besides extensive experiments, statistical tests and some theoretical investigations enrich the analysis of the proposed concepts.

This book is devoted to a novel approach for dimensionality reduction based on the famous nearest neighbor method that is a powerful classification and regression approach. It starts with an introduction to machine learning concepts and a real-world application from the energy domain. Then, unsupervised nearest neighbors (UNN) is introduced as efficient iterative method for dimensionality reduction. Various UNN models are developed step by step, reaching from a simple iterative strategy for discrete latent spaces to a stochastic kernel-based algorithm for learning submanifolds with independent parameterizations. Extensions that allow the embedding of incomplete and noisy patterns are introduced. Various optimization approaches are compared, from evolutionary to swarm-based heuristics. Experimental comparisons to related methodologies taking into account artificial test data sets and also real-world data demonstrate the behavior of UNN in practical scenarios. The book contains numerous color figures to illustrate the introduced concepts and to highlight the experimental results.