Asymptotic Properties of Nearest Neighbor Rules Using Edited Data
- 1 July 1972
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics
- Vol. SMC-2 (3) , 408-421
- https://doi.org/10.1109/tsmc.1972.4309137
Abstract
Summary:Prototype Selection (PS) techniques have traditionally been applied prior to Nearest Neighbour (NN) classification rules both to improve its accuracy (editing) and to alleviate its computational burden (condensing). Methods based on selecting/discarding prototypes and methods based on adapting prototypes have been separately introduced to deal with this problem. Different approaches to this problem are considered in this paper and their main advantages and drawbacks are pointed out along with some suggestions for their joint application in some casesKeywords
This publication has 8 references indexed in Scilit:
- A generalized k-nearest neighbor ruleInformation and Control, 1970
- LEARNING IN PATTERN RECOGNITIONPublished by Elsevier ,1969
- State of the art in pattern recognitionProceedings of the IEEE, 1968
- Pattern Classification by Adaptive MachinesScience, 1967
- Nearest neighbor pattern classificationIEEE Transactions on Information Theory, 1967
- On a General Concept of "In Probability"The Annals of Mathematical Statistics, 1959
- Large-Sample Theory: Parametric CaseThe Annals of Mathematical Statistics, 1956
- On Stochastic Limit and Order RelationshipsThe Annals of Mathematical Statistics, 1943