FPGA-Based K-Means Clustering Using Tree-Based Data Structures

Download Now
Provided by: Imperial College London
Topic: Hardware
Format: PDF
K-means clustering is a popular technique for partitioning a data set into subsets of similar features. Due to their simple control flow and inherent fine-grain parallelism, K-means algorithms are well suited for hardware implementations, such as on Field Programmable Gate Arrays (FPGAs), to accelerate the computationally intensive calculation. However, the available hardware resources in massively parallel implementations are easily exhausted for large problem sizes. This paper presents an FPGA implementation of an efficient variant of K-means clustering which prunes the search space using a binary kd-tree data structure to reduce the computational burden.
Download Now

Find By Topic