Fast discovery of frequent closed sequential patterns based on positional data

Guo Yan Huang*, Fei Yang, Chang Zhen Hu, Jia Dong Ren

*此作品的通讯作者

科研成果: 书/报告/会议事项章节会议稿件同行评审

5 引用 (Scopus)

摘要

Frequent closed sequential patterns mining is one of the hot topics in data mining. In this paper, a novel frequent closed sequential pattern mining algorithm, FCSM-PD (frequent closed sequential pattern mining algorithm based on positional data) is proposed, which is the improved BIDE algorithm based on the positional data. The positional data is used to reserve the position information of items in the algorithm, By storing all the position information of the prefix sequences in advance, the verifying about the existence of extension of position with a prefix sequence can be easily implemented by scanning the position information of the prefix sequence, rather than scanning the pseudo-projected database repeatedly in the BI-Directional Extension closure checking scheme, which is the most consumed time phase in the algorithm of BIDE. Meanwhile optimization strategy is applied to reduce the time and memory cost in the mining process. The experimental results show that FCSM-PD costs significantly lower running time than BIDE, especially in the intensive database.

源语言英语
主期刊名2010 International Conference on Machine Learning and Cybernetics, ICMLC 2010
444-449
页数6
DOI
出版状态已出版 - 2010
活动2010 International Conference on Machine Learning and Cybernetics, ICMLC 2010 - Qingdao, 中国
期限: 11 7月 201014 7月 2010

出版系列

姓名2010 International Conference on Machine Learning and Cybernetics, ICMLC 2010
1

会议

会议2010 International Conference on Machine Learning and Cybernetics, ICMLC 2010
国家/地区中国
Qingdao
时期11/07/1014/07/10

指纹

探究 'Fast discovery of frequent closed sequential patterns based on positional data' 的科研主题。它们共同构成独一无二的指纹。

引用此