Quantity forecast of administrative items based on parallel random forest

Linxia Zhong, W. Wan, Ziyue Luo, Xiaodong Zhang
{"title":"Quantity forecast of administrative items based on parallel random forest","authors":"Linxia Zhong, W. Wan, Ziyue Luo, Xiaodong Zhang","doi":"10.1049/CP.2017.0112","DOIUrl":null,"url":null,"abstract":"The ultimate goal of this paper is to train a model based on the given administrative data to predict the amount of each administrative item of month in different years and different regions as accurate as possible. In this paper, we propose a novel approach for quantity forecast of administrative data which is named after parallel random forest (parallel RF). Firstly, we collect administrative data from different online systems using java program and store it in MongoDB. Then we extract key information from these data and assign different numbers to different administrative areas and item names. Next, as the core of whole method, we train the prediction model by implementing the random forest method on Hadoop Map-Reduce. Finally, we compare the execution efficiency and prediction accuracy with other standard algorithms such as SVM and gradient boosting. The experiment shows that the accuracy and efficiency of our method is much better than other algorithms and our method is more reliable and useful.","PeriodicalId":424212,"journal":{"name":"4th International Conference on Smart and Sustainable City (ICSSC 2017)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"4th International Conference on Smart and Sustainable City (ICSSC 2017)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1049/CP.2017.0112","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The ultimate goal of this paper is to train a model based on the given administrative data to predict the amount of each administrative item of month in different years and different regions as accurate as possible. In this paper, we propose a novel approach for quantity forecast of administrative data which is named after parallel random forest (parallel RF). Firstly, we collect administrative data from different online systems using java program and store it in MongoDB. Then we extract key information from these data and assign different numbers to different administrative areas and item names. Next, as the core of whole method, we train the prediction model by implementing the random forest method on Hadoop Map-Reduce. Finally, we compare the execution efficiency and prediction accuracy with other standard algorithms such as SVM and gradient boosting. The experiment shows that the accuracy and efficiency of our method is much better than other algorithms and our method is more reliable and useful.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于并行随机森林的行政项目数量预测
本文的最终目标是训练一个基于给定行政数据的模型,尽可能准确地预测不同年份和不同地区的每个月的行政项目的数量。本文提出了一种新的行政数据数量预测方法——并行随机森林(parallel random forest)。首先,我们使用java程序从不同的在线系统收集管理数据,并将其存储在MongoDB中。然后,我们从这些数据中提取关键信息,并为不同的管理区域和项目名称分配不同的编号。接下来,作为整个方法的核心,我们通过在Hadoop Map-Reduce上实现随机森林方法来训练预测模型。最后,比较了SVM和梯度增强算法的执行效率和预测精度。实验表明,该方法的精度和效率都大大优于其他算法,具有较高的可靠性和实用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
GPS data cleaning and analysis based on YouSense mobile application A new approach for tracking human body movements by kinect sensor Crowd counting and density estimation via two-column convolutional neural network Human pose estimation via improved ResNet50 IOT based smart restaurant system using RFID
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1