Jump to content

False nearest neighbor algorithm

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Daniel.hohle (talk | contribs) at 09:15, 1 November 2011. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these messages)

No issues specified. Please specify issues, or remove this template.

(Learn how and when to remove this message)

The false nearest neighbor (FNN) algorithm is an algorithm for estimating the embedding dimension.

See also

External links

False nearest neighbors by Thomas Schreiber. (broken link)

This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=False_nearest_neighbor_algorithm&oldid=458432422"

Hidden categories: