Web Request Predictions

R. Appleton, B. Slater, Connor Laitinen, L. Ammel, Cody Malnor
{"title":"Web Request Predictions","authors":"R. Appleton, B. Slater, Connor Laitinen, L. Ammel, Cody Malnor","doi":"10.29007/H63W","DOIUrl":null,"url":null,"abstract":"If one could predict future web requests, it would be possible to make the web much faster. One could fetch web resources before they are needed. When the human user clicks on a link, the needed data would already have been downloaded. We have created several algorithms that attempt to predict future web requests based on past histories. Our research evaluates and compares these prediction algorithms against real histories of web usage. Prediction algorithm results are compared based on correct predictions, erroneous predictions, and prediction rate. Some algorithms make predictions rarely but accurately, while others may predict more often but with less accuracy. To take full advantage of this, we combine multiple algorithms and use different voting strategies to determine the best prediction.","PeriodicalId":264035,"journal":{"name":"International Conference on Computers and Their Applications","volume":"89 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Computers and Their Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.29007/H63W","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

If one could predict future web requests, it would be possible to make the web much faster. One could fetch web resources before they are needed. When the human user clicks on a link, the needed data would already have been downloaded. We have created several algorithms that attempt to predict future web requests based on past histories. Our research evaluates and compares these prediction algorithms against real histories of web usage. Prediction algorithm results are compared based on correct predictions, erroneous predictions, and prediction rate. Some algorithms make predictions rarely but accurately, while others may predict more often but with less accuracy. To take full advantage of this, we combine multiple algorithms and use different voting strategies to determine the best prediction.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Web请求预测
如果人们能够预测未来的网络请求,就有可能使网络更快。人们可以在需要之前获取网络资源。当人类用户单击链接时,所需的数据已经下载完毕。我们已经创建了几个算法,试图根据过去的历史来预测未来的网络请求。我们的研究将这些预测算法与真实的网络使用历史进行评估和比较。根据正确预测、错误预测和预测率对预测算法的结果进行比较。一些算法很少做出预测,但却很准确,而另一些算法可能预测得更频繁,但准确性较低。为了充分利用这一点,我们结合了多种算法并使用不同的投票策略来确定最佳预测。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
An Integrated Framework for Friend Recommender System based on Graph Theoretic Approach Soccer Playing Robot Goal Scoring Algorithm Using Fuzzy Petri nets A Study of Machine Learning Algorithms on Email Spam Classification Pavement Crack Detection Using Convolutional Neural Network Active Rules in a Graph Database Environment
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1