A Comparative Study on Latest Substring Association Rule Mining and Hidden Markov Model

Rudra Chatterjee, C. Ray, R. Bag
{"title":"A Comparative Study on Latest Substring Association Rule Mining and Hidden Markov Model","authors":"Rudra Chatterjee, C. Ray, R. Bag","doi":"10.1109/ICCECE.2017.8526213","DOIUrl":null,"url":null,"abstract":"The Web usage mining techniques are used to scrutinize the web usage patterns for a web site. Web page prediction plays a vital role by predicting next set of web pages that a user may visit based on the knowledge of the previously visited pages. Web page prediction is the focus of attention of many researchers in recent times and different web page prediction frameworks have been proposed. In this paper, a comparative analysis between two different approaches of web page prediction, namely, Latest Substring Association Rule mining (LSA) and Hidden Markov Model (HMM) has been represented. Web page prediction is implemented by using both the approaches and the experimental results are provided. Finally, an improved approach for web page prediction is proposed at the end of the paper.","PeriodicalId":325599,"journal":{"name":"2017 International Conference on Computer, Electrical & Communication Engineering (ICCECE)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Conference on Computer, Electrical & Communication Engineering (ICCECE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCECE.2017.8526213","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

The Web usage mining techniques are used to scrutinize the web usage patterns for a web site. Web page prediction plays a vital role by predicting next set of web pages that a user may visit based on the knowledge of the previously visited pages. Web page prediction is the focus of attention of many researchers in recent times and different web page prediction frameworks have been proposed. In this paper, a comparative analysis between two different approaches of web page prediction, namely, Latest Substring Association Rule mining (LSA) and Hidden Markov Model (HMM) has been represented. Web page prediction is implemented by using both the approaches and the experimental results are provided. Finally, an improved approach for web page prediction is proposed at the end of the paper.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
最新子串关联规则挖掘与隐马尔可夫模型的比较研究
Web使用挖掘技术用于仔细检查Web站点的Web使用模式。网页预测通过预测用户可能访问的下一组网页(基于先前访问过的网页的知识)起着至关重要的作用。网页预测是近年来许多研究者关注的焦点,并提出了不同的网页预测框架。本文对最新子串关联规则挖掘(LSA)和隐马尔可夫模型(HMM)两种不同的网页预测方法进行了比较分析。应用这两种方法实现了网页预测,并给出了实验结果。最后,本文提出了一种改进的网页预测方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
SPP Based Compact Optical Power Splitter Using Two-Mode Interference Coupling SiC MOSFET Based VSC Used in HVDC Transmission with DC Fault Protection Scheme Performance Improvement of Tea Industry with Multi Objective Particle Swarm Optimisation A Comparative Study of Different Ensemble Learning Techniques Using Wisconsin Breast Cancer Dataset Cost Modelling, Sizing and Multi-Point Allocation of Solar Powered DG Using Multi-Objective Cuckoo Search Via Lévy Flights Considering Economic, Technical and Environmental Impacts Along with Voltage Stability
×
引用
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