The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Balancing Accuracy and Parsimony in Genetic Programming
Abstract
Genetic programming is distinguished from other evolutionary algorithms in that it uses tree representations of variable size instead of linear strings of fixed length. The flexible representation scheme is very important because it allows the underlying structure of the data to be discovered automatically. One primary difficulty, however, is that the solutions may grow too big without any improvement of their generalization ability. In this article we investigate the fundamental relationship between the performance and complexity of the evolved structures. The essence of the parsimony problem is demonstrated empirically by analyzing error landscapes of programs evolved for neural network synthesis. We consider genetic programming as a statistical inference problem and apply the Bayesian model-comparison framework to introduce a class of fitness functions with error and complexity terms. An adaptive learning method is then presented that automatically balances the model-complexity factor to evolve parsimonious programs without losing the diversity of the population needed for achieving the desired training accuracy. The effectiveness of this approach is empirically shown on the induction of sigma-pi neural networks for solving a real-world medical diagnosis problem as well as benchmark tasks.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Neural Networks and the Bias/Variance Dilemma
Geman, S., Bienenstock, E., & Doursat, R. (1992) · Neural Computation · doi:10.1162/neco.1992.4.1.1 · Cited by 3,578 · cited 2×
“…fA or the program A on the training data D.Some manipulation of the formula shows that this can be decomposed into two terms (Breimanet al., 1984; Geman et al., 1992):E[(y fA(x;D))2jx; D] = E[(y E[yjx])2jx; D] + (E[yjx] fA(x;D))2: (14)Here E[(y E[y jx])2jx; D] does not depend on the data D, nor…”
Method
Cited by
Parameter control in evolutionary algorithms
Eiben, A. E., Hinterding, R., & Michalewicz, Z. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.771166 · Cited by 1,980
A Bibliometric Analysis and Visualization of Medical Big Data Research
Liao, H., Tang, M., Luo, L., Li, C., Chiclana, F., & Zeng, X.-J. (2018) · Sustainability · doi:10.3390/su10010166 · Cited by 663
Parameter Setting in Evolutionary Algorithms
(2007) · Studies in Computational Intelligence · doi:10.1007/978-3-540-69432-8 · Cited by 422
Vladislavleva, E. J., Smits, G. F., & den Hertog, D. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2008.926486 · Cited by 353
A symbolic data-driven technique based on evolutionary polynomial regression
Giustolisi, O., & Savic, D. A. (2006) · Journal of Hydroinformatics · doi:10.2166/hydro.2006.020b · Cited by 343
Metadata
- Authors
- Zhang, B.-T., & Mühlenbein, H.
- Venue
- Evolutionary Computation
- Publisher
- MIT Press - Journals
- Published
- 1995-03
- Volume
- 3
- Issue
- 1
- Pages
- 17-38
- ISSN
- 1063-6560 (ISSN-L)
- 1530-9304
- OpenAlex
- W2155582960
- Cited by
- 242
- References
- 1
- FWCI
- 8.14
- 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.