Jörg Hähner
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jörg Hähner has a total of 50 co-authors. Here are the top co-authors by number of shared publications:
- Michael Heider
Universitat Augsburg, Augsburg, Germany
21 shared publications - Helena Stegherr
Universiät Augsburg
10 shared publications - David Pätzel
University of Augsburg, Augsburg, Germany
9 shared publications - Henning Cui
University of Augsburg, Augsburg, Germany
8 shared publications - Jonathan Wurth
Universitat Augsburg, Augsburg, Germany
7 shared publications - Anthony Stein
University of Hohenheim
6 shared publications
Latest Publications
- 25 August 2026
- Published by Springer Nature
- p. 516-531
Decomposing Anytime Algorithm Performance with Bayesian Ranking ANOVA
- 25 August 2026
- Published by Springer Nature
- p. 516-531
Decomposing Anytime Algorithm Performance with Bayesian Ranking ANOVA
- Open Access
- 13 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1220-1227
Exploring Multi-objective Approaches for Rule Generation in Rule-based Machine Learning
- 13 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1220-1227
Open AccessExploring Multi-objective Approaches for Rule Generation in Rule-based Machine Learning
- Open Access
- 14 February 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 314
Assessing stakeholder perspectives on the explainability of AI solutions for smart production planning with just-in-time logistics
- 14 February 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 314
Open AccessAssessing stakeholder perspectives on the explainability of AI solutions for smart production planning with just-in-time logistics
- 8 February 2026
- Published by Springer Nature
- p. 618-628
Adaptive by Design: Rethinking the MLOC Architecture for Learning Systems
- 8 February 2026
- Published by Springer Nature
- p. 618-628
Adaptive by Design: Rethinking the MLOC Architecture for Learning Systems
- 1 February 2026
- Published by Springer Nature
- p. 311-332
Extending Cartesian Genetic Programming via Iterative Subgraph Assessment
- 1 February 2026
- Published by Springer Nature
- p. 311-332
Extending Cartesian Genetic Programming via Iterative Subgraph Assessment
- Open Access
- 19 August 2025
- Published by Springer Nature in SN Computer Science
- Vol. 6 (7) , 1-17
Analysing the Influence of Reorder Strategies for Cartesian Genetic Programming
Cartesian Genetic Programming (CGP) suffers from a specific limitation: Positional bias, a phenomenon in which mostly genes at the start of the genome contribute to a program output, while genes at the end rarely do. This can lead to an overall worse performance of CGP. One solution to overcome positional bias is to introduce reordering methods, which shuffle the current genotype without changing its corresponding phenotype. There are currently two different reorder operators that extend the classic CGP formula and improve its fitness value. In this work, we discuss possible shortcomings of these two existing operators. Afterwards, we introduce three novel operators which reorder the genotype of a graph defined by CGP. We show empirically on four Boolean and four symbolic regression benchmarks that the number of iterations until a solution is found and/or the fitness value improves by using CGP with a reorder method. However, there is no consistently best performing reorder operator. Furthermore, their behaviour is analysed by investigating their convergence plots and we show that all behave the same in terms of convergence type.
- 19 August 2025
- Published by Springer Nature in SN Computer Science
- Vol. 6 (7) , 1-17
Open AccessAnalysing the Influence of Reorder Strategies for Cartesian Genetic Programming
Cartesian Genetic Programming (CGP) suffers from a specific limitation: Positional bias, a phenomenon in which mostly genes at the start of the genome contribute to a program output, while genes at the end rarely do. This can lead to an overall worse performance of CGP. One solution to overcome positional bias is to introduce reordering methods, which shuffle the current genotype without changing its corresponding phenotype. There are currently two different reorder operators that extend the classic CGP formula and improve its fitness value. In this work, we discuss possible shortcomings of these two existing operators. Afterwards, we introduce three novel operators which reorder the genotype of a graph defined by CGP. We show empirically on four Boolean and four symbolic regression benchmarks that the number of iterations until a solution is found and/or the fitness value improves by using CGP with a reorder method. However, there is no consistently best performing reorder operator. Furthermore, their behaviour is analysed by investigating their convergence plots and we show that all behave the same in terms of convergence type.
- Open Access
- 14 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 171-174
A Comparison of Dimensionality Reduction Techniques for Visualising Search Behaviour
- 14 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 171-174
Open AccessA Comparison of Dimensionality Reduction Techniques for Visualising Search Behaviour
- Open Access
- 14 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 119-122
CRust_GP: A Framework for the Modular Construction and Evaluation of Cartesian Genetic Programming in Rust
- 14 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 119-122
Open AccessCRust_GP: A Framework for the Modular Construction and Evaluation of Cartesian Genetic Programming in Rust
- Open Access
HOIverse: A Synthetic Scene Graph Dataset With Human Object Interactions
When humans and robotic agents coexist in an environment, scene understanding becomes crucial for the agents to carry out various downstream tasks like navigation and planning. Hence, an agent must be capable of localizing and identifying actions performed by the human. Current research lacks reliable datasets for performing scene understanding within indoor environments where humans are also a part of the scene. Scene Graphs enable us to generate a structured representation of a scene or an image to perform visual scene understanding. To tackle this, we present HOIverse a synthetic dataset at the intersection of scene graph and human-object interaction, consisting of accurate and dense relationship ground truths between humans and surrounding objects along with corresponding RGB images, segmentation masks, depth images and human keypoints. We compute parametric relations between various pairs of objects and human-object pairs, resulting in an accurate and unambiguous relation definitions. In addition, we benchmark our dataset on state-of-the-art scene graph generation models to predict parametric relations and human-object interactions. Through this dataset, we aim to accelerate research in the field of scene understanding involving people.
Open AccessHOIverse: A Synthetic Scene Graph Dataset With Human Object Interactions
When humans and robotic agents coexist in an environment, scene understanding becomes crucial for the agents to carry out various downstream tasks like navigation and planning. Hence, an agent must be capable of localizing and identifying actions performed by the human. Current research lacks reliable datasets for performing scene understanding within indoor environments where humans are also a part of the scene. Scene Graphs enable us to generate a structured representation of a scene or an image to perform visual scene understanding. To tackle this, we present HOIverse a synthetic dataset at the intersection of scene graph and human-object interaction, consisting of accurate and dense relationship ground truths between humans and surrounding objects along with corresponding RGB images, segmentation masks, depth images and human keypoints. We compute parametric relations between various pairs of objects and human-object pairs, resulting in an accurate and unambiguous relation definitions. In addition, we benchmark our dataset on state-of-the-art scene graph generation models to predict parametric relations and human-object interactions. Through this dataset, we aim to accelerate research in the field of scene understanding involving people.