Improving Webpage Access Predictions Based on Sequence Prediction and PageRank Algorithm

Dã Thôn Nguyen, Hanh T Tan, Duy Hoang Pham
{"title":"Improving Webpage Access Predictions Based on Sequence Prediction and PageRank Algorithm","authors":"Dã Thôn Nguyen, Hanh T Tan, Duy Hoang Pham","doi":"10.28945/4176","DOIUrl":null,"url":null,"abstract":"Aim/Purpose: In this article, we provide a better solution to Webpage access prediction. In particularly, our core proposed approach is to increase accuracy and efficiency by reducing the sequence space with integration of PageRank into CPT+. Background: The problem of predicting the next page on a web site has become significant because of the non-stop growth of Internet in terms of the volume of contents and the mass of users. The webpage prediction is complex because we should consider multiple kinds of information such as the webpage name, the contents of the webpage, the user profile, the time between webpage visits, differences among users, and the time spent on a page or on each part of the page. Therefore, webpage access prediction draws substantial effort of the web mining research community in order to obtain valuable information and improve user experience as well. Methodology: CPT+ is a complex prediction algorithm that dramatically offers more accurate predictions than other state-of-the-art models. The integration of the importance of every particular page on a website (i.e., the PageRank) regarding to its associations with other pages into CPT+ model can improve the performance of the existing model. Contribution: In this paper, we propose an approach to reduce prediction space while improving accuracy through combining CPT+ and PageRank algorithms. Experimental results on several real datasets indicate the space reduced by up to between 15% and 30%. As a result, the run-time is quicker. Furthermore, the prediction accuracy is improved. It is convenient that researchers go on using CPT+ to predict Webpage access. Findings: Our experimental results indicate that PageRank algorithm is a good solution to improve CPT+ prediction. An amount of though approximately 15 % to 30% of redundant data is removed from datasets while improving the accuracy. Recommendations for Practitioners: The result of the article could be used in developing relevant applications such as Webpage and product recommendation systems. Recommendation for Researchers: The paper provides a prediction model that integrates CPT+ and PageRank algorithms to tackle the problem of complexity and accuracy. The model has been experimented against several real datasets in order to show its performance. Impact on Society: Given an improving model to predict Webpage access using in several fields such as e-learning, product recommendation, link prediction, and user behavior prediction, the society can enjoy a better experience and more efficient environment while surfing the Web. Future Research: We intend to further improve the accuracy of webpage access prediction by using the combination of CPT+ and other algorithms.","PeriodicalId":38962,"journal":{"name":"Interdisciplinary Journal of Information, Knowledge, and Management","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Interdisciplinary Journal of Information, Knowledge, and Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.28945/4176","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Computer Science","Score":null,"Total":0}
引用次数: 1

Abstract

Aim/Purpose: In this article, we provide a better solution to Webpage access prediction. In particularly, our core proposed approach is to increase accuracy and efficiency by reducing the sequence space with integration of PageRank into CPT+. Background: The problem of predicting the next page on a web site has become significant because of the non-stop growth of Internet in terms of the volume of contents and the mass of users. The webpage prediction is complex because we should consider multiple kinds of information such as the webpage name, the contents of the webpage, the user profile, the time between webpage visits, differences among users, and the time spent on a page or on each part of the page. Therefore, webpage access prediction draws substantial effort of the web mining research community in order to obtain valuable information and improve user experience as well. Methodology: CPT+ is a complex prediction algorithm that dramatically offers more accurate predictions than other state-of-the-art models. The integration of the importance of every particular page on a website (i.e., the PageRank) regarding to its associations with other pages into CPT+ model can improve the performance of the existing model. Contribution: In this paper, we propose an approach to reduce prediction space while improving accuracy through combining CPT+ and PageRank algorithms. Experimental results on several real datasets indicate the space reduced by up to between 15% and 30%. As a result, the run-time is quicker. Furthermore, the prediction accuracy is improved. It is convenient that researchers go on using CPT+ to predict Webpage access. Findings: Our experimental results indicate that PageRank algorithm is a good solution to improve CPT+ prediction. An amount of though approximately 15 % to 30% of redundant data is removed from datasets while improving the accuracy. Recommendations for Practitioners: The result of the article could be used in developing relevant applications such as Webpage and product recommendation systems. Recommendation for Researchers: The paper provides a prediction model that integrates CPT+ and PageRank algorithms to tackle the problem of complexity and accuracy. The model has been experimented against several real datasets in order to show its performance. Impact on Society: Given an improving model to predict Webpage access using in several fields such as e-learning, product recommendation, link prediction, and user behavior prediction, the society can enjoy a better experience and more efficient environment while surfing the Web. Future Research: We intend to further improve the accuracy of webpage access prediction by using the combination of CPT+ and other algorithms.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于序列预测和PageRank算法的网页访问预测改进
目的:在本文中,我们提供了一个更好的网页访问预测的解决方案。特别是,我们提出的核心方法是通过将PageRank集成到CPT+中来减少序列空间,从而提高准确性和效率。背景:由于互联网在内容量和用户数量方面的不断增长,预测网站下一页的问题变得非常重要。网页预测是复杂的,因为我们要考虑多种信息,如网页名称、网页内容、用户资料、网页访问间隔时间、用户之间的差异、在页面或页面各部分花费的时间等。因此,网页访问预测在获取有价值的信息和改善用户体验的同时,也吸引了web挖掘研究界的大量努力。方法:CPT+是一种复杂的预测算法,比其他最先进的模型提供更准确的预测。将网站上每个特定页面的重要性(即PageRank)与其他页面的关联整合到CPT+模型中可以提高现有模型的性能。在本文中,我们提出了一种结合CPT+和PageRank算法来减少预测空间的同时提高准确率的方法。在几个真实数据集上的实验结果表明,该算法的空间减少了15%到30%。因此,运行时更快了。进一步提高了预测精度。研究人员可以方便地继续使用CPT+预测网页访问。我们的实验结果表明,PageRank算法是提高CPT+预测的一个很好的解决方案。在提高准确性的同时,从数据集中删除了大约15%到30%的冗余数据。对从业者的建议:本文的结果可用于开发相关应用程序,如网页和产品推荐系统。对研究人员的建议:本文提供了一个集成CPT+和PageRank算法的预测模型,以解决复杂性和准确性问题。为了验证该模型的性能,在多个实际数据集上进行了实验。对社会的影响:在电子学习、产品推荐、链接预测、用户行为预测等多个领域,有了一个改进的预测网页访问的模型,社会可以在上网时享受更好的体验和更高效的环境。未来研究方向:我们打算将CPT+与其他算法相结合,进一步提高网页访问预测的准确性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
2.30
自引率
0.00%
发文量
14
期刊最新文献
IJIKM Volume 18, 2023 – Table of Contents Factors Affecting Individuals’ Behavioral Intention to Use Online Capital Market Investment Platforms in Indonesia Investigating the Adoption of Social Commerce: A Case Study of SMEs in Jordan The Influence of Big Data Management on Organizational Performance in Organizations: The Role of Electronic Records Management System Potentiality Customer Churn Prediction in the Banking Sector Using Machine Learning-Based Classification Models
×
引用
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