The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Choice of neighbor order in nearest-neighbor classification
Open accessAbstract
The kth-nearest neighbor rule is arguably the simplest and most intuitively appealing nonparametric classification procedure. However, application of this method is inhibited by lack of knowledge about its properties, in particular, about the manner in which it is influenced by the value of k; and by the absence of techniques for empirical choice of k. In the present paper we detail the way in which the value of k determines the misclassification error. We consider two models, Poisson and Binomial, for the training samples. Under the first model, data are recorded in a Poisson stream and are “assigned” to one or other of the two populations in accordance with the prior probabilities. In particular, the total number of data in both training samples is a Poisson-distributed random variable. Under the Binomial model, however, the total number of data in the training samples is fixed, although again each data value is assigned in a random way. Although the values of risk and regret associated with the Poisson and Binomial models are different, they are asymptotically equivalent to first order, and also to the risks associated with kernel-based classifiers that are tailored to the case of two derivatives. These properties motivate new methods for choosing the value of k.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
A Probabilistic Theory of Pattern Recognition
Devroye, L., Györfi, L., & Lugosi, G. (1996) · Stochastic Modelling and Applied Probability · doi:10.1007/978-1-4612-0711-5 · Cited by 3,274
Discriminatory 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
A Distribution-Free Theory of Nonparametric Regression
Györfi, L., Kohler, M., Krzyżak, A., & Walk, H. (2002) · Springer Series in Statistics · doi:10.1007/b97848 · Cited by 1,738
Smooth discrimination analysis
Mammen, E., & Tsybakov, A. B. (1999) · The Annals of Statistics · doi:10.1214/aos/1017939240 · Cited by 377
Fast learning rates for plug-in classifiers
Audibert, J.-Y., & Tsybakov, A. B. (2007) · The Annals of Statistics · doi:10.1214/009053606000001217 · Cited by 326
On the Strong Universal Consistency of Nearest Neighbor Regression Function Estimates
Devroye, L., Gyorfi, L., Krzyzak, A., & Lugosi, G. (1994) · The Annals of Statistics · doi:10.1214/aos/1176325633 · Cited by 304
The Strong Uniform Consistency of Nearest Neighbor Density Estimates
Devroye, L., & Wagner, T. J. (1977) · The Annals of Statistics · doi:10.1214/aos/1176343851 · Cited by 145
Rates of convergence of nearest neighbor estimation under arbitrary sampling
Kulkarni, S. R., & Posner, S. E. (1995) · IEEE Transactions on Information Theory · doi:10.1109/18.391248 · Cited by 120
8 Nearest neighbor methods in discrimination
Devroye, L., & Wagner, T. J. (1982) · Handbook of statistics · doi:10.1016/s0169-7161(82)02011-2 · Cited by 82
Cited by
Machine-learning phase prediction of high-entropy alloys
Huang, W., Martin, P., & Zhuang, H. L. (2019) · Acta Materialia · doi:10.1016/j.actamat.2019.03.012 · Cited by 556
Rashidi, H. H., Tran, N. K., Betts, E. V., Howell, L. P., & Green, R. (2019) · Academic Pathology · doi:10.1177/2374289519873088 · Cited by 371
Machine learning applications in minerals processing: A review
McCoy, J. T., & Auret, L. (2019) · Minerals Engineering · doi:10.1016/j.mineng.2018.12.004 · Cited by 317
Reducto: On-Camera Filtering for Resource-Efficient Real-Time Video Analytics
Li, Y., Padmanabhan, A., Zhao, P., Wang, Y., Xu, G. H., & Netravali, R. (2020) · Proceedings of the Annual conference of the ACM Special Interest Group on Data Communication on the applications, technologies, architectures, and protocols for computer communication · doi:10.1145/3387514.3405874 · Cited by 269
Deep learning classification of lung cancer histology using CT images
Chaunzwa, T. L., Hosny, A., Xu, Y., Shafer, A., Diao, N., Lanuti, M., Christiani, D. C., Mak, R. H., & Aerts, H. J. W. L. (2021) · Scientific Reports · doi:10.1038/s41598-021-84630-x · Cited by 257
Metadata
- Authors
- Hall, P., Park, B. U., & Samworth, R. J.
- Venue
- The Annals of Statistics
- Publisher
- Institute of Mathematical Statistics
- Published
- 2008-10-01
- Volume
- 36
- Issue
- 5
- Pages
- 2135-2152
- ISSN
- 0090-5364 (ISSN-L)
- OpenAlex
- W2137839571
- Cited by
- 329
- References
- 17
- FWCI
- 7.45
- Type
- journal article
- Language
- en
- Open access
- bronze
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: Choice of neighbor order in nearest-neighbor classification. https://app.cochat.ai/papers/10.1214/07-aos537
- The paper
- Hall, P., Park, B. U., & Samworth, R. J. (2008). Choice of neighbor order in nearest-neighbor classification. The Annals of Statistics. https://doi.org/10.1214/07-aos537
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.