Jump to content

False nearest neighbor algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Andrewman327 (talk | contribs) at 11:11, 1 January 2013 (clean up of articles listed as "needing cleanup" using AWB (8759)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

The false nearest neighbor (FNN) algorithm is an algorithm for estimating the embedding dimension. The concept was proposed by Kennel et al. The main idea is to examine how the number of neighbors of a point along a signal trajectory change with increasing embedding dimension. In too low an ambedding dimension, many of the neighbors will be false, but in an appropriate embedding dimension or higher, the neighbors are real. With increasing dimension, the false neighbors will no longer be neighbors. Therefore, by examining how the number of neighbors change as a function of dimension, an appropriate embedding can be determined.

See also

References

  • Attention: This template ({{cite doi}}) is deprecated. To cite the publication identified by doi:10.1016/S0098-1354(97)87657-0, please use {{cite journal}} (if it was published in a bona fide academic journal, otherwise {{cite report}} with |doi=10.1016/S0098-1354(97)87657-0 instead.
  • Attention: This template ({{cite doi}}) is deprecated. To cite the publication identified by doi:10.1103/PhysRevE.60.4970, please use {{cite journal}} (if it was published in a bona fide academic journal, otherwise {{cite report}} with |doi=10.1103/PhysRevE.60.4970 instead.
  • Attention: This template ({{cite doi}}) is deprecated. To cite the publication identified by doi:10.1103/PhysRevA.45.3403, please use {{cite journal}} (if it was published in a bona fide academic journal, otherwise {{cite report}} with |doi=10.1103/PhysRevA.45.3403 instead.