Affiliation:
1. National & Kapodistrian University of Athens, Greece
Abstract
We designed a variety of k-nearest-neighbor parallel architectures for FPGAs in the form of parameterizable soft IP cores. We show that they can be used to solve large classification problems with thousands of training vectors, or thousands of vector dimensions using a single FPGA, and achieve very high throughput. They can be used to flexibly synthesize architectures that also cover: 1NN classification (vector quantization), multishot queries (with different
k
), LOOCV cross-validation, and compare favorably to GPU implementations. To the best of our knowledge this is the first attempt to design flexible IP cores for the popular kNN classifier.
Publisher
Association for Computing Machinery (ACM)
Subject
Hardware and Architecture,Software
Reference27 articles.
1. Robust linear programming discrimination of two linearly inseparable sets
2. Breast Cancer Dataset. 2010. archive.ics.uci.edu/ml/datasets/Breast+Cancer+Wisconsin+(Diagnostic). Breast Cancer Dataset. 2010. archive.ics.uci.edu/ml/datasets/Breast+Cancer+Wisconsin+(Diagnostic).
3. Breast Cancer Dataset. 1992. http://archive.ics.uci.edu/ml/datasets/Breast+Cancer+Wisconsin+%28 Original%29. Breast Cancer Dataset. 1992. http://archive.ics.uci.edu/ml/datasets/Breast+Cancer+Wisconsin+%28 Original%29.
4. A systolic algorithm for the k-nearest neighbors problem
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献