Efficient Distributed Decision Trees for Robust Regression

The availability of massive volumes of data and recent advances in data collection and processing platforms have motivated the development of distributed machine learning algorithms. In numerous real-world applications large datasets are inevitably noisy and contain outliers. These outliers can dramatically degrade the performance of standard machine learning approaches such as regression trees. To this end, we present a novel distributed regression tree approach that utilizes robust regression statistics, statistics that are more robust to outliers, for handling large and noisy data. We propose to integrate robust statistics based error criteria into the regression tree. A data summarization method is developed and used to improve the efficiency of learning regression trees in the distributed setting. We implemented the proposed approach and baselines based on Apache Spark, a popular distributed data processing platform. Extensive experiments on both synthetic and real datasets verify the effectiveness and efficiency of our approach.

Presented at:
European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML-PKDD), Riva del Garda, Italy, September 19–23, 2016

 Record created 2016-06-29, last modified 2018-03-17

Download fulltextPDF
Download fulltextPDF
Rate this document:

Rate this document:
(Not yet reviewed)