文献类型：期刊文献

中文题名：IM-FTS:一种快速增量式频繁访问序列挖掘算法

英文题名：IM-FTS:high-speed incremental algorithm for mining frequent traversal sequences

作者：彭慧丽[1];张啸剑[2];张亚东[2]

第一作者：彭慧丽

机构：[1]河南广播电视大学;[2]河南财经学院计算机科学系

第一机构：河南广播电视大学,郑州450008

年份：2009

卷号：45

期号：3

起止页码：138-140

中文期刊名：计算机工程与应用

外文期刊名：Computer Engineering and Applications

收录：CSTPCD;;北大核心:【北大核心2008】；CSCD:【CSCD2011_2012】；

语种：中文

中文关键词：双向约束;驻留时间;扩展格;频繁访问序列

外文关键词：bidirectional constraint ; dwell time; extended lattice; frequent traversal sequence

摘要：由于Web数据增长迅速,先前的频繁序列随着序列库的更新而改变。若重新挖掘频繁序列会增加处理时间和数据存储量。提出一种改进的扩展格结构IE-LATTICE,存储先前的挖掘结果,并在其基础上提出一种基于双向约束的增量挖掘算法IM-FTS,在利用先前结果和约束策略前提下,算法仅从插入和删除序列中发现新的频繁序列。分析和实验表明算法能有效缩减数据处理时间和存储空间。
Web data grows quickly in the short time,previous FTS may be changed when the sequence database is updated.Refinding FTS will consume too much execution time and storage space.In this paper,an improved extended lattice,IE-LATTICE is designed to store the previous mining results.An efficient algorithm based on bidirectional constraint,called IM-FTS is proposed, which utilizes the previous results and constraint strategy to discover the new FTS just from the added and deleted part of the database.The analysis and experiments show that IM-FTS algorithm efficiently reduces the average execution time and storage space for mining FTS.