Change search
ReferencesLink to record
Permanent link

Direct link
A CUDA Implementation of Random Forests: Early Results
Responsible organisation
2010 (English)Conference paper (Refereed) Published
Abstract [en]

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 parallel (FastRF) and sequential (LibRF) Random forests algorithms shows that CudaRF outperforms both FastRF and LibRF for the studied classification task.

Place, publisher, year, edition, pages
Göteborg: Chalmers Institute of Technology , 2010.
Keyword [en]
machine learning, graphics processing unit, random forests
National Category
Computer Science
URN: urn:nbn:se:bth-7705Local ID: diva2:835353
Third Swedish Workshop on Multi-core Computing
Available from: 2012-09-18 Created: 2010-11-22 Last updated: 2015-06-30Bibliographically approved

Open Access in DiVA

fulltext(378 kB)21 downloads
File information
File name FULLTEXT01.pdfFile size 378 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Grahn, HåkanLavesson, Niklas
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 21 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 33 hits
ReferencesLink to record
Permanent link

Direct link