| 基于马尔可夫链的Web访问序列挖掘算法 |
| |
| 引用本文： | 彭曙蓉,王耀南,杨文忠.基于马尔可夫链的Web访问序列挖掘算法[J].计算机工程与设计,2006,27(2):332-334. |
| |
| 作者姓名： | 彭曙蓉 王耀南 杨文忠 |
| |
| 作者单位： | 1. 长沙理工大学,电气与信息工程学院,湖南,长沙,410082;湖南大学,电气与信息工程学院,湖南,长沙,410082
2. 湖南大学,电气与信息工程学院,湖南,长沙,410082 |
| |
| 摘 要： | Web问序列的数据挖掘有助于提高Web的访问质量，但序列是数据挖掘中一个比较困难的问题，经典序列算法普遍存在时间和存储空间开销过大的缺陷。提出了一种基于马尔可夫链的Web访问序列挖掘算法，可以通过较少的计算量发现请求网页的相关性。并将其用于某培训中心网站的设计，取得了良好的效果。
|
| 关 键 词： | 数据挖掘 马尔可夫链 网站设计 |
| 文章编号： | 1000-7024（2006）02-0332-03 |
| 收稿时间： | 2005-03-23 |
| 修稿时间： | 2005-03-23 |
Data mining algorithm of web accessing sequence based on Markov's chain |
| |
| PENG Shu-rong,WANG Yao-nan,YANG Wen-zhong.Data mining algorithm of web accessing sequence based on Markov''''s chain[J].Computer Engineering and Design,2006,27(2):332-334. |
| |
| Authors: | PENG Shu-rong WANG Yao-nan YANG Wen-zhong |
| |
| Affiliation: | 1. College of Electric and Information Engineering, Changsha University of Science and Technology, Changsha 410082, China; 2. College of Electric and Information Engineering, Hunan University, Changsha 410082, China |
| |
| Abstract: | 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. |
| |
| Keywords: | Web |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
