| 一种改进的Markov链预测模型 |
| |
| 引用本文： | 闫永权.一种改进的Markov链预测模型[J].科学技术与工程,2007,7(19):5143-5145. |
| |
| 作者姓名： | 闫永权 |
| |
| 作者单位： | 山西金融职业学院,太原,030002 |
| |
| 摘 要： | 预取技术通过在用户浏览当前网页的时间内提前取回其将来最有可能请求的网页来减小实际感知的获取网页的时间。传统的Markov链模型是一种简单而有效的预测模型,但同时存在预测准确率偏低、存储复杂度偏高等缺点。提出了访问模式树(APT)算法,证明该法能有效减小存储空间。
|
| 关 键 词： | 预取 Markov模型 访问模式树 |
| 文章编号： | 1671-1819(2007)19-5143-03 |
| 修稿时间： | 2007-06-20 |
Improved Markov Chain Model of Navigation |
| |
| YAN Yong-quan.Improved Markov Chain Model of Navigation[J].Science Technology and Engineering,2007,7(19):5143-5145. |
| |
| Authors: | YAN Yong-quan |
| |
| Institution: | Shanxi Finance Professional College, Taiyuan 030002, P. R. China |
| |
| Abstract: | Prefetching can reduce the retrieval time perceived by users by predicting and fetching the most likely Web pages that are to be requested soon, while the user is browsing through the current displayed page.Markov chain is a simple and practical model , but it gives a little low prediction accuracy and requires a little high space complexity.Access Pattern Tree algorithm (APT)is proposed , finally, it demonstrates that the algorithm can reduce space. |
| |
| Keywords: | prefetching Markov model access pattern tree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《科学技术与工程》浏览原始摘要信息 |
| 点击此处可从《科学技术与工程》下载免费的PDF全文 |
