Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 937

The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.

A Markov Chain Monte Carlo version of the genetic algorithm Differential Evolution: easy Bayesian computing for real parameter spaces

Open access
Braak, Cajo J. F. Ter · 2006 · Statistics and Computing

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1007/s11222-006-8769-1

Cites

27 of 27 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Research works printed but not linked: 4

  1. Lampinen J. and Zelinka I. 2000. On stagnation of the Differential Evolution algorithm. Proceedings of MENDEL 2000, 6th International Mendel Conference on Soft Computing, Brno, pp. 76–83.
  2. Mengersen K. and Robert C. P. 2003. IID sampling using self-avoiding population Monte Carlo: the pinball sampler. In Bernardo J. M., Bayarri M. J., Berger J. O., Dawid A. P., Heckerman D., Smith A. F. M. and West M. (eds.), Bayesian Statistics 7, Oxford, Clarendon Press, pp. 277–292. · doi:10.1093/oso/9780198526155.003.0015
  3. Price K. and Storn R. 1997. Differential Evolution. Dr Dobb’s Journal 264: 18–24.
  4. Strens M. Bernhardt M. and Everett N. 2002. Markov chain Monte Carlo sampling using direct search optimization. ICML, Sydney, pp. 602–609.

Cited by

See all 937

Metadata

Authors
Braak, C. J. F. T.
Venue
Statistics and Computing
Published
2006-09
Volume
16
Issue
3
Pages
239-249
ISSN
  • 0960-3174 (ISSN-L)
  • 1573-1375
OpenAlex
W2132071585
Cited by
937
References
27
FWCI
7.63
Type
journal article
Language
en
Open access
green
Licence
www.springer.com/tdm (tdm)

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.