| 基于三元互关联后继树的Web日志挖掘 |
| |
| 引用本文： | 张忠平,高一博.基于三元互关联后继树的Web日志挖掘[J].计算机应用与软件,2011(10). |
| |
| 作者姓名： | 张忠平 高一博 |
| |
| 作者单位： | 燕山大学信息科学与工程学院; |
| |
| 基金项目： | 国家自然科学基金(60773100); 河北省教育厅科研计划项目(2006143) |
| |
| 摘 要： | 针对二元的互关联后继树模型进行改进,构造三元互关联后继树,并结合Web日志的特点,构造Web事务集的互关联后继树和增量更新模型,设计基于三元互关联后继树的频繁路径挖掘算法,挖掘Web日志中的频繁路径。通过实验证明了基于三元互关联后继树和改进后的模型的出色插入查询性能。
|
| 关 键 词： | Web日志挖掘 Web事务 互关联后继树 频繁路径 |
WEB LOG MINING BASED ON TERNARY INTER-RELATED SUFFIX TREE |
| |
| Zhang Zhongping Gao Yibo.WEB LOG MINING BASED ON TERNARY INTER-RELATED SUFFIX TREE[J].Computer Applications and Software,2011(10). |
| |
| Authors: | Zhang Zhongping Gao Yibo |
| |
| Affiliation: | Zhang Zhongping Gao Yibo(College of Information Science and Engineering,Yanshan University,Qinhuangdao 066004,Hebei,China) |
| |
| Abstract: | In this paper we constructed a ternary inter-related suffix tree based on the improvement of binary inter-related suffix tree model,and constructed the inter-related suffix tree of web transactions and its incremental refreshing model in combination with the characteristics of Web logs,we also devised a frequent paths mining algorithm based on the ternary inter-related suffix tree to mine the frequent paths in Web logs.Through the experiments we demonstrated the superb performance of insertion query of the ... |
| |
| Keywords: | Web log mining Web transaction Inter-related suffix tree Frequent paths |
| 本文献已被 CNKI 等数据库收录！ |
