activity
20192023
most citedContemporary Symbolic Regression Methods and their Relative Performance

144 citations · 274 across the 10 of their papers we have counts for

collaborators
Showing cs.LGShow all

6 papers · 1 filter

cs.LG2023★ 9 cited

Interpretable Symbolic Regression for Data Science: Analysis of the 2022 Competition

F. O. de Franca, M. Virgolin, M. Kommenda +21

Symbolic regression searches for analytic expressions that accurately describe studied phenomena. The main attraction of this approach is that it returns an interpretable model tha…

cs.LG2021★ 9 cited

Cluster Analysis of a Symbolic Regression Search Space

Gabriel Kronberger, Lukas Kammerer, Bogdan Burlacu +3

In this chapter we take a closer look at the distribution of symbolic regression models generated by genetic programming in the search space. The motivation for this work is to imp…

cs.LG2021★ 19 cited

Symbolic Regression by Exhaustive Search: Reducing the Search Space Using Syntactical Constraints and Efficient Semantic Structure Deduplication

Lukas Kammerer, Gabriel Kronberger, Bogdan Burlacu +3

Symbolic regression is a powerful system identification technique in industrial scenarios where no prior knowledge on model structure is available. Such scenarios often require spe…

cs.LG2021★ 2 cited

Optimization Networks for Integrated Machine Learning

Michael Kommenda, Johannes Karder, Andreas Beham +4

Optimization networks are a new methodology for holistically solving interrelated problems that have been developed with combinatorial optimization problems in mind. In this contri…

cs.LG2021★ 2 cited

On the Effectiveness of Genetic Operations in Symbolic Regression

Bogdan Burlacu, Michael Affenzeller, Michael Kommenda

This paper describes a methodology for analyzing the evolutionary dynamics of genetic programming (GP) using genealogical information, diversity measures and information about the…

cs.LG2021

Hash-Based Tree Similarity and Simplification in Genetic Programming for Symbolic Regression

Bogdan Burlacu, Lukas Kammerer, Michael Affenzeller +1

We introduce in this paper a runtime-efficient tree hashing algorithm for the identification of isomorphic subtrees, with two important applications in genetic programming for symb…