Divide and Conquer: A Quick Scheme for Symbolic Regression

DOI10.1142/S0219876221420020MaRDI QIDQ6172979zbMATH OpenOpenAlexFDO

Authors Changtong Luo, Chen Chen, Zong-Lin Jiang

Publication date 21 July 2023

Published in International Journal of Computational Methods (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0219876221420020

zbMATH Keywords

bi-correlation testdivide and conquergenetic programmingmachine learningmathematical modelingsymbolic regression

Mathematics Subject Classification ID

Numerical analysis (65-XX) Computer science (68-XX)

Recommendations

• A greedy search tree heuristic for symbolic regression
• Learning Symbolic Expressions: Mixed-Integer Formulations, Cuts, and Heuristics
• A global MINLP approach to symbolic regression
• Enhancing gene expression programming based on space partition and jump for symbolic regression
• Symbolic regression via neural networks

Cites work

• A greedy search tree heuristic for symbolic regression
• An energy approach to the solution of partial differential equations in computational mechanics via machine learning: concepts, implementation and applications
• Deep autoencoder based energy method for the bending, vibration, and buckling analysis of Kirchhoff plates with transfer learning
• Discovering governing equations from data by sparse identification of nonlinear dynamical systems
• scientific article; zbMATH DE number 795587 (Why is no real title available?)

Cited in

(4)

• Variable neighborhood programming for symbolic regression
• Learning Symbolic Expressions: Mixed-Integer Formulations, Cuts, and Heuristics
• Generalizing the SINDy approach with nested neural networks
• Improved low-rank matrix approximation in multivariate case

This page was built for publication: Divide and Conquer: A Quick Scheme for Symbolic Regression

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6172979)