Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.

Nearest neighbor pattern classification

Cover, T., Hart, P. · 1967 · IEEE Transactions on Information Theory

Abstract

The nearest neighbor decision rule assigns to an unclassified sample point the classification of the nearest of a set of previously classified points. This rule is independent of the underlying joint distribution on the sample points and their classifications, and hence the probability of errorRof such a rule must be at least as great as the Bayes probability of errorR^{\ast}--the minimum probability of error over all decision rules taking underlying probability structure into account. However, in a large sample analysis, we will show in theM-category case thatR^{\ast} \leq R \leq R^{\ast}(2 --MR^{\ast}/(M-1)), where these bounds are the tightest possible, for all suitably smooth underlying distributions. Thus for any number of categories, the probability of error of the nearest neighbor rule is bounded above by twice the Bayes probability of error. In this sense, it may be said that half the classification information in an infinite sample set is contained in the nearest neighbor.

Overview

Integrity signals

Registry

Crossref · 10.1109/tit.1967.1053964

Cites

9 of 9 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Show all 7 references

Research works printed but not linked: 3

  1. Fix, 1952, Discriminatory analysis: small sample performance
  2. Kanal, 1963, Statistical methods for pattern classification
  3. Nilsson, 1965, Learning Machines, 120

Cited by

See all 16,936

Metadata

Authors
Cover, T., & Hart, P.
Affiliations
  • Stanford University (US)
  • SRI International (US)
Venue
IEEE Transactions on Information Theory
Published
1967-01
Volume
13
Issue
1
Pages
21-27
ISSN
  • 0018-9448 (ISSN-L)
  • 1557-9654
OpenAlex
W2122111042
Cited by
16,936
References
7
Citations by year
2026: 1748 · 2025: 1814 · 2024: 1485 · 2023: 1200 · 2022: 1007 · 2021: 1029 · 2020: 944 · 2019: 857 · 2018: 716 · 2017: 572 · 2016: 553 · 2015: 575 · 2014: 514 · 2013: 458 · 2012: 440
FWCI
23.01
Type
journal article
Language
en
Open access
closed
Locations
IEEE Transactions on Information Theory (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Algorithms
  • Physical Sciences › Computer Science › Information Systems › Data Mining and Machine Learning Applications
  • Physical Sciences › Mathematics › Statistics and Probability › Statistical Methods and Applications
Keywords
nearest neighbor classification, Bayes error, large-sample analysis, multi-class classification, decision rules

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Nearest neighbor pattern classification. https://app.cochat.ai/papers/10.1109/tit.1967.1053964
The paper
Cover, T., & Hart, P. (1967). Nearest neighbor pattern classification. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.1967.1053964

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.