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

基于MFP方法的Web用户访问模式的模式发现
引用本文:吕橙,魏楚元,张瀚韬. 基于MFP方法的Web用户访问模式的模式发现[J]. 计算机应用, 2007, 27(3): 565-569
作者姓名:吕橙  魏楚元  张瀚韬
作者单位:北京建筑工程学院北京建筑工程学院北京建筑工程学院
基金项目:北京市教委科技发展计划项目
摘    要:针对Web用户访问模式问题,采用最大频繁访问路径(MFP)方法可以挖掘出更有普遍意义的模式。给出一种新的用户访问模式树WUAP tree结构,并采用E OEM模型,综合考虑了页面拓扑结构及用户浏览路径等多个数据源,进一步提出了一种Web访问模式挖掘算法WUAP mine。该算法不用产生候选集和递归,只对事务数据库进行一次扫描,对WUAP tree结构进行深度优先遍历一次,就可从WUAP tree结构上直接查询出Web用户频繁访问模式。最后,从理论和实践上推导和验证了它的有效性和高效性。

关 键 词:用户访问模式   最大频繁访问路径方法   点击流
文章编号:1001-9081(2007)03-0565-05
收稿时间:2006-09-04
修稿时间:2006-09-01

Pattern discovering of Web user access pattern based on maximal frequent path method
Lü Cheng,WEI Chu-yuan,ZHANG Han-tao. Pattern discovering of Web user access pattern based on maximal frequent path method[J]. Journal of Computer Applications, 2007, 27(3): 565-569
Authors:Lü Cheng  WEI Chu-yuan  ZHANG Han-tao
Affiliation:Department of Computer Science and Technology, Beijing Institute of Civil Engineering and Architecture, Beijing 100044, China
Abstract:As far as the issue on Web user access pattern is concerned, adopting Maximal Frequent Path (MFP) can mine more universal patterns. A new user access pattern tree named WUAP-tree was devised. Furthermore, a new algorithm named WUAP-mine was proposed for mining user access patterns, which was based on E-OEM model for page topological structure and users' browse path. The algorithm utilized WUAP-tree that could neither generate candidate sets nor use recursive ways. It could mine frequent Web users' access patterns by scanning transaction database and output-depth-first traversing WUAP-tree only once. The algorithm is very easy to query Web user access patterns from WUAP-tree directly. At last, theoretical analysis and experimental results prove its effectiveness and efficiency.
Keywords:Web user access pattern  Maximal Frequent Path (MFP) method  click-stream
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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