Jump to content

Ibk algorithm

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by BlueNovember (talk | contribs) at 14:37, 26 April 2007 (←Created page with '{{unreferenced|date=April 2007}} {{Comp-sci-stub}} The ibk algorithm is an alternate version of the k-nearest neighbor algorithm, used in k-nearest neighbour c...'). 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 does not cite any sources. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed.
Find sources: "Ibk algorithm" – news · newspapers · books · scholar · JSTOR (April 2007) (Learn how and when to remove this message)

This computer science article is a stub. You can help Wikipedia by expanding it.

The ibk algorithm is an alternate version of the k-nearest neighbor algorithm, used in k-nearest neighbour classification.

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

Hidden categories: