.png){kind=icon}
返回
A data mining algorithm for generalized web prefetching
.png){kind=icon}
PRE
AI
DOI：10.1109/TKDE.2003.1232270.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Predictive Web prefetching refers to the mechanism of deducing the forthcoming page accesses of a client based on its past accesses. In this paper, we present a new context for the interpretation of Web prefetching algorithms as Markov predictors. We identify the factors that affect the performance of Web prefetching algorithms. We propose a new algorithm called WMo, which is based on data mining and is proven to be a generalization of existing ones. It was designed to address their specific limitations and its characteristics include all the above factors. It compares favorably with previously proposed algorithms. Further, the algorithm efficiently addresses the increased number of candidates. We present a detailed performance evaluation of WMo with synthetic and real data. The experimental results show that WMo can provide significant improvements over previously proposed Web prefetching algorithms.
Keyword:
prefetching
prediction
Web mining
association rules
data mining
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.4
论文数:
6.8K
被引数:
3.2W
机构
暂无机构信息
引用论文
Integrated microRNA and mRNA Transcriptome Sequencing Reveals the Potential Roles of miRNAs in Stage I Endometrioid Endometrial Carcinoma.png)
PLoS ONE
OAAI
PLoS ONEIF0
OAAI分享收藏
查看更多内容