A New Deterministic Technique for Symbolic Regression
arXiv:1908.06754 · doi:10.1016/j.eswa.2022.116712
Abstract
This paper describes a new method for Symbolic Regression that allows to find mathematical expressions from a dataset. This method has a strong mathematical basis. As opposed to other methods such as Genetic Programming, this method is deterministic, and does not involve the creation of a population of initial solutions. Instead of it, a simple expression is being grown until it fits the data. The experiments performed show that the results are as good as other Machine Learning methods, in a very low computational time. Another advantage of this technique is that the complexity of the expressions can be limited, so the system can return mathematical expressions that can be easily analysed by the user, in opposition to other techniques like GSGP.
29 pages. Work in progress
References in corpus (6)
- Contemporary Symbolic Regression Methods and their Relative Performance
- A Greedy Search Tree Heuristic for Symbolic Regression
- Solving the Exponential Growth of Symbolic Regression Trees in Geometric Semantic Genetic Programming
- Symbolic Regression by Exhaustive Search: Reducing the Search Space Using Syntactical Constraints and Efficient Semantic Structure Deduplication
- Analytic Continued Fractions for Regression: A Memetic Algorithm Approach
- Positional Cartesian Genetic Programming