QQ客服 官方微博 反馈留言

	IMCS: Incremental mining of closed sequential patterns
	Chang, Lei ; Yang, Dongqing ; Wang, Tengjiao ; Tang, Shiwei
	2007
英文摘要	Recently, mining compact frequent patterns (for example closed patterns and compressed patterns) has received much attention from data mining researchers. These studies try to address the interpretability and efficiency problems encountered by traditional frequent pattern mining methods. However, to the best of our knowledge, how to efficiently mine compact sequential patterns in a dynamic sequence database environment has not been explored yet. In this paper, we examine the problem how to mine closed sequential patterns incrementally. A compact structure CSTree is designed to keep the closed sequential patterns, and an efficient algorithm IMCS is developed to maintain the CSTree when the sequence database is updated incrementally. A thorough experimental study shows that IMCS outperforms the state-of-the-art algorithms - PrefixSpan, CloSpan, BIDE and a recently proposed incremental mining algorithm IncSpan by about a factor of 4 to more than an order of magnitude.; Computer Science, Information Systems; Computer Science, Theory & Methods; EI; CPCI-S(ISTP); 0
语种	英语
内容类型	其他
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/293292]
专题	信息科学技术学院
推荐引用方式 GB/T 7714	Chang, Lei,Yang, Dongqing,Wang, Tengjiao,et al. IMCS: Incremental mining of closed sequential patterns. 2007-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。