A high performance systolic architecture for k-NN classification

This paper describes the architecture of the winning entry to the 2014 Memocode Design Contest, in the maximum performance category. This year's Memocode design contest asks contestants to find the 10 nearest neighbors between 1,000 testing points and 10,000,000 training points. Instead of using Euclidean distance, the contest uses Mahalanobis distance. The contest has 2 awards: the maximum performance award and the cost adjusted performance award. Our implementation uses a brute force approach that calculates the distance between every testing point to every training point. We use the Convey HC-2ex, a FPGA-based platform. However, the theory applies to software implementations as well. At the time of publication, our runtime is 0.54 seconds.

[1]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[2]  David G. Lowe,et al.  Shape indexing using approximate nearest-neighbour search in high-dimensional spaces , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[3]  Piotr Indyk,et al.  Approximate nearest neighbors: towards removing the curse of dimensionality , 1998, STOC '98.

[4]  Han Ya-juan,et al.  Research for multidimensional systems diagnostic analysis based on improved mahalanobis distance , 2009, 2009 16th International Conference on Industrial Engineering and Engineering Management.

[5]  Chang-Lun Zhang,et al.  Multi-class support vector machines based on the mahalanobis distance , 2011, 2011 International Conference on Machine Learning and Cybernetics.

[6]  Yasin Abbasi-Yadkori,et al.  Fast Approximate Nearest-Neighbor Search with k-Nearest Neighbor Graph , 2011, IJCAI.

[7]  G Verdier,et al.  Adaptive Mahalanobis Distance and $k$ -Nearest Neighbor Rule for Fault Detection in Semiconductor Manufacturing , 2011, IEEE Transactions on Semiconductor Manufacturing.

[8]  Piotr Indyk,et al.  Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality , 2012, Theory Comput..