RPkNN: An OpenCL-Based FPGA Implementation of the Dimensionality-Reduced kNN Algorithm Using Random Projection

Due to the so-called curse of dimensionality and increase in the size of databases, there is an ever-increasing demand for computing resources and memory bandwidth when performing the k-nearest neighbors (kNNs) algorithm, resulting in a slow-down to process large datasets. This work presents an Open...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on very large scale integration (VLSI) systems Ročník 30; číslo 4; s. 549 - 552
Hlavní autoři:	Bank Tavakoli, Erfan, Beygi, Amir, Yao, Xuebin
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York IEEE 01.04.2022 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Algorithms Bandwidth Computation Computer architecture Dynamic random access memory Field programmable gate arrays Field-programmable gate array (FPGA) Hardware k-nearest neighbors (kNNs) K-nearest neighbors algorithm Kernel Modules near-storage acceleration Projection Random access memory random projection Solid state devices Sparse matrices
ISSN:	1063-8210, 1557-9999
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!