QQ客服 官方微博 反馈留言

	Parallel sequential pattern mining by transaction decomposition
	Wang, Xueqiang ; Wang, Jing ; Wang, Tengjiao ; Li, Hongyan ; Yang, Dongqing
	2010
英文摘要	Sequential pattern mining is an important and useful tool with broad applications, such as analyzing customer purchase behavior, recommending services to customers, and so on. It is challenging since explosive number of subsequences need to be examined and both the memory and computational cost are becoming extremely expensive when the sequence database grows huge. Many previous algorithms developed for efficient mining of sequential patterns encounter problems to deal with large scale data. In this paper, we propose a parallel sequential pattern mining method, called PTDS (i.e., Parallel Transaction-Decomposed Sequential pattern mining), which decomposes transactions to mine sequential patterns. PTDS greatly accelerates pattern growth and improves the efficiency of parallel algorithm on large scale data. We experiment on a large dataset consisting of 16 million service purchase sequences. Besides scalability, the empirical comparisons show that PTDS consistently outperforms both the PrefixSpan-based parallel method and serial algorithm. ?2010 IEEE.; EI; 0
语种	英语
DOI标识	10.1109/FSKD.2010.5569404
内容类型	其他
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/295498]
专题	信息科学技术学院
推荐引用方式 GB/T 7714	Wang, Xueqiang,Wang, Jing,Wang, Tengjiao,et al. Parallel sequential pattern mining by transaction decomposition. 2010-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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