CUDT: A CUDA Based Decision Tree Algorithm

الملخص EN

Decision tree is one of the famous classification methods in data mining.

Many researches have been proposed, which were focusing on improving the performance of decision tree.

However, those algorithms are developed and run on traditional distributed systems.

Obviously the latency could not be improved while processing huge data generated by ubiquitous sensing node in the era without new technology help.

In order to improve data processing latency in huge data mining, in this paper, we design and implement a new parallelized decision tree algorithm on a CUDA (compute unified device architecture), which is a GPGPU solution provided by NVIDIA.

In the proposed system, CPU is responsible for flow control while the GPU is responsible for computation.

We have conducted many experiments to evaluate system performance of CUDT and made a comparison with traditional CPU version.

The results show that CUDT is 5∼55 times faster than Weka-j48 and is 18 times speedup than SPRINT for large data set.