基于随机梯度下降的网页预取PPM预测模型

Zhijie Ban, Zhimin Gu, Yu Jin
{"title":"基于随机梯度下降的网页预取PPM预测模型","authors":"Zhijie Ban, Zhimin Gu, Yu Jin","doi":"10.1109/AINA.2008.19","DOIUrl":null,"url":null,"abstract":"PPM models are commonly used to predict the user's next request in Web prefetching by extracting useful knowledge from historical user requests. Any of features such as page access frequency, prediction feedback, context length and conditional probability can influence on the prefetching performance of PPM models. However, existing PPM models only consider one or a few of them. Based on stochastic gradient descent, we present a novel PPM model that takes into account all the above mentioned features. Our model defines a target function to describe a node's prediction capability, which is a linear combination of these features. In order to decrease the number of incorrect predictions, weights of these features are dynamically updated over every example according to the stochastic gradient descent rule. Our model selects a node with the maximum target function value among all matching nodes to predict the next most probable page. We use real web logs to examine proposed model. The simulation shows our model can significantly improve the prefetching performance.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"A PPM Prediction Model Based on Stochastic Gradient Descent for Web Prefetching\",\"authors\":\"Zhijie Ban, Zhimin Gu, Yu Jin\",\"doi\":\"10.1109/AINA.2008.19\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"PPM models are commonly used to predict the user's next request in Web prefetching by extracting useful knowledge from historical user requests. Any of features such as page access frequency, prediction feedback, context length and conditional probability can influence on the prefetching performance of PPM models. However, existing PPM models only consider one or a few of them. Based on stochastic gradient descent, we present a novel PPM model that takes into account all the above mentioned features. Our model defines a target function to describe a node's prediction capability, which is a linear combination of these features. In order to decrease the number of incorrect predictions, weights of these features are dynamically updated over every example according to the stochastic gradient descent rule. Our model selects a node with the maximum target function value among all matching nodes to predict the next most probable page. We use real web logs to examine proposed model. The simulation shows our model can significantly improve the prefetching performance.\",\"PeriodicalId\":328651,\"journal\":{\"name\":\"22nd International Conference on Advanced Information Networking and Applications (aina 2008)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-03-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"22nd International Conference on Advanced Information Networking and Applications (aina 2008)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AINA.2008.19\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AINA.2008.19","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

摘要

PPM模型通常用于通过从历史用户请求中提取有用的知识来预测Web预取中的用户下一个请求。页面访问频率、预测反馈、上下文长度和条件概率等任何特征都可能影响PPM模型的预取性能。然而,现有的PPM模型只考虑其中的一个或几个。基于随机梯度下降,我们提出了一个考虑上述所有特征的PPM模型。我们的模型定义了一个目标函数来描述节点的预测能力,它是这些特征的线性组合。为了减少错误预测的数量,根据随机梯度下降规则在每个样本上动态更新这些特征的权重。我们的模型在所有匹配节点中选择目标函数值最大的节点来预测下一个最可能的页面。我们使用真实的网络日志来检验所提出的模型。仿真结果表明,该模型能显著提高预取性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A PPM Prediction Model Based on Stochastic Gradient Descent for Web Prefetching
PPM models are commonly used to predict the user's next request in Web prefetching by extracting useful knowledge from historical user requests. Any of features such as page access frequency, prediction feedback, context length and conditional probability can influence on the prefetching performance of PPM models. However, existing PPM models only consider one or a few of them. Based on stochastic gradient descent, we present a novel PPM model that takes into account all the above mentioned features. Our model defines a target function to describe a node's prediction capability, which is a linear combination of these features. In order to decrease the number of incorrect predictions, weights of these features are dynamically updated over every example according to the stochastic gradient descent rule. Our model selects a node with the maximum target function value among all matching nodes to predict the next most probable page. We use real web logs to examine proposed model. The simulation shows our model can significantly improve the prefetching performance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信