The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
FDA -A Scalable Evolutionary Algorithm for the Optimization of Additively Decomposed Functions
Abstract
The Factorized Distribution Algorithm (FDA) is an evolutionary algorithm which combines mutation and recombination by using a distribution. The distribution is estimated from a set of selected points. In general, a discrete distribution defined for n binary variables has 2 n parameters. Therefore it is too expensive to compute. For additively decomposed discrete functions (ADFs) there exist algorithms which factor the distribution into conditional and marginal distributions. This factorization is used by FDA. The scaling of FDA is investigated theoretically and numerically. The scaling depends on the ADF structure and the specific assignment of function values. Difficult functions on a chain or a tree structure are solved in about O(n√n) operations. More standard genetic algorithms are not able to optimize these functions. FDA is not restricted to exact factorizations. It also works for approximate factorizations as is shown for a circle and a grid structure. By using results from Bayes networks, FDA is extended to LFDA. LFDA computes an approximate factorization using only the data, not the ADF structure. The scaling of LFDA is compared to the scaling of FDA.
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
Estimating the Dimension of a Model
Schwarz, G. (1978) · The Annals of Statistics · doi:10.1214/aos/1176344136 · Cited by 47,033
Dowsland, K. A., & Thompson, J. M. (2012) · Handbook of Natural Computing · doi:10.1007/978-3-540-92910-9_49 · Cited by 2,432
(1998) · Springer eBooks · doi:10.1007/978-94-011-5014-9 · Cited by 2,418
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-citationBOA: the Bayesian optimization algorithm
Pelikán, M., Goldberg, D. E., & Cantú‐Paz, E. (1999) · Cited by 1,053
A theory of limits in artificial selection
Robertson, A. (1960) · Proceedings of the Royal Society of London. Series B. Biological Sciences · doi:10.1098/rspb.1960.0099 · Cited by 538
The 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
Cited by
Lee, K. S., & Geem, Z. W. (2005) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2004.09.007 · Cited by 1,772
The balance between proximity and diversity in multiobjective evolutionary algorithms
Bosman, P. A. N., & Thierens, D. (2003) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2003.810761 · Cited by 1,154
An introduction and survey of estimation of distribution algorithms
Hauschild, M., & Pelikan, M. (2011) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2011.08.003 · Cited by 478
A Survey on Cooperative Co-Evolutionary Algorithms
Ma, X., Li, X., Zhang, Q., Tang, K., Liang, Z., Xie, W., & Zhu, Z. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2018.2868770 · Cited by 336
Schemata, Distributions and Graphical Models in Evolutionary Optimization
Mühlenbein, H., Mahnig, T., & Rodriguez, A. O. (1999) · Journal of Heuristics · doi:10.1023/a:1009689913453 · Cited by 299
Self-citation
Metadata
- Authors
- Mühlenbein, H., & Mahnig, T.
- Venue
- Evolutionary Computation
- Publisher
- MIT Press - Journals
- Published
- 1999-12
- Volume
- 7
- Issue
- 4
- Pages
- 353-376
- ISSN
- 1063-6560 (ISSN-L)
- 1530-9304
- OpenAlex
- W2172081677
- Cited by
- 288
- References
- 20
- FWCI
- 20.75
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: FDA -A Scalable Evolutionary Algorithm for the Optimization of Additively Decomposed Functions. https://app.cochat.ai/papers/10.1162/evco.1999.7.4.353
- The paper
- Mühlenbein, H., & Mahnig, T. (1999). FDA -A Scalable Evolutionary Algorithm for the Optimization of Additively Decomposed Functions. Evolutionary Computation. https://doi.org/10.1162/evco.1999.7.4.353
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.