详细信息
文献类型:期刊文献
中文题名:动态Web点击流中频繁访问序列的挖掘
英文题名:Mining of Frequent Traversal Sequences in Dynamic Web Clickstreams
作者:张啸剑[1];邵超[1];张亚东[1]
第一作者:张啸剑
机构:[1]河南财经学院信息学院
第一机构:河南财经政法大学计算机与信息工程学院
年份:2009
卷号:35
期号:14
起止页码:58-59
中文期刊名:计算机工程
外文期刊名:Computer Engineering
收录:CSTPCD;;Scopus;北大核心:【北大核心2008】;CSCD:【CSCD2011_2012】;
基金:河南省科技厅基金资助项目(082300410110)
语种:中文
中文关键词:频繁访问序列;加权调和平均数;调节因子
外文关键词:Frequent Traversal Sequence(FTS); Weighted Harmonic Average(WHA); regulatory factor
摘要:基于False-Positive方法挖掘Web点击流中的频繁访问序列时通过相关比率ρ控制其内存消耗和挖掘精度,两者之间会因ρ产生冲突。针对该问题提出一种基于False-Negative方法和时间敏感滑动窗的算法FTS-Stream,该算法利用2个边界参数约束ρ,采用2个边界的加权调和平均数替代ρ。实验证明该算法相对于同类方法有较好的性能。
When using false-positive approach to mine Frequent Traversal Sequence(FTS) in Web clickstreams, it utilizes relaxation ratio p to control memory consumption and precision of mining result. However, such approaches may lead to a conflict between precision and memory consumption because of using p. This paper proposes FfS-Stream algorithm based on false-negative approach and time-sensitive sliding window to solve the problem. FTS-Stream uses two bounds to constrain p, and adopts a Weighted Harmonic Average(WHA) of the two bounds to replace p. Experiments show that the algorithm performs better than many established FTS mining methods.
参考文献:
正在载入数据...