The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Schemata, Distributions and Graphical Models in Evolutionary Optimization
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 algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
Genetic Algorithms in Search, Optimization and Machine Learning
Goldberg, D. E., & Robson, D. (1988) · Cited by 18,391
Combinatorial optimization: networks and matroids
Lawler, E. L. (2021) · Cited by 3,310
Lauritzen, S. L. (1996) · doi:10.1093/oso/9780198522195.001.0001 · Cited by 2,976
Dowsland, K. A., & Thompson, J. M. (2012) · Handbook of Natural Computing · doi:10.1007/978-3-540-92910-9_49 · Cited by 2,432
From recombination of genes to the estimation of distributions I. Binary parameters
Mühlenbein, H., & Paaß, G. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61723-x_982 · Cited by 1,207
Self-citationPredictive Models for the Breeder Genetic Algorithm I. Continuous Parameter Optimization
Mühlenbein, H., & Schlierkamp-Voosen, D. (1993) · Evolutionary Computation · doi:10.1162/evco.1993.1.1.25 · Cited by 1,199
Self-citationThe Equation for Response to Selection and Its Use for Prediction
Mühlenbein, H. (1997) · Evolutionary Computation · doi:10.1162/evco.1997.5.3.303 · Cited by 512
Self-citationMIMIC: Finding Optima by Estimating Probability Densities
Bonet, J. S. D., Isbell, C. L., & Viola, P. A. (1996) · Cited by 457
Graphical models for machine learning and digital communication
(1999) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(99)90253-5 · Cited by 454
Graphical Models for Machine Learning and Digital Communication
Frey, B. J. (1998) · The MIT Press eBooks · doi:10.7551/mitpress/3348.001.0001 · Cited by 352
RapidAccurate Optimization of Difficult Problems Using Fast Messy Genetic Algorithms
Goldberg, D. E., Deb, K., Kargupta, H., & Harik, G. R. (1993) · Cited by 326
The Bivariate Marginal Distribution Algorithm
Pelikan, M., & Muehlenbein, H. (1999) · Advances in Soft Computing · doi:10.1007/978-1-4471-0819-1_39 · Cited by 321
FDA -A Scalable Evolutionary Algorithm for the Optimization of Additively Decomposed Functions
Mühlenbein, H., & Mahnig, T. (1999) · Evolutionary Computation · doi:10.1162/evco.1999.7.4.353 · Cited by 288
Self-citationBaluja, S., & Davies, S. (1997) · Cited by 261
The Science of Breeding and Its Application to the Breeder Genetic Algorithm (BGA)
Mühlenbein, H., & Schlierkamp-Voosen, D. (1993) · Evolutionary Computation · doi:10.1162/evco.1993.1.4.335 · Cited by 242
Self-citationWhat makes a problem hard for a genetic algorithm? Some anomalous results and their explanation
Forrest, S., & Mitchell, M. (1994) · Machine Learning · doi:10.1007/bf00993046 · Cited by 217
Convergence theory and applications of the factorized distribution algorithm
Mühlenbein, H. (2015) · Journal of Computing and Information Technology · doi:10.13140/rg.2.1.1867.3769 · Cited by 124
Self-citationWhat Makes a Problem Hard for a Genetic Algorithm? Some Anomalous Results and Their Explanation
Forrest, S., & Mitchell, M. (1993) · Machine Learning · doi:10.1023/a:1022626114466 · Cited by 114
de la Maza, M., & Tidor, B. (1993) · international conference on Genetic algorithms · Cited by 69
Revisiting the GEMGA: scalable evolutionary optimization through linkage learning
Bandyopadhyay, S., Kargupta, H., & Wang, G. (2002) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/icec.1998.700097 · Cited by 47
SEARCH, blackbox optimization, and sample complexity
Kargupta, H., & Goldberg, D. E. (1996) · University of North Texas Digital Library (University of North Texas) · Cited by 24
Cited by
A Survey of Optimization by Building and Using Probabilistic Models
Pelikan, M., Goldberg, D. E., & Lobo, F. G. (2002) · Computational Optimization and Applications · doi:10.1023/a:1013500812258 · Cited by 750
Towards a New Evolutionary Computation
(2006) · Studies in Fuzziness and Soft Computing · doi:10.1007/3-540-32494-1 · Cited by 393
The Bivariate Marginal Distribution Algorithm
Pelikan, M., & Muehlenbein, H. (1999) · Advances in Soft Computing · doi:10.1007/978-1-4471-0819-1_39 · Cited by 321
Linkage Problem, Distribution Estimation, and Bayesian Networks
Pelikan, M., Goldberg, D. E., & Cantú-Paz, E. (2000) · Evolutionary Computation · doi:10.1162/106365600750078808 · Cited by 314
FDA -A Scalable Evolutionary Algorithm for the Optimization of Additively Decomposed Functions
Mühlenbein, H., & Mahnig, T. (1999) · Evolutionary Computation · doi:10.1162/evco.1999.7.4.353 · Cited by 288
Self-citation
Metadata
- Authors
- Mühlenbein, H., Mahnig, T., & Rodriguez, A. O.
- Venue
- Journal of Heuristics
- Published
- 1999-07
- Volume
- 5
- Issue
- 2
- Pages
- 215-247
- ISSN
- 1381-1231 (ISSN-L)
- 1572-9397
- OpenAlex
- W1560047216
- Cited by
- 299
- References
- 23
- FWCI
- 24.41
- 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.