Taiga: performance optimization of the C4.5 decision tree construction algorithm
Lists
Only you see this
Abstract
Classification is an important machine learning problem, and decision tree construction algorithms are an important class of solutions to this problem. RainForest is a scalable way to implement decision tree construction algorithms. It consists of several algorithms, of which the best one is a hybrid between a traditional recursive implementation and an iterative implementation which uses more memory but involves less write operations. We propose an optimized algorithm inspired by RainForest. By using a more sophisticated switching criterion between the two algorithms, we are able to get a performance gain even when all statistical information fits in memory. Evaluations show that our method can achieve a performance boost of 2.8 times in average than the traditional recursive implementation.
BibTeX
@inproceedings{yang2016taiga,
author = {Yi Yang and Wenguang Chen},
title = {{Taiga: performance optimization of the C4.5 decision tree construction algorithm}},
booktitle = {Tsinghua},
year = {2016},
doi = {10.1109/tst.2016.7536719},
}Loading related content...