CudaRF: A CUDA-based Implementation of Random Forests

Hakan Grahn, Niklas Lavesson, Mikael Hellborg Lapajne, Daniel Slat
School of Computing, Blekinge Institute of Technology, SE-371 39 Karlskrona, Sweden
9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA), 2011


   title={CudaRF: A CUDA-based Implementation of Random Forests},

   author={Grahn, H. and Lavesson, N. and Lapajne, M.H. and Slat, D.},



Download Download (PDF)   View View   Source Source   



Machine learning algorithms are frequently applied in data mining applications. Many of the tasks in this domain concern high-dimensional data. Consequently, these tasks are often complex and computationally expensive. This paper presents a GPU-based parallel implementation of the Random Forests algorithm. In contrast to previous work, the proposed algorithm is based on the compute unified device architecture (CUDA). An experimental comparison between the CUDA-based algorithm (CudaRF), and state-of-the-art Random Forests algorithms (FastRF and LibRF) shows that CudaRF outperforms both FastRF and LibRF for the studied classification task.
Rating: 1.2/5. From 3 votes.
Please wait...

* * *

* * *

HGPU group © 2010-2021 hgpu.org

All rights belong to the respective authors

Contact us: