基于马尔可夫链的Web访问序列挖掘算法

Data mining algorithm of web accessing sequence based on Markov's chain

对Web访问序列的数据挖掘有助于提高Web的访问质量,但序列是数据挖掘中一个比较困难的问题,经典序列算法普遍存在时间和存储空间开销过大的缺陷。提出了一种基于马尔可夫链的Web访问序列挖掘算法,可以通过较少的计算量发现请求网页的相关性。并将其用于某培训中心网站的设计,取得了良好的效果。

Data mining of web accessing sequence is benefit for improving quality of web accessing. But sequence is amore difficult question in data mining field, Classic sequence algorithms need too much time and memory in common. A data mining algorithm of web accessing sequence based on Markov＇s chain was proposed. This algorithm could get the dependence of asking for webpage through less calculation amount. It was used for design of one website of training center, and good result was made.