Nearest neighbor classification on two types of SIMD machines

DOI10.1016/S0167-8191(05)80143-7zbMATH Open0737.68038MaRDI QIDQ1179239FDOQ1179239

Authors: Xiaobo Li 

Publication date: 26 June 1992

Published in: Parallel Computing (Search for Journal in Brave)

Recommendations

• On neural-network implementations of k-nearest neighbor pattern classifiers
• scientific article; zbMATH DE number 1241705
• Improved \(k\)-nearest neighbor classification
• scientific article; zbMATH DE number 78497

zbMATH Keywords

hypercube networkSIMD machinealignment networkcondensed NN rule

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Distributed algorithms (68W15)

Cited In (6)

• A complete system for NN classification based on a VLSI array processor
• A fast and compact classifier based on sorting in an iteratively expanded input space
• Overlap pattern synthesis with an efficient nearest neighbor classifier
• Computing nearest neighbors in real time
• \(\Theta(1)\) time neural network minimum distance classifier and its application to optical character recognition problem
• Hybrid hardware for a highly parallel search in the context of learning classifiers

This page was built for publication: Nearest neighbor classification on two types of SIMD machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1179239)