J4 ›› 2006, Vol. 28 ›› Issue (11): 79-80.
• 论文 • 上一篇 下一篇
杨文忠[1] 彭曙蓉[1,2] 章兢[1]
出版日期:
发布日期:
Online:
Published:
摘要:
对Web访问序列的数据挖掘有助于提高Web的访问质量,但序列是数据挖掘中一个比较困难的问题,经典序列算法普遍存在时间和存储空间开销过大的缺憾。本文提出了一种基于马尔可夫链的Web访问序列挖掘算法,可以通过较少的计算量发现请求网页的相关性。我们已将其用于某培训中心网站的设计,取得了良好的效果。
关键词: Web 数据挖掘 马尔可夫链 网站设计
Abstract:
Data mining of Web accessing sequence is conducive to improving the quality of Web access. But in fact, sequence is one of the difficult issues in thedata mining field. CIassic sequence algorithms need too much time and memory in common. So in this paper a data mining algorithm of Web access sequence based on Markov's chain is proposed. This algorithm can get the dependence of asking for webpage through less calculation amount. We have used it in t the design of the website of a training center, and have made good effect.
Key words: (Web;data mining;Markov's chaimWebsite design)
杨文忠[1] 彭曙蓉[1,2] 章兢[1]. 一种Web访问序列挖掘算法在网站设计中的应用研究[J]. J4, 2006, 28(11): 79-80.
0 / / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://joces.nudt.edu.cn/CN/
http://joces.nudt.edu.cn/CN/Y2006/V28/I11/79