Communications of the ACM - Special section on computer architecture
An algorithm for finding nearest neighbours in (approximately) constant average time
Pattern Recognition Letters
An alternative nearest neighbour classification scheme
Pattern Recognition Letters
The Nearest Neighbor and the Bayes Error Rates
IEEE Transactions on Pattern Analysis and Machine Intelligence
A parallel architecture comes of age at last
IEEE Spectrum
Communication effect basic linear algebra computations on hypercube architectures
Journal of Parallel and Distributed Computing
A multiple-processor architecture for image processing
A multiple-processor architecture for image processing
Parallel Algorithms for Image Template Matching on Hypercube SIMD Computers
IEEE Transactions on Pattern Analysis and Machine Intelligence
Algorithms for clustering data
Algorithms for clustering data
Parallel processing approaches to edge relaxation
Pattern Recognition
On the Communication Complexity of Generalized 2-D Convolution on Array Processors
IEEE Transactions on Computers
Simulating parallel architectures in a distributed environment
Journal of Parallel and Distributed Computing - Special issue: software tools for parallel programming and visualization
Highly parallel computing
Handbook of pattern recognition and image processing (vol. 2): computer vision
Handbook of pattern recognition and image processing (vol. 2): computer vision
Computer Architecture and Parallel Processing
Computer Architecture and Parallel Processing
Parallel Processing with the Perfect Shuffle
IEEE Transactions on Computers
Parallel Processing Approaches to Image Correlation
IEEE Transactions on Computers
The Universality of the Shuffle-Exchange Network
IEEE Transactions on Computers
A Branch and Bound Algorithm for Computing k-Nearest Neighbors
IEEE Transactions on Computers
On a Class of Multistage Interconnection Networks
IEEE Transactions on Computers
An Algorithm for Finding Nearest Neighbors
IEEE Transactions on Computers
Finding Prototypes For Nearest Neighbor Classifiers
IEEE Transactions on Computers
The Organization and Use of Parallel Memories
IEEE Transactions on Computers
The multidimensional access memory in STARAN
IEEE Transactions on Computers - Special issue on parallel processors and processing
A VLSI Systolic Architecture for Pattern Clustering
IEEE Transactions on Pattern Analysis and Machine Intelligence
The condensed nearest neighbor rule (Corresp.)
IEEE Transactions on Information Theory
The reduced nearest neighbor rule (Corresp.)
IEEE Transactions on Information Theory
An improved branch and bound algorithm for computing k-nearest neighbors
Pattern Recognition Letters
Interactive data mining on a CBEA cluster
HPCS'09 Proceedings of the 23rd international conference on High Performance Computing Systems and Applications
Parallel nearest neighbour algorithms for text categorization
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
| Hi-index | 0.00 |
The nearest neighbor (NN) classification schemes have been popular in pattern recognition because of their efficiency and simplicity. The computation of distances of a testing pattern to the training patterns is very time-consuming. This paper proposes several parallel algorithms for nearest neighbor classification on two different types of SIMD machines. One type of SIMD machine has parallel shared memory modules. An alignment network is used to connect the processors and the memory modules. The data storage schemes and two different procedures on this machine type are presented. The other type of machines employs only a distributed memory system and an interconnection network. The data distribution and communication issues are discussed. For a problem with N"p training patterns and N"f features, comparing the distances from a testing pattern to all training patterns takes O(N"pN"f) time on a sequential machine. The distance computation and comparison can be performed in parallel. The proposed algorithms on a parallel machine with Q processing elements (PEs) take approximately O(N"pN"f/Q) time.