【24h】

Mining Interest Association Rules in Website Based on Hidden Markov Model

机译:基于隐马尔可夫模型的网站兴趣关联规则挖掘

获取原文

摘要

Generally, a user will access a website with a certain interest. Mining web users' interest access patterns has been an important research direction in web usage mining. These patterns are a kind of the special interest association rules essentially. In this paper, we propose a new approach for mining such rules based on Hidden Markov Model (HMM). In our approach, pages' contents and web server's log need to be preprocessed firstly. Next we present some definitions of users' access interest in a website. In addition, a new incremental algorithm Hmm_R is given to discover the interest association rules. Finally, we report on experiments conducted with simulative and real data and then testify that the algorithm can find all interest association rules efficiently.
机译:通常,用户会以一定的兴趣访问网站。挖掘Web用户的兴趣访问模式已经成为Web使用率挖掘的重要研究方向。这些模式本质上是一种特殊的利益关联规则。在本文中,我们提出了一种基于隐马尔可夫模型(HMM)的挖掘此类规则的新方法。在我们的方法中,页面的内容和Web服务器的日志需要首​​先进行预处理。接下来,我们介绍用户对网站访问兴趣的一些定义。另外,给出了一种新的增量算法Hmm_R来发现兴趣关联规则。最后,我们报告了使用模拟和真实数据进行的实验,然后证明该算法可以有效地找到所有兴趣关联规则。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号