Hash-based Tree Similarity And Simplification In Genetic Programming For Symbolic Regression | Awesome Learning to Hash Add your paper to Learning2Hash

Awesome Learning to Hash

A Webpage dedicated to the latest research on Hash Function Learning. Maintained by Sean Moran.

Contact Sean Moran about this survey or website. Made with Jekyll and Hyde.

Hash-based Tree Similarity And Simplification In Genetic Programming For Symbolic Regression

Burlacu Bogdan, Kammerer Lukas, Affenzeller Michael, Kronberger Gabriel. In Moreno-Diaz R. et al. Computer Aided Systems Theory. Lecture Notes in Computer Science Vol. 2021

[Paper]    
Supervised

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 symbolic regression: fast, online calculation of population diversity and algebraic simplification of symbolic expression trees. Based on this hashing approach, we propose a simple diversity-preservation mechanism with promising results on a collection of symbolic regression benchmark problems.

Similar Work