| 基于频繁的Markov链预测模型 |
| |
| 引用本文： | 闫永权,张大方. 基于频繁的Markov链预测模型[J]. 计算机应用研究, 2007, 24(3): 41-43 |
| |
| 作者姓名： | 闫永权 张大方 |
| |
| 作者单位： | 湖南大学,软件学院,湖南,长沙,410082;湖南大学,软件学院,湖南,长沙,410082 |
| |
| 摘 要： | 预取技术通过在用户浏览当前网页的时间内提前取回其将来最有可能请求的网页来减少实际感知的获取网页的时间.传统的Markov链模型是一种简单而有效的预测模型,但同时存在预测准确率偏低,存储复杂度偏高等缺点.通过提出一种算法来减小存储空间,最后通过证明能有效减小存储空间.
|
| 关 键 词： | 预取 马尔可夫模型 频繁模式树 |
| 文章编号： | 1001-3695（2007）03-0041-03 |
| 修稿时间： | 2006-01-062006-05-20 |
Markov Chain Model of Navigation Based on Frequence |
| |
| YAN Yong quan,ZHANG Da fang. Markov Chain Model of Navigation Based on Frequence[J]. Application Research of Computers, 2007, 24(3): 41-43 |
| |
| Authors: | YAN Yong quan ZHANG Da fang |
| |
| Affiliation: | (Institute of Software, Hunan University, Changsha Hunan 410082, 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. An algorithm to reduce space was presented, finally, it demonstrated this algorithm can reduce space. |
| |
| Keywords: | prefetch markov model frequent pattern tree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用研究》浏览原始摘要信息 |
|
点击此处可从《计算机应用研究》下载全文 |
|
