False nearest neighbor algorithm
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.
Wikipage disambiguates
Wikipage redirect
Link from a Wikipage to another Wikipage
primaryTopic
False nearest neighbor algorithm
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.
has abstract
The false nearest neighbor alg ...... e embedding can be determined.
@en
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
992,743,911
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
comment
The false nearest neighbor alg ...... e embedding can be determined.
@en
label
False nearest neighbor algorithm
@en