The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Semantically-based crossover in genetic programming: application to real-valued symbolic regression
Open accessAbstract
We investigate the effects of semantically-based crossover operators in genetic programming, applied to real-valued symbolic regression problems. We propose two new relations derived from the semantic distance between subtrees, known as semantic equivalence and semantic similarity. These relations are used to guide variants of the crossover operator, resulting in two new crossover operators—semantics aware crossover (SAC) and semantic similarity-based crossover (SSC). SAC, was introduced and previously studied, is added here for the purpose of comparison and analysis. SSC extends SAC by more closely controlling the semantic distance between subtrees to which crossover may be applied. The new operators were tested on some real-valued symbolic regression problems and compared with standard crossover (SC), context aware crossover (CAC), Soft Brood Selection (SBS), and No Same Mate (NSM) selection. The experimental results show on the problems examined that, with computational effort measured by the number of function node evaluations, only SSC and SBS were significantly better than SC, and SSC was often better than SBS. Further experiments were also conducted to analyse the perfomance sensitivity to the parameter settings for SSC. This analysis leads to a conclusion that SSC is more constructive and has higher locality than SAC, NSM and SC; we believe these are the main reasons for the improved performance of SSC.
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
Genetic Programming: On the Programming of Computers by Means of Natural Selection
Koza, J. R. (1992) · Medical Entomology and Zoology · Cited by 13,082
Graph-Based Algorithms for Boolean Function Manipulation
Bryant (1986) · IEEE Transactions on Computers · doi:10.1109/tc.1986.1676819 · Cited by 8,891
Baier, C., & Katoen, J.-P. (2008) · The MIT Press eBooks · Cited by 5,289
(2008) · Cited by 4,811
Retrieval time from semantic memory
Collins, A. M., & Quillian, M. R. (1969) · Journal of Verbal Learning and Verbal Behavior · doi:10.1016/s0022-5371(69)80069-1 · Cited by 3,109
Semantics of context-free languages
Knuth, D. E. (1968) · Mathematical Systems Theory · doi:10.1007/bf01692511 · Cited by 1,948
A Field Guide to Genetic Programming
Poli, R., Langdon, W. B., & McPhee, N. F. (2008) · Cited by 1,930
Principles of Program Analysis
Nielson, F., Nielson, H. R., & Hankin, C. (1999) · Springer eBooks · doi:10.1007/978-3-662-03811-6 · Cited by 1,836
Foundations of Genetic Programming
Langdon, W. B., & Poli, R. (2002) · Springer eBooks · doi:10.1007/978-3-662-04726-2 · Cited by 922
Representations for Genetic and Evolutionary Algorithms
(2006) · Springer eBooks · doi:10.1007/3-540-32444-5 · Cited by 470
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
The Evolution of Evolvability in Genetic Programming
(2003) · Advances in Genetic Programming · doi:10.7551/mitpress/1108.003.0008 · Cited by 325
Representations for Genetic and Evolutionary Algorithms
Rothlauf, F. (2006) · Representations for Genetic and Evolutionary Algorithms · doi:10.1007/3-540-32444-5_2 · Cited by 257
Probabilistic Incremental Program Evolution
Salustowicz, R., & Schmidhuber, J. (1997) · Evolutionary Computation · doi:10.1162/evco.1997.5.2.123 · Cited by 249 · cited 1×
“16 In fact one simple way to use our method is to transform boolean function learning problems to realvalued ones as in [54].”
MethodRecombination, selection, and the genetic construction of computer programs
Tackett, W. A. (2017) · University of Southern California Digital Library · doi:10.25549/usctheses-c20-187980 · Cited by 154
Semantic Building Blocks in Genetic Programming
McPhee, N. F., Ohs, B., & Hutchison, T. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-78671-9_12 · Cited by 137
Semantically driven crossover in genetic programming
Beadle, L., & Johnson, C. G. (2008) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2008.4630784 · Cited by 120
On the Locality of Grammatical Evolution
Rothlauf, F., & Oetzel, M. (2006) · Lecture notes in computer science · doi:10.1007/11729976_29 · Cited by 93
O’Reilly, U.-M., & Oppacher, F. (1994) · Lecture notes in computer science · doi:10.1007/3-540-58484-6_283 · Cited by 88
Semantic analysis of program initialisation in genetic programming
Beadle, L., & Johnson, C. G. (2009) · Genetic Programming and Evolvable Machines · doi:10.1007/s10710-009-9082-5 · Cited by 66
Non-destructive depth-dependent crossover for genetic programming
Ito, T., Iba, H., & Sato, S. (1998) · Lecture notes in computer science · doi:10.1007/bfb0055929 · Cited by 45
An Attribute Grammar Decoder for the 01 MultiConstrained Knapsack Problem
Cleary, R., & O’Neill, M. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-31996-2_4 · Cited by 44
Self-citationDepth-dependent crossover for genetic programming
Ito, T., Iba, H., & Sato, S. (2002) · doi:10.1109/icec.1998.700150 · Cited by 43
Genetic Programming Crossover: Does It Cross over?
Johnson, C. G. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-01181-8_9 · Cited by 29
Wong, M. L., & Leung, K. (2002) · IEEE International Conference on Tools with Artificial Intelligence (ICTAI) · doi:10.1109/tai.1995.479782 · Cited by 22
Mori, N., McKay, B., Hoài, N. X., Essam, D., & Takeuchi, S. (2009) · Journal of Advanced Computational Intelligence and Intelligent Informatics · doi:10.20965/jaciii.2009.p0237 · Cited by 9
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
Metadata
- Authors
- Uy, N. Q., Hoai, N. X., O’Neill, M., McKay, R. I., & Galván-López, E.
- Venue
- Genetic Programming and Evolvable Machines
- Published
- 2010-07-30
- Volume
- 12
- Issue
- 2
- Pages
- 91-119
- ISSN
- 1389-2576 (ISSN-L)
- 1573-7632
- OpenAlex
- W2061011797
- Cited by
- 293
- References
- 26
- FWCI
- 11.56
- Type
- journal article
- Language
- en
- Open access
- green
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.