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

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

A new gradient based particle swarm optimization algorithm for accurate computation of global minimum

Noel, Mathew M. · 2012 · Applied Soft 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.1016/j.asoc.2011.08.037

Cites

1 of 1 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

  • A new optimizer using particle swarm theory

    Eberhart, R., & Kennedy, J. (2002) · MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science · doi:10.1109/mhs.1995.494215 · Cited by 16,067 · cited 1×

    “he particle swarm optimization (PSO) algorithm is a new socioogically inspired stochastic optimization algorithm introduced by ennedy and Eberhart in 1995 [3–5].”
    Method

Show all 1 references

Cited by

Metadata

Authors
Noel, M. M.
Venue
Applied Soft Computing
Publisher
Elsevier BV
Published
2012-01
Volume
12
Issue
1
Pages
353-359
ISSN
1568-4946 (ISSN-L)
OpenAlex
W2052309646
Cited by
186
References
1
FWCI
8.28
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.