A new method of optimizing prototypes for nearest neighbor classifiers using a multi-layer network
- 31 January 1995
- journal article
- Published by Elsevier in Pattern Recognition Letters
- Vol. 16 (1), 77-82
- https://doi.org/10.1016/0167-8655(94)00070-j
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Handwritten digit recognition using an optimized nearest neighbor classifierPattern Recognition Letters, 1994
- A new version of the nearest-neighbour approximating and eliminating search algorithm (AESA) with linear preprocessing time and memory requirementsPattern Recognition Letters, 1994
- Prototype optimization for nearest neighbor classifiers using a two-layer perceptronPattern Recognition, 1993
- An algorithm for finding nearest neighbours in (approximately) constant average timePattern Recognition Letters, 1986
- A Technique to Identify Nearest NeighborsIEEE Transactions on Systems, Man, and Cybernetics, 1976
- An algorithm for a selective nearest neighbor decision rule (Corresp.)IEEE Transactions on Information Theory, 1975
- A Branch and Bound Algorithm for Computing k-Nearest NeighborsIEEE Transactions on Computers, 1975
- Finding Prototypes For Nearest Neighbor ClassifiersIEEE Transactions on Computers, 1974
- The condensed nearest neighbor rule (Corresp.)IEEE Transactions on Information Theory, 1968
- Nearest neighbor pattern classificationIEEE Transactions on Information Theory, 1967