| 基于访问路径树的Web频繁访问路径挖掘算法研究 |
| |
| 引用本文： | 战立强,刘大昕. 基于访问路径树的Web频繁访问路径挖掘算法研究[J]. 计算机应用研究, 2005, 22(1): 96-98 |
| |
| 作者姓名： | 战立强 刘大昕 |
| |
| 作者单位： | 东北林业大学,经济管理学院,黑龙江,哈尔滨,150040;哈尔滨工程大学,计算机学院,黑龙江,哈尔滨,150001 |
| |
| 摘 要： | 频繁访问路径发现是Web数据挖掘的重要研究内容。提出了一种挖掘连续频繁访问路径的高效算法：PS2算法，该算法利用访问路径树挖掘频繁扩展子路径，只需一次数据库扫描，试验表明该算法在效率上优于类Apriori的算法。
|
| 关 键 词： | 频繁访问路径 访问路径树 扩展子路径 |
| 文章编号： | 1001-3695(2005)01-0096-03 |
| 修稿时间： | 2003-11-03 |
Research on Algorithm of Frequent Web Access Path Mining-Based on Access Path Tree |
| |
| ZHAN Li-qiang,LIU Da-xin. Research on Algorithm of Frequent Web Access Path Mining-Based on Access Path Tree[J]. Application Research of Computers, 2005, 22(1): 96-98 |
| |
| Authors: | ZHAN Li-qiang LIU Da-xin |
| |
| Affiliation: | (1.School of Economic & Management,Northeast Forestry University,Harbin Heilongjiang 150040,China; 2.School of Computer Science,Harbin Engineering University,Harbin Heilongjiang 150001,China) |
| |
| Abstract: | The frequent access paths discovery is an important task of Web mining study. Proposes a new efficient algorithm for mining consecutive frequent We baccess path, thealgorithmuseaccesspathtreetofindfrequentWebaccesspathandneed database scanning only once. The experiment shows that the algorithm is better than other algorithms which is based on Apriori algorithm. |
| |
| Keywords: | Frequent Access Path Access Path Tree Span-Subpath |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用研究》浏览原始摘要信息 |
|
点击此处可从《计算机应用研究》下载全文 |
|
