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
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
Cites
Statistics
Verification
Claims the paper makes
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?
In the citing paper
“Fig. 7b reveals that as the gallery densifies, in line with Cover and Hart [13], both models individually improve at retrieving correct-class neighbors.”
From Back into Plato's Cave: Examining Cross-modal Representational Convergence at Scale (2026) · cites this paper as [13]
In the citing paper
“Traditional ML techniques, such as k-nearest neighbors (KNNs)[10], decision trees[11], support vector machines (SVMs)[12], extreme learning machines (ELMs)[13], and Gaussian process regression (GPR), are effective in SOC estimation with limited computational resources.”
From Advancements in the estimation of the state of charge of lithium-ion battery: a comprehensive review of traditional and deep learning approaches (2025) · cites this paper as [10]
In the citing paper
“The kNN is a commonly-used supervised learning model to complete the classification tasks [13].”
From Applications of machine learning to machine fault diagnosis: A review and roadmap (2020) · cites this paper as [13]
Citations
Cites
The magical number seven, plus or minus two: Some limits on our capacity for processing information.
Miller, G. A. (1994) · Psychological Review · doi:10.1037/0033-295x.101.2.343 · Cited by 17,161
A Nonparametric Estimate of a Multivariate Density Function
Loftsgaarden, D. O., & Quesenberry, C. P. (1965) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177700079 · Cited by 781
Applications of Information Theory to Psychology
Garner, W. R. (1959) · The Journal of Nervous and Mental Disease · doi:10.1097/00005053-195911000-00013 · Cited by 755
Decision-Making Processes in Pattern Recognition
Eddy, R. P., & Sebestyen, G. S. (1963) · Mathematics of Computation · doi:10.2307/2004038 · Cited by 402
The Information of Elementary Auditory Displays
Pollack, I. (1952) · The Journal of the Acoustical Society of America · doi:10.1121/1.1906969 · Cited by 327
Studies in Item Analysis and Prediction
Reinhardt, H. E., & Solomon, H. (1962) · Technometrics · doi:10.2307/1266298 · Cited by 126
AN EMPIRICAL BAYES APPROACH TO NON-PARAMETRIC TWO-WAY CLASSIFICATION,
Johns, M. V. (1959) · Cited by 35
SEMI-AUTOMATIC IMAGERY SCREENING RESEARCH STUDY AND EXPERIMENTAL INVESTIGATION. VOLUME I
Harley, T., Bryan, J., Kanal, L., Taylor, D., & Grayum, J. (1963) · doi:10.21236/ad0410261
Research works printed but not linked: 3
- Fix, 1952, Discriminatory analysis: small sample performance
- Kanal, 1963, Statistical methods for pattern classification
- Nilsson, 1965, Learning Machines, 120
Cited by
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
Data Mining: Practical Machine Learning Tools and Techniques
(2011) · Elsevier eBooks · doi:10.1016/c2009-0-19715-5 · Cited by 25,437
TASSEL: software for association mapping of complex traits in diverse samples
Bradbury, P. J., Zhang, Z., Kroon, D. E., Casstevens, T. M., Ramdoss, Y., & Buckler, E. S. (2007) · Bioinformatics · doi:10.1093/bioinformatics/btm308 · Cited by 7,759
Friedman, J., Hastie, T., & Tibshirani, R. (2000) · The Annals of Statistics · doi:10.1214/aos/1016218223 · Cited by 6,884
“Classifiers are hurt less by overfitting than other function estimators [e.g., the famous risk bound of the 1-nearest-neighbor classifier, Cover and Hart (1967)].”
BackgroundTop 10 algorithms in data mining
Wu, X., Kumar, V., Ross Quinlan, J., Ghosh, J., Yang, Q., Motoda, H., McLachlan, G. J., Ng, A., Liu, B., Yu, P. S., et al. (2008) · Knowledge and Information Systems · doi:10.1007/s10115-007-0114-2 · Cited by 5,667
“In particular, a well known result by Cover and Hart [15] shows that the the error of the nearest neighbor rule is bounded above by twice the Bayes error under certain reasonable assumptions.”
Background
Metadata
- Authors
- Cover, T., & Hart, P.
- Affiliations
- Stanford University (US)
- SRI International (US)
- ORCID
- Hart, P.
- 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
- Licence
- 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.