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

TOP-N选择Markov预测模型
引用本文:韩真,曹新平. TOP-N选择Markov预测模型[J]. 计算机应用, 2005, 25(3): 670-672. DOI: 10.3724/SP.J.1087.2005.0670
作者姓名:韩真  曹新平
作者单位:北京理工大学,计算机科学工程系,北京,100081;北京理工大学,计算机科学工程系,北京,100081
摘    要:分析了访问用户和浏览器的行为,研究了现存的Markov预取模型,并分析了Markov预测模型的本质,在此基础上,提出了基于TOP N选择的Markov预测模型。该模型利用Web访问日志中请求次数大于N的URL生成TOP N,根据用户的访问会话生成Markov链。如果用户当前的访问会话与Markov链匹配,该Markov的下一URL在TOP N中,就把它取到本地缓存。实验表明,该预测模型能有效提高预测精度和命中率,在一定程度上还减少了带宽的需求。

关 键 词:数据挖掘  Markov  预测  预取  TOP-N
文章编号:1001-9081(2005)03-0670-03

TOP-N selective Markov prediction model
HAN Zhen,CAO Xin-ping. TOP-N selective Markov prediction model[J]. Journal of Computer Applications, 2005, 25(3): 670-672. DOI: 10.3724/SP.J.1087.2005.0670
Authors:HAN Zhen  CAO Xin-ping
Affiliation:Department of Computer Science and Engineering, Beijing Institute of Technology
Abstract:After analyzing the behavior of accessed users, browsers and existing Markov prediction models, a TOP-N selective Markov model was presented to predict user next requests. The TOP-N consisted of URLs which requested time was over N in Web logs. The Markov chains were made up of user visit sessions. If the session which user visited currently matched one of the Markov chains, the next URL of this Markov chains in TOP-N would be prefetched in local cache. The experiment results show that this model can achieve dramatic improvement on predictive accuracy and get a good hit ratio with reducing the traffic load to some extent.
Keywords:data mining  Markov  predict  prefetch  TOP-N
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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