欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
针对二元的互关联后继树模型进行改进,构造三元互关联后继树,并结合Web日志的特点,构造Web事务集的互关联后继树和增量更新模型,设计基于三元互关联后继树的频繁路径挖掘算法,挖掘Web日志中的频繁路径。通过实验证明了基于三元互关联后继树和改进后的模型的出色插入查询性能。
英文摘要：
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 improved model which is based on the ternary inter-related suffix tree.
同期刊论文项目
同项目期刊论文
期刊信息
位置：