Distributed Decision Tree

Proceedings of the 9th Annual ACM India Conference Pub Date : 2016-10-21 DOI:10.1145/2998476.2998478

Ankit Desai, S. Chaudhary

{"title":"Distributed Decision Tree","authors":"Ankit Desai, S. Chaudhary","doi":"10.1145/2998476.2998478","DOIUrl":null,"url":null,"abstract":"Decision Tree is a tree-structured plan of a set of attributes to test in order to predict the output. MapReduce and Spark is a programming model used for processing data on a distributed file system. In this paper, MapReduce and Spark implementation of Decision Tree is named as Distributed Decision Tree (DDT) and Spark Tree (ST) respectively. Decision Tree (DT), Ensemble of Trees (BT), DDT and ST are compared over accuracy, size of tree and number of leaves of tree(s) generated. DDT and ST is empirically evaluated over 10 selected datasets. Using DDT, size of tree is reduced by 71% and 82% as compared to DT and BT respectively. In case of ST size of tree is reduced by 48% and 67% as compared to DT and BT. Number of leaves is reduced by 70% and 81% with respect to DT and BT, respectively using DDT. Whereas, it is reduced by 45% and 65% with respect to DT and BT in case of ST. We evaluated DDT and ST using Yahoo! Webscope dataset. Our evaluation shows improvement in accuracy as well as reduction in size of tree and number of leaves. Hence, DDT and ST outperformed DT and BT with respect to size of tree and number of leaves with adequate classification accuracy.","PeriodicalId":171399,"journal":{"name":"Proceedings of the 9th Annual ACM India Conference","volume":"235 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 9th Annual ACM India Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2998476.2998478","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 9

Abstract

Decision Tree is a tree-structured plan of a set of attributes to test in order to predict the output. MapReduce and Spark is a programming model used for processing data on a distributed file system. In this paper, MapReduce and Spark implementation of Decision Tree is named as Distributed Decision Tree (DDT) and Spark Tree (ST) respectively. Decision Tree (DT), Ensemble of Trees (BT), DDT and ST are compared over accuracy, size of tree and number of leaves of tree(s) generated. DDT and ST is empirically evaluated over 10 selected datasets. Using DDT, size of tree is reduced by 71% and 82% as compared to DT and BT respectively. In case of ST size of tree is reduced by 48% and 67% as compared to DT and BT. Number of leaves is reduced by 70% and 81% with respect to DT and BT, respectively using DDT. Whereas, it is reduced by 45% and 65% with respect to DT and BT in case of ST. We evaluated DDT and ST using Yahoo! Webscope dataset. Our evaluation shows improvement in accuracy as well as reduction in size of tree and number of leaves. Hence, DDT and ST outperformed DT and BT with respect to size of tree and number of leaves with adequate classification accuracy.

查看原文本刊更多论文

分布式决策树

决策树是一组属性的树状结构计划，用于测试以预测输出。MapReduce和Spark是一种用于在分布式文件系统上处理数据的编程模型。本文将MapReduce和Spark对决策树的实现分别命名为Distributed Decision Tree (DDT)和Spark Tree (ST)。比较了决策树(DT)、树集合(BT)、滴滴涕(DDT)和ST的精度、树的大小和生成的树的叶子数。在10个选定的数据集上对DDT和ST进行了经验评估。与滴滴涕和BT相比，使用滴滴涕可使树的大小分别减少71%和82%。在ST情况下，与DT和BT相比，使用DDT的树的大小分别减少48%和67%，叶片数量分别减少70%和81%。然而，在ST的情况下，它相对于DT和BT减少了45%和65%。我们使用Yahoo!Webscope数据集。我们的评估显示精度的提高，以及树的大小和叶片数量的减少。因此，滴滴涕和ST在树的大小和叶数方面优于DT和BT，并且具有足够的分类精度。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Proceedings of the 9th Annual ACM India Conference

自引率

0.00%

发文量