False nearest neighbor algorithm
From Wikipedia the free encyclopedia
Within abstract algebra, the false nearest neighbor algorithm is an algorithm for estimating the embedding dimension. The concept was proposed by Kennel et al. (1992).[1] 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.[2][3]
See also[edit]
References[edit]
- ^ Kennel, Matthew B.; Brown, Reggie; Abarbanel, Henry D. I. (1 March 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.
- ^ 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.
 | This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it. |