Nearest neighbor classification on two types of SIMD machines

DOI10.1016/S0167-8191(05)80143-7MaRDI QIDQ1179239zbMATH OpenFDO

Authors Xiaobo Li

Publication date 26 June 1992

Published in Parallel Computing (Search for Journal in Brave)

zbMATH Keywords

hypercube networkSIMD machinealignment networkcondensed NN rule

Mathematics Subject Classification ID

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

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

Cited in

(6)

• Computing nearest neighbors in real time
• Hybrid hardware for a highly parallel search in the context of learning classifiers
• 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
• \(\Theta(1)\) time neural network minimum distance classifier and its application to optical character recognition problem
• Overlap pattern synthesis with an efficient nearest neighbor classifier

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)