Binary Classification using K-Nearest Neighbor Algorithm on FPGA
Authors:
- 26 December 2021
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
Abstract
The K-Nearest Neighbor (K-NN) algorithm is one of the most widely used algorithms for machine learning applications. Using K-NN algorithm on massively large data requires high computation power. This high computation demand can not be met by traditional software-based approach using CPUs. Field Programmable Gate Array (FPGA) can be used to implement K-NN algorithm to achieve hardware acceleration. In this paper, we implemented K-NN on Xilinx FPGA using Verilog Hardware Description Language (HDL) by exploiting the raw hardware power. The result shows that our FPGA-based solution is on average 30 thousand times faster than traditional software-based solution on CPU.Keywords
This publication has 9 references indexed in Scilit:
- VineTalk: Simplifying software access and sharing of FPGAs in datacenters2017
- A survey on reconfigurable accelerators for cloud computing2016
- Hardware and software performance of image processing applications on reconfigurable systems2015
- An Efficient KNN Algorithm Implemented on FPGA Based Heterogeneous Computing System Using OpenCL2015
- An adaptive FPGA implementation of multi-core K-nearest neighbour ensemble classifier using dynamic partial reconfiguration2012
- Flexible IP cores for the k-NN classification problem and their FPGA implementation2010
- A DESCRIPTIVE FRAMEWORK FOR THE FIELD OF DATA MINING AND KNOWLEDGE DISCOVERYInternational Journal of Information Technology & Decision Making, 2008
- Accelerating Compute-Intensive Applications with GPUs and FPGAs2008
- Top 10 algorithms in data miningKnowledge and Information Systems, 2007