Web users browsing behavior prediction by implementing support vector machines in MapReduce using cloud based Hadoop

Pradipsinh K. Chavda, J. S. Dhobi
{"title":"Web users browsing behavior prediction by implementing support vector machines in MapReduce using cloud based Hadoop","authors":"Pradipsinh K. Chavda, J. S. Dhobi","doi":"10.1109/NUICONE.2015.7449648","DOIUrl":null,"url":null,"abstract":"The motivation behind the work is that the prediction of web user's browsing behavior while serving the Internet, reduces the user's browsing access time and avoids the visit of unnecessary pages to ease network traffic. This research work introduces parallel Support Vector Machines for web page prediction. The web contains an enormous amount of data and web data increases exponentially, but the training time for Support vector machine is very large. That is, SVM's suffer from a widely recognized scalability problems in both memory requirements and computation time when the input dataset is too large. To address this, we aimed at training the Support vector machine model in MapReduce programming model of Hadoop framework, since the MapReduce programming model has the ability to rapidly process a large amount of data in parallel. MapReduce works in tandem with Hadoop Distributed File System (HDFS). The so proposed approach will solve the scalability problem of present SVM algorithm. The performance of the proposed approach is evaluated in Amazon cloud EC2 using cloud-based Hadoop. Our experiments show the effectiveness in term of training time and also improve the preprocessing time. We find in our research study that a number of nodes increased the training time of proposed algorithm is decreased. We checked that parallelization of SMO has no more negative effect on the accuracy level, as compared to the standard approach.","PeriodicalId":131332,"journal":{"name":"2015 5th Nirma University International Conference on Engineering (NUiCONE)","volume":"144 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 5th Nirma University International Conference on Engineering (NUiCONE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NUICONE.2015.7449648","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

The motivation behind the work is that the prediction of web user's browsing behavior while serving the Internet, reduces the user's browsing access time and avoids the visit of unnecessary pages to ease network traffic. This research work introduces parallel Support Vector Machines for web page prediction. The web contains an enormous amount of data and web data increases exponentially, but the training time for Support vector machine is very large. That is, SVM's suffer from a widely recognized scalability problems in both memory requirements and computation time when the input dataset is too large. To address this, we aimed at training the Support vector machine model in MapReduce programming model of Hadoop framework, since the MapReduce programming model has the ability to rapidly process a large amount of data in parallel. MapReduce works in tandem with Hadoop Distributed File System (HDFS). The so proposed approach will solve the scalability problem of present SVM algorithm. The performance of the proposed approach is evaluated in Amazon cloud EC2 using cloud-based Hadoop. Our experiments show the effectiveness in term of training time and also improve the preprocessing time. We find in our research study that a number of nodes increased the training time of proposed algorithm is decreased. We checked that parallelization of SMO has no more negative effect on the accuracy level, as compared to the standard approach.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
利用基于云的Hadoop在MapReduce中实现支持向量机来预测Web用户的浏览行为
工作背后的动机是,在为互联网服务的同时,预测网络用户的浏览行为,减少用户的浏览访问时间,避免不必要的页面访问,以缓解网络流量。本研究将并行支持向量机引入网页预测。网络包含了大量的数据,并且网络数据呈指数增长,但支持向量机的训练时间非常大。也就是说,当输入数据集太大时,支持向量机在内存需求和计算时间方面都存在公认的可伸缩性问题。为了解决这个问题,我们的目标是在Hadoop框架的MapReduce编程模型中训练支持向量机模型,因为MapReduce编程模型具有快速并行处理大量数据的能力。MapReduce与HDFS (Hadoop Distributed File System)协同工作。该方法解决了现有支持向量机算法的可扩展性问题。采用基于云的Hadoop在Amazon cloud EC2中对该方法的性能进行了评估。实验结果表明,该方法在减少训练时间的同时,也缩短了预处理时间。在我们的研究中,我们发现节点数量的增加会减少算法的训练时间。我们检查了与标准方法相比,SMO的并行化对精度水平没有更多的负面影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Brain computer interface: A review A comparative study of various community detection algorithms in the mobile social network TCP with sender assisted delayed acknowledgement — A novel ACK thinning scheme Data streams and privacy: Two emerging issues in data classification ANFIS as a controller for fractional order system
×
引用
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