高效的用户访问预测新算法

冯少荣; 张东站

您当前的位置：

首页 >

文章列表页 >

高效的用户访问预测新算法

更新时间：2025-07-09

- 高效的用户访问预测新算法
- Two New Efficient Algorithms to User Access Prediction
- 西安交通大学学报 2010年44卷第4期页码：28-33
- 作者机构：
  
  厦门大学信息科学与技术学院,福建,厦门,361005
- 作者简介：
- 基金信息：
  
  : 2009-09-07. 作者简介: 冯少荣(1964-), 男, 博士, 副教授. 基金项目: 国家自然科学基金资助项目(50604012)
- DOI：
  中图分类号： TP311
- 网络首发：2010-04-10，
  
  纸质出版：2010
- 稿件说明：
移动端阅览
冯少荣, 张东站. 高效的用户访问预测新算法[J]. 西安交通大学学报, 2010,44(4):28-33.

Two New Efficient Algorithms to User Access Prediction[J]. 2010, 44(4): 28-33.
冯少荣, 张东站. 高效的用户访问预测新算法[J]. 西安交通大学学报, 2010,44(4):28-33. DOI：

Two New Efficient Algorithms to User Access Prediction[J]. 2010, 44(4): 28-33. DOI：

摘要

针对基于Web日志挖掘的用户访问预测经典算法的不足

提出了基于Markov链和关联规则的预测算法(MAPA).使用二阶Markov链找到用户下一步或将来可能访问的页面集

生成预测候选集; 使用二项关联规则从正向和反向2个角度修正Markov的预测结果

从而生成最后的预测页面. 通过引入用户反馈机制

提出了带反馈的Markov预测算法(MPAF)

即在预测过程中逐步构造历史预测树

把历史预测信息保存到历史预测树中

并根据用户的反馈来判断预测的正确性.在预测过程中

用二阶Markov预测算法生成预测候选集

再利用历史预测信息动态地调整预测算法

从而生成预测页面.理论分析证明

这2种预测算法具有线性时间复杂度的预测效率.实验结果表明

MAPA和MPAF在预测准确率上平均提高5%和10%.

Abstract

A Markov chain and association rule prediction algorithm(MAPA)is proposed to deal with shortcomings of existing algorithms on user access prediction based on web log mining. The algorithm uses the second-order Markov chain to find the pages which users may visit in either the next step or future

so as to generate the candidate prediction page set. Then the two-item association rules are used to correct the prediction result from the forward and the reverse perspectives to get the last prediction page. The algorithm integrates the advantages of both the Markov chain and the association rule well. A Markov prediction algorithm with feedback(MPAF)is proposed by introducing user feedback mechanism. The algorithm creates a history prediction tree(HPT)step by step during the prediction process

saves the history prediction information into HPT

and determines whether the prediction is correct according the user's feedback. The algorithm generates the candidate prediction page set using the second order Markov prediction algorithm at first

and then the last prediction page is generated by dynamically adjusting the prediction algorithm according the historical prediction information. Theoretical analyses show that both the prediction algorithms have linear time complexity. Experimental results show that the average prediction accuracy of MAPA and MPAF is increased by 5% and 10%

respectively.

关键词

Keywords

references

GÉRY M, HADDAD H. Evaluation of web usage mining approaches for user's next request prediction[C]∥Proceedings of the 5th ACM International Workshop on Web Information and Data Management. New York, USA: ACM, 2003: 74-81.

ZHANG Zhili, SHI Lei, GUO Shen, et al. Appling association rule to Web prediction [C]∥Proceedings of the 1st International Multi-Symposiums on Computer and Computational Sciences. Los Alamitos, CA, USA: IEEE Computer Society, 2006: 522-527.

ZUKERMAN I, ALBRECHT D W, NICHOLSON A E. Predicting user's requests on the WWW[C]∥Proceedings of the 7th International Conference on User Modeling. Berlin, Germany:Springer, 1999: 275-284.

刑永康, 马少平. 多Markov链用户浏览预测模型[J]. 计算机学报, 2003, 26(11): 1510-1517.

XING Yongkang, MA Shaoping. Modeling user navigation sequences based on multi-Markov chains[J]. Chinese Journal of Computers, 2003, 26(11): 1510-1517.

GÜNDÜZ S, ÖZSU M T. A web page prediction model based on click-stream tree representation of user behavior [C]∥Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York, USA: ACM, 2003: 535-540.

ÖGˇÜDÜCÜ S G,ÖZSU M T. Incremental click-stream tree model: learning from new users for web page prediction [J]. Distributed and Parallel Databases, 2006, 19(1): 5-27.

HUANG Yinfu, HSU J M. Mining web logs to improve hit ratios of prefetching and caching[J]. Knowledge-Based Systems, 2008, 21(1): 62-69.

SUTHEERA P, HIDEKAZU T. Mining web logs for a personalized recommender system[J]. Joho Shori Gakkai Zenkoku Taikai Koen Ronbunshu, 2005, 67(3): 19-20.

LIU Haibin, KEELJ V. Combined mining of web server logs and web contents for classifying user navigation patterns and predicting users' future requests[J]. Data Knowledge Engineering, 2007, 61(2): 304-330.

浏览量

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

采用SHAP的高压涡轮级高维设计空间数据挖掘

提取有效规则的关联分类算法

采用类别相似度聚合的关联文本分类方法

基于免疫记忆克隆的特征选择

一种应用关联规则森林的改进贝叶斯分类算法