The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A generalized k-nearest neighbor rule
Open accessAbstract
A family of supervised, nonparametric decision rules, based on tolerance regions, is described which includes the k -Nearest Neighbor decision rules when there are two classes. There are two practical reasons for doing so: first, a family of decision rules similar to the k -Nearest Neighbor rules can be specified which applies to a broader collection of pattern recognition problems. This is because in the general class of rules constraints are weakened between the number of training samples required in each training sample set and the respective a priori class probabilities; and, a discrete loss function weighting the importance of the finite number of ways to make a decision error can be introduced. Second, within the family of decision rules based on tolerance regions, there are decision rules which have a property allowing for preprocessing of the training set data resulting in significant data reduction. Theoretical performance for a special case is presented.
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
Cited by
Asymptotic Properties of Nearest Neighbor Rules Using Edited Data
Wilson, D. L. (1972) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1972.4309137 · Cited by 2,130
Biological shape and visual science (part I)
Blum, H. (1973) · Journal of Theoretical Biology · doi:10.1016/0022-5193(73)90175-6 · Cited by 1,159
Applications of Machine Learning in Cancer Prediction and Prognosis
Cruz, J. A., & Wishart, D. S. (2006) · Cancer Informatics · doi:10.1177/117693510600200030 · Cited by 1,100
Automatic Age Estimation Based on Facial Aging Patterns
Geng, X., Zhou, Z.-H., & Smith-Miles, K. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.70733 · Cited by 964
The use of machine learning algorithms in recommender systems: a systematic review
Portugal, I., Alencar, P., & Cowan, D. (2018) · Expert Systems with Applications · doi:10.1016/j.eswa.2017.12.020 · Cited by 743
“Today, there is a plethora of ML algorithms (k-nearest neighbor [48], clustering [28], Bayes network [22], to name a few types), which are used in applications that range from vacuum cleaner robots [13] and assistance for disabled people [30] to pattern recognition in images [63], or self-driving…”
Background
Metadata
- Authors
- Patrick, E. A., & Fischer, F. P.
- Venue
- Information and Control
- Publisher
- Elsevier BV
- Published
- 1970-04
- Volume
- 16
- Issue
- 2
- Pages
- 128-152
- ISSN
- 0019-9958 (ISSN-L)
- OpenAlex
- W1984047604
- Cited by
- 188
- References
- 1
- FWCI
- 30.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: A generalized k-nearest neighbor rule. https://app.cochat.ai/papers/10.1016/s0019-9958(70)90081-1
- The paper
- Patrick, E. A., & Fischer, F. P. (1970). A generalized k-nearest neighbor rule. Information and Control. https://doi.org/10.1016/s0019-9958(70)90081-1
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.