The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Asymptotic Properties of Nearest Neighbor Rules Using Edited Data
Abstract
The convergence properties of a nearest neighbor rule that uses an editing procedure to reduce the number of preclassified samples and to improve the performance of the rule are developed. Editing of the preclassified samples using the three-nearest neighbor rule followed by classification using the single-nearest neighbor rule with the remaining preclassified samples appears to produce a decision procedure whose risk approaches the Bayes' risk quite closely in many problems with only a few preclassified samples. The asymptotic risk of the nearest neighbor rules and the nearest neighbor rules using edited preclassified samples is calculated for several problems.
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
Principles of Communication Engineering
Jacobs, I. M., & Wozencraft, J. M. (1965) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,912
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
Decision-Making Processes in Pattern Recognition
Eddy, R. P., & Sebestyen, G. S. (1963) · Mathematics of Computation · doi:10.2307/2004038 · Cited by 402
On Stochastic Limit and Order Relationships
Mann, H. B., & Wald, A. (1943) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177731415 · Cited by 381
State of the art in pattern recognition
Nagy, G. (1968) · Proceedings of the IEEE · doi:10.1109/proc.1968.6414 · Cited by 293
Large-Sample Theory: Parametric Case
Chernoff, H. (1956) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177728347 · Cited by 248
A generalized k-nearest neighbor rule
Patrick, E. A., & Fischer, F. P. (1970) · Information and Control · doi:10.1016/s0019-9958(70)90081-1 · Cited by 188
LEARNING IN PATTERN RECOGNITION
Cover, T. M. (1969) · Elsevier eBooks · doi:10.1016/b978-1-4832-3093-1.50012-2 · Cited by 80
On pattern classification algorithms--Introduction and survey
Ho, Y., & Agrawala, A. K. (1968) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1968.1099027 · Cited by 39
Pattern Classification by Adaptive Machines
Rosen, C. A. (1967) · Science · doi:10.1126/science.156.3771.38 · Cited by 27
Cited by
Top 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 addition, data objects can be removed to improve classification accuracy, a process known as “editing” [88].”
BackgroundA study of the behavior of several methods for balancing machine learning training data
Batista, G. E. A. P. A., Prati, R. C., & Monard, M. C. (2004) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1007730.1007735 · Cited by 4,203
Survey on deep learning with class imbalance
Johnson, J. M., & Khoshgoftaar, T. M. (2019) · Journal of Big Data · doi:10.1186/s40537-019-0192-5 · Cited by 3,032
Classification in the Presence of Label Noise: A Survey
Frenay, B., & Verleysen, M. (2014) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2013.2292894 · Cited by 1,777
López, V., Fernández, A., García, S., Palade, V., & Herrera, F. (2013) · Information Sciences · doi:10.1016/j.ins.2013.07.007 · Cited by 1,590
Metadata
- Authors
- Wilson, D. L.
- Venue
- IEEE Transactions on Systems, Man, and Cybernetics
- Published
- 1972-07
- Volume
- SMC-2
- Issue
- 3
- Pages
- 408-421
- ISSN
- 0018-9472 (ISSN-L)
- 2168-2909
- OpenAlex
- W2107686700
- Cited by
- 2,130
- References
- 11
- FWCI
- 3.18
- 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.