Construct · 1 fields · 1 citations

k-nearest neighbors: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
k-nearestneighbors1 CONSTRUCTK-nearest neighbors COVER · MACHINE LEARNING

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Machine learning

classifying a point by the labels of its closest training examples, with an error bounded by twice the Bayes error in the limit.

In machine learning, k-nearest neighbors refers to classifying a point by the labels of its closest training examples, with an error bounded by twice the Bayes error in the limit. This meaning comes from Cover (1967) in IEEE Transactions on Information Theory.[1]

Unit
Recovery means
Measured by

Next

Run it through the Collider, or take the citations with you.

See how k-nearest neighbors sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

cover2 fields · 4 citationsjingle · one word, two constructserror4 fields · 8 citationsjingle · one word, four constructsinformation4 fields · 5 citationsjingle · one word, four constructs

References

  1. Cover, T., & Hart, P. (1967). Nearest neighbor pattern classification. IEEE Transactions on Information Theory, 13(1), 21-27. https://doi.org/10.1109/tit.1967.1053964

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct