The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Order of Nonlinearity as a Complexity Measure for Models Generated by Symbolic Regression via Pareto Genetic Programming
Abstract
This paper presents a novel approach to generate data-driven regression models that not only give reliable prediction of the observed data but also have smoother response surfaces and extra generalization capabilities with respect to extrapolation. These models are obtained as solutions of a genetic programming (GP) process, where selection is guided by a tradeoff between two competing objectives - numerical accuracy and the order of nonlinearity. The latter is a novel complexity measure that adopts the notion of the minimal degree of the best-fit polynomial, approximating an analytical function with a certain precision. Using nine regression problems, this paper presents and illustrates two different strategies for the use of the order of nonlinearity in symbolic regression via GP. The combination of optimization of the order of nonlinearity together with the numerical accuracy strongly outperforms ldquoconventionalrdquo optimization of a size-related expressional complexity and the accuracy with respect to extrapolative capabilities of solutions on all nine test problems. In addition to exploiting the new complexity measure, this paper also introduces a novel heuristic of alternating several optimization objectives in a 2-D optimization framework. Alternating the objectives at each generation in such a way allows us to exploit the effectiveness of 2-D optimization when more than two objectives are of interest (in this paper, these are accuracy, expressional complexity, and the order of nonlinearity). Results of the experiments on all test problems suggest that alternating the order of nonlinearity of GP individuals with their structural complexity produces solutions that are both compact and have smoother response surfaces, and, hence, contributes to better interpretability and understanding.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A fast and elitist multiobjective genetic algorithm: NSGA-II
Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.996017 · Cited by 50,053
Neural Networks: A Comprehensive Foundation
Haykin, S. (1998) · Cited by 30,070
Numerical recipes in C: the art of scientific computing
(1993) · Choice Reviews Online · doi:10.5860/choice.30-5638 · Cited by 17,933
Genetic Programming: On the Programming of Computers by Means of Natural Selection
Koza, J. R. (1992) · Medical Entomology and Zoology · Cited by 13,082
Numerical recipes in Pascal: the art of scientific computing
(1990) · Choice Reviews Online · doi:10.5860/choice.27-5158 · Cited by 11,811
Applied Multivariate Statistical Analysis.
Johnson, A. R., & Wichern, D. W. (1988) · Biometrics · doi:10.2307/2531616 · Cited by 11,353
Neural networks: A comprehensive foundation
Tadeusiewicz, R. (1995) · Control Engineering Practice · doi:10.1016/0967-0661(95)90080-2 · Cited by 7,218
Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms
Srinivas, N., & Deb, K. (1994) · Evolutionary Computation · doi:10.1162/evco.1994.2.3.221 · Cited by 6,935
Design and Analysis of Computer Experiments
Sacks, J., Welch, W. J., Mitchell, T. J., & Wynn, H. P. (1989) · Statistical Science · doi:10.1214/ss/1177012413 · Cited by 6,919
Performance assessment of multiobjective optimizers: an analysis and review
Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C. M., & da Fonseca, V. G. (2003) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2003.810758 · Cited by 4,330
An Overview of Evolutionary Algorithms in Multiobjective Optimization
Fonseca, C. M., & Fleming, P. J. (1995) · Evolutionary Computation · doi:10.1162/evco.1995.3.1.1 · Cited by 2,266
Rivlin, T. J. (1974) · International Linear Collider · Cited by 1,988
Genetic programming II: Automatic discovery of reusable programs
(1995) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(95)90099-3 · Cited by 1,901
Banzhaf, W., Francone, F. D., Keller, R. E., & Nordin, P. C. (1998) · Cited by 1,678
Learning from Data: Concepts, Theory, and Methods
Cherkassky, V., & Mulier, F. M. (1998) · Cited by 1,637
Radial basis functions for multivariable interpolation: a review
Powell, M. J. D. (1987) · Clarendon Press eBooks · Cited by 1,197
Foundations of Genetic Programming
Langdon, W. B., & Poli, R. (2002) · Springer eBooks · doi:10.1007/978-3-662-04726-2 · Cited by 922
Advances in genetic programming
Fogel, D. B. (1995) · Biosystems · doi:10.1016/0303-2647(95)90007-1 · Cited by 703
Improving Symbolic Regression with Interval Arithmetic and Linear Scaling
Keijzer, M. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36599-0_7 · Cited by 346
Probabilistic Incremental Program Evolution
Salustowicz, R., & Schmidhuber, J. (1997) · Evolutionary Computation · doi:10.1162/evco.1997.5.2.123 · Cited by 249 · cited 1×
“The second function originates from [43]; we call it the Salustowicz function.”
BackgroundBalancing Accuracy and Parsimony in Genetic Programming
Zhang, B.-T., & Mühlenbein, H. (1995) · Evolutionary Computation · doi:10.1162/evco.1995.3.1.17 · Cited by 242
Pareto-Front Exploitation in Symbolic Regression
Smits, G. F., & Kotanchek, M. (2006) · Genetic Programming · doi:10.1007/0-387-23254-0_17 · Cited by 225
Self-citationMultiobjective genetic programming: reducing bloat using SPEA2
Bleuler, S., Brack, M., Thiele, L., & Zitzler, E. (2002) · Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546) · doi:10.1109/cec.2001.934438 · Cited by 221
Cheney, E. W. (1986) · Proceedings of Symposia in Applied Mathematics · doi:10.1090/psapm/036/864366 · Cited by 209
Complexity Compression and Evolution
Nordin, P. C., & Banzhaf, W. (1995) · Cited by 204
Advances in Genetic Programming
(1999) · The MIT Press eBooks · doi:10.7551/mitpress/1110.001.0001 · Cited by 152
Vapnik, V. N. (1997) · Lecture notes in computer science · doi:10.1007/bfb0020166 · Cited by 151
Symbolic regression via genetic programming
Augusto, D. A., & Barbosa, H. J. C. (2002) · Brazilian Symposium on Neural Networks (SBRN) · doi:10.1109/sbrn.2000.889734 · Cited by 150
Some Considerations on the Reason for Bloat
Banzhaf, W., & Langdon, W. B. (2002) · Genetic Programming and Evolvable Machines · doi:10.1023/a:1014548204452 · Cited by 106
Accurate Replication in Genetic Programming
McPhee, N. F., & Miller, J. D. (1995) · Cited by 94
Problem Difficulty and Code Growth in Genetic Programming
Gustafson, S., Ekárt, A., Burke, E. K., & Kendall, G. (2004) · Genetic Programming and Evolvable Machines · doi:10.1023/b:genp.0000030194.98244.e3 · Cited by 55
Model complexity control and statistical learning theory
Cherkassky, V. (2002) · Natural Computing · doi:10.1023/a:1015007927558 · Cited by 45
The Root Causes of Code Growth in Genetic Programming
Streeter, M. J. V. (2003) · Lecture notes in computer science · doi:10.1007/3-540-36599-0_42 · Cited by 40
Cited by
Interpretable scientific discovery with symbolic regression: a review
Makke, N., & Chawla, S. (2024) · Artificial Intelligence Review · doi:10.1007/s10462-023-10622-0 · Cited by 331
Genetic programming needs better benchmarks
McDermott, J., White, D. R., Luke, S., Manzoni, L., Castelli, M., Vanneschi, L., Jaskowski, W., Krawiec, K., Harper, R., De Jong, K., et al. (2012) · Proceedings of the 14th annual conference on Genetic and evolutionary computation · doi:10.1145/2330163.2330273 · Cited by 270
Open issues in genetic programming
O’Neill, M., Vanneschi, L., Gustafson, S., & Banzhaf, W. (2010) · Genetic Programming and Evolvable Machines · doi:10.1007/s10710-010-9113-2 · Cited by 224
Machine Learning-Based App for Self-Evaluation of Teacher-Specific Instructional Style and Tools
Duzhin, F., & Gustafsson, A. (2018) · Education Sciences · doi:10.3390/educsci8010007 · Cited by 52
Metadata
- Authors
- Vladislavleva, E. J., Smits, G. F., & den Hertog, D.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2009-04
- Volume
- 13
- Issue
- 2
- Pages
- 333-349
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W2121162457
- Cited by
- 353
- References
- 33
- FWCI
- 13.78
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.