论文部分内容阅读
Classification is an important machine learning problem, and decision tree construction algorithms are an important class of solutions to this problem. Rain Forest 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 Rain Forest. 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.
Classification is an important machine learning problem, and decision tree construction algorithms are an important class of solutions to this problem. 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 Rain Forest. By using a more sophisticated switching criterion between the two algorithms, we are able to get a performance gain even Evaluations show that our method can achieve a performance boost of 2.8 times in average than the traditional recursive implementation.