A greedy search tree heuristic for symbolic regression

DOI10.1016/j.ins.2018.02.040zbMath1447.62080arXiv1801.01807OpenAlexW2782083374MaRDI QIDQ2198020

Fabrício Olivetti de França

Publication date: 8 September 2020

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1801.01807

zbMATH Keywords

regression analysissymbolic regressiongreedy heuristic

Mathematics Subject Classification ID

General nonlinear regression (62J02) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Data structures (68P05)

Related Items (2)

Discovering interpretable elastoplasticity models via the neural polynomial method enabled symbolic regressions ⋮ Divide and Conquer: A Quick Scheme for Symbolic Regression

Uses Software

• Scikit

Cites Work

• Regularization and Variable Selection Via the Elastic Net
• Approximation by superpositions of a sigmoidal function
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A greedy search tree heuristic for symbolic regression