首页> 外文期刊>Journal of software >A Web Log Frequent Sequential Pattern Mining Algorithm Linked WAP-Tree
【24h】

A Web Log Frequent Sequential Pattern Mining Algorithm Linked WAP-Tree

机译:链接WAP树的Web日志频繁顺序模式挖掘算法

获取原文
       

摘要

Web log frequent sequence pattern mining is an important field of Web log mining and of discovering interactive frequent sequence pattern between users and websites. It is easy to analyse users’ access sequence patterns by utilizing these sequence patterns and it is meaningful to build an intelligent website by mining Web log frequent sequential patterns. The PREWAP algorithm proposed in the paper makes full use of creating descendant of new node while constructing its WAP-tree and results in the serial number of pre-visiting while constructing its header table to judge the relationship of all nodes. The experiments show that mining web log using the PREWAP algorithm is much more efficient than using the current PLWAP, NGCWAP and WAP algorithms, especially on memory consumption.
机译:Web日志频繁序列模式挖掘是Web日志挖掘以及发现用户与网站之间的交互频繁序列模式的重要领域。利用这些顺序模式来分析用户的访问顺序模式很容易,并且通过挖掘Web日志频繁的顺序模式来构建智能网站也很有意义。本文提出的PREWAP算法在构造WAP树时充分利用了创建新节点的后代,并在构造其表头表以判断所有节点之间的关系时产生了预访问的序列号。实验表明,使用PREWAP算法挖掘Web日志比使用当前PLWAP,NGCWAP和WAP算法更有效,特别是在内存消耗方面。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号