Ibk algorithm - Wikipedia

It is proposed that this article be deleted because of the following concern:

currently useless article and orphaned --Chire (talk) 15:00, 27 October 2011 (UTC)

If you can address this concern by improving, copyediting, sourcing, renaming, or merging the page, please edit this page and do so. You may remove this message if you improve the article or otherwise object to deletion for any reason. Although not required, you are encouraged to explain why you object to the deletion, either in your edit summary or on the talk page. If this template is removed, do not replace it.

This message has remained in place for seven days, so the article may be deleted without further notice.

If you created the article, please don't be offended. Instead, consider improving the article so that it is acceptable according to the deletion policy.
Find sources: "Ibk algorithm" – news · newspapers · books · scholar · JSTOR

Nominator: Please consider notifying the author/project:

{{subst:proposed deletion notify|Ibk algorithm|concern=currently useless article and orphaned --[[User:Chire|Chire]] ([[User talk:Chire|talk]]) 15:00, 27 October 2011 (UTC)}} ~~~~

Timestamp: 20111027150055 15:00, 27 October 2011 (UTC)
Administrators: delete

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)

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

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