The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Estimation by the nearest neighbor rule
Abstract
LetR^{\ast}denote the Bayes risk (minimum expected loss) for the problem of estimating\theta \varepsilon \Theta, given an observed random variablex, joint probability distributionF(x,\theta), and loss functionL. Consider the problem in which the only knowledge ofFis that which can be inferred from samples(x_{1},\theta_{1}),(x_{2},\theta_{2}), \cdots ,(x_{n}, \theta_{n}), where the(x_{i}, \theta_{i})'sare independently identically distributed according toF. Let the nearest neighbor estimate of the parameter\thetaassociated with an observationxbe defined to be the parameter\theta_{n}^{'}associated with the nearest neighborx_{n}^{'}tox. Let R be the large sample risk of the nearest neighbor rule. It will be shown, for a wide range of probability distributions, thatR \leq 2R^{\ast}for metric loss functions andR = 2R^{\ast}for squared-error loss functions. A simple estimator using the nearestkneighbors yieldsR = R^{\ast} (1 + 1/k)in the squared-error loss case. In this sense, it can be said that at least haft the information in the infinite training set is contained in the nearest neighbor. This paper is an extension of earlier work[q from the problem of classification by the nearest neighbor rule to that of estimation. However, the unbounded loss functions in the estimation problem introduce additional problems concerning the convergence of the unconditional risk. Thus some work is devoted to the investigation of natural conditions on the underlying distribution assuring the desired convergence.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Nearest neighbor pattern classification
Cover, T., & Hart, P. (1967) · IEEE Transactions on Information Theory · doi:10.1109/tit.1967.1053964 · Cited by 16,936
Self-citationDiscriminatory Analysis. Nonparametric Discrimination: Consistency Properties
Fix, E., & Hodges, J. L. (1989) · International Statistical Review / Revue Internationale de Statistique · doi:10.2307/1403797 · Cited by 2,516
Discriminatory analysis: Nonparametric discrimination: Consistency properties: (471672008-001)
Fix, E., & Hodges, J. L. (1951) · PsycEXTRA Dataset · doi:10.1037/e471672008-001 · Cited by 1,696
Quantum Effects in Communications Systems
Gordon, J. (1962) · Proceedings of the IRE · doi:10.1109/jrproc.1962.288169 · Cited by 196
AN EMPIRICAL BAYES APPROACH TO NON-PARAMETRIC TWO-WAY CLASSIFICATION,
Johns, M. V. (1959) · Cited by 35
Cited by
Consistent Nonparametric Regression
Stone, C. J. (1977) · The Annals of Statistics · doi:10.1214/aos/1176343886 · Cited by 1,792
The condensed nearest neighbor rule (Corresp.)
Hart, P. (1968) · IEEE Transactions on Information Theory · doi:10.1109/tit.1968.1054155 · Cited by 1,733
SVM-KNN: Discriminative Nearest Neighbor Classification for Visual Category Recognition
Zhang, H., Berg, A. C., Maire, M., & Malik, J. (2006) · 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (CVPR'06) · doi:10.1109/cvpr.2006.301 · Cited by 1,114
Fast pose estimation with parameter-sensitive hashing
Shakhnarovich, Viola, & Darrell (2003) · Proceedings Ninth IEEE International Conference on Computer Vision · doi:10.1109/iccv.2003.1238424 · Cited by 758
The reduced nearest neighbor rule (Corresp.)
Gates, G. (1972) · IEEE Transactions on Information Theory · doi:10.1109/tit.1972.1054809 · Cited by 566
Metadata
- Authors
- Cover, T.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1968-01
- Volume
- 14
- Issue
- 1
- Pages
- 50-55
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2044523229
- Cited by
- 365
- References
- 5
- FWCI
- 4.94
- Type
- journal article
- Language
- en
- Open access
- closed
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
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.