On neural-network implementations of k-nearest neighbor pattern classifiers
DOI10.1109/81.596943zbMATH Open0889.68126OpenAlexW2119084459WikidataQ57725034 ScholiaQ57725034MaRDI QIDQ4372802FDOQ4372802
Authors: Yanqiu Chen, Robert I. Damper, Mark S. Nixon 
Publication date: 2 June 1998
Published in: IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/81.596943
Recommendations
Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)
Cited In (12)
- Title not available (Why is that?)
- A complete system for NN classification based on a VLSI array processor
- A soft \(K\)-nearest neighbor voting scheme
- A high performance \(k\)-NN approach using binary neural networks
- A fast and compact classifier based on sorting in an iteratively expanded input space
- Title not available (Why is that?)
- Title not available (Why is that?)
- \(\Theta(1)\) time neural network minimum distance classifier and its application to optical character recognition problem
- Classification, association and pattern completion using neural similarity based methods
- GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING
- RBF-based neurodynamic nearest neighbor classification in real pattern space
- Title not available (Why is that?)
This page was built for publication: On neural-network implementations of k-nearest neighbor pattern classifiers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4372802)
