Jump to content

False nearest neighbor algorithm: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
Citation bot (talk | contribs)
Alter: pages. Formatted dashes. | You can use this bot yourself. Report bugs here. | Activated by Amigao | Category:Dynamical systems | via #UCB_Category
Monkbot (talk | contribs)
m Task 18 (cosmetic): eval 3 templates: del empty params (1×); hyphenate params (1×);
Line 7: Line 7:


==References==
==References==
*{{Cite journal | last1 = Rhodes | first1 = C. | last2 = Morari | first2 = M. | authorlink2=Manfred Morari|title = The false nearest neighbors algorithm: An overview | journal = Computers & Chemical Engineering | volume = 21 | pages = S1149–S1154 | year = 1997 | doi = 10.1016/S0098-1354(97)87657-0}}
*{{Cite journal | last1 = Rhodes | first1 = C. | last2 = Morari | first2 = M. | author-link2=Manfred Morari|title = The false nearest neighbors algorithm: An overview | journal = Computers & Chemical Engineering | volume = 21 | pages = S1149–S1154 | year = 1997 | doi = 10.1016/S0098-1354(97)87657-0}}
*{{Cite journal | last1 = Hegger | first1 = R. | last2 = Kantz | first2 = H. | title = Improved false nearest neighbor method to detect determinism in time series data | journal = Physical Review E | volume = 60 | issue = 4 | pages = 4970–3 | year = 1999 | doi = 10.1103/PhysRevE.60.4970| pmid = 11970367 |bibcode = 1999PhRvE..60.4970H }}
*{{Cite journal | last1 = Hegger | first1 = R. | last2 = Kantz | first2 = H. | title = Improved false nearest neighbor method to detect determinism in time series data | journal = Physical Review E | volume = 60 | issue = 4 | pages = 4970–3 | year = 1999 | doi = 10.1103/PhysRevE.60.4970| pmid = 11970367 |bibcode = 1999PhRvE..60.4970H }}
*{{Cite journal | last1 = Kennel | first1 = M. | last2 = Brown | first2 = R. | last3 = Abarbanel | first3 = H. | doi = 10.1103/PhysRevA.45.3403 | title = Determining embedding dimension for phase-space reconstruction using a geometrical construction | journal = Physical Review A | volume = 45 | issue = 6 | pages = 3403–3411 | year = 1992 | pmid = 9907388| pmc = |bibcode = 1992PhRvA..45.3403K }}
*{{Cite journal | last1 = Kennel | first1 = M. | last2 = Brown | first2 = R. | last3 = Abarbanel | first3 = H. | doi = 10.1103/PhysRevA.45.3403 | title = Determining embedding dimension for phase-space reconstruction using a geometrical construction | journal = Physical Review A | volume = 45 | issue = 6 | pages = 3403–3411 | year = 1992 | pmid = 9907388|bibcode = 1992PhRvA..45.3403K }}


[[Category:Statistical algorithms]]
[[Category:Statistical algorithms]]

Revision as of 21:41, 6 December 2020

The false nearest neighbor 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 embedding 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

  • Rhodes, C.; Morari, M. (1997). "The false nearest neighbors algorithm: An overview". Computers & Chemical Engineering. 21: S1149 – S1154. doi:10.1016/S0098-1354(97)87657-0.
  • Hegger, R.; Kantz, H. (1999). "Improved false nearest neighbor method to detect determinism in time series data". Physical Review E. 60 (4): 4970–3. Bibcode:1999PhRvE..60.4970H. doi:10.1103/PhysRevE.60.4970. PMID 11970367.
  • Kennel, M.; Brown, R.; Abarbanel, H. (1992). "Determining embedding dimension for phase-space reconstruction using a geometrical construction". Physical Review A. 45 (6): 3403–3411. Bibcode:1992PhRvA..45.3403K. doi:10.1103/PhysRevA.45.3403. PMID 9907388.