| 一种在连续MFR中快速挖掘频繁访问路径的新算法 |
| |
| 引用本文： | 战立强,刘大昕. 一种在连续MFR中快速挖掘频繁访问路径的新算法[J]. 计算机工程与应用, 2005, 41(9): 180-181,209 |
| |
| 作者姓名： | 战立强 刘大昕 |
| |
| 作者单位： | 东北林业大学经济管理学院,哈尔滨,150040;哈尔滨工程大学计算机学院,哈尔滨,150001 |
| |
| 摘 要： | 频繁访问路径挖掘是Web数据挖掘的重要研究内容。论文主要研究在最大前向引用中发现连续频繁访问路径的问题,提出了一种快速有效的CAP算法,该算法借助于访问路径树进行挖掘,只需一次扫描数据库,且简化了对访问路径树的挖掘过程,试验表明在执行效率上明显优于WAP算法。
|
| 关 键 词： | 最大前向引用 频繁访问路径 访问路径树 |
| 文章编号： | 1002-8331-(2005)09-0180-02 |
A New Algorithm for Mining Frequent Access Paths from MFR |
| |
| Zhan Liqiang,Liu Daxin. A New Algorithm for Mining Frequent Access Paths from MFR[J]. Computer Engineering and Applications, 2005, 41(9): 180-181,209 |
| |
| Authors: | Zhan Liqiang Liu Daxin |
| |
| Affiliation: | Zhan Liqiang1 Liu Daxin21 |
| |
| Abstract: | The frequent access paths discovery is an important task of Web mining study.The article focus on how to discover the frequent access paths from the Maximal Forward References,and proposes a new fast algorithm named CAP.By using access path tree,the CAP algorithm mining frequent access path without yielding of large amount of candidate sets,and repeated scanning over database is also avoided.The CAP algorithm needs only one pass scanning over database.The experiment indicates that the CAP algorithm is better than WAP algorithm. |
| |
| Keywords: | Maximal Forward Reference frequent access path WAP-tree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
