首页 | 本学科首页   官方微博 | 高级检索  
     

基于协同过滤的Web缓存替换算法研究
引用本文:吴俊龙,杨清.基于协同过滤的Web缓存替换算法研究[J].计算机工程与科学,2015,37(11):2128-2133.
作者姓名:吴俊龙  杨清
作者单位:;1.湖南科技大学计算机科学与工程学院
基金项目:湖南省科技计划资助项目(2013FJ4050)
摘    要:针对GDSF替换算法中对访问频率缺少预测的不足,提出了一种基于协同过滤的GDSF缓存替换算法(GDSF-CF)。该算法考虑了Web对象之间相似性与用户访问时间间隔,运用协同过滤算法生成Web对象的预测访问频率,并采用齐普夫定律参数对GDSF算法的目标函数进行了改进。当需要进行缓存替换时,利用目标函数价值计算缓存空间中的每个Web对象缓存价值,将最小缓存价值的Web对象进行替换。仿真实验结果表明,该算法的命中率HR和字节命中率BHR都有较大提升。

关 键 词:Web缓存  协同过滤  替换算法
收稿时间:2014-12-20
修稿时间:2015-11-25

A web cache replacement algorithm based on collaborative filtering
WU Jun long,YANG Qing.A web cache replacement algorithm based on collaborative filtering[J].Computer Engineering & Science,2015,37(11):2128-2133.
Authors:WU Jun long  YANG Qing
Affiliation:(School of Computer Science and Engineering,Hunan University of Science and Technology,Xiangtan 411201,China)
Abstract:To address the shortcoming that the GDSF replacement algorithm cannot predict visit frequency, we propose a collaborative filtering based GDSF web cache replacement algorithm (GDSF CF). Considering the similarities among web objects and the time interval of users’ visits, we use the collaborative filtering technology to generate the predicted visit frequency of each web object, and adopts Zipf like parameters to modify the objective functions of the GDSF algorithm. When cache replacement is performed, the value of the objective functions are used to calculate the caching value of each web object, and the web object with the minimum value will be replaced in the first place. Simulation experiments show that the GDSF-CF algorithm has a higher hit rate and byte hit rate.
Keywords:Web cache  collaborative filtering  replacement algorithm  
本文献已被 万方数据 等数据库收录!
点击此处可从《计算机工程与科学》浏览原始摘要信息
点击此处可从《计算机工程与科学》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号