Computer Science – Databases
Scientific paper
2009-06-04
The 5th International Conference on Advanced Data Mining and Applications (ADMA2009)
Computer Science
Databases
19 pages, 7 figures
Scientific paper
Mining frequent sequential patterns from sequence databases has been a central research topic in data mining and various efficient mining sequential patterns algorithms have been proposed and studied. Recently, in many problem domains (e.g, program execution traces), a novel sequential pattern mining research, called mining repetitive gapped sequential patterns, has attracted the attention of many researchers, considering not only the repetition of sequential pattern in different sequences but also the repetition within a sequence is more meaningful than the general sequential pattern mining which only captures occurrences in different sequences. However, the number of repetitive gapped sequential patterns generated by even these closed mining algorithms may be too large to understand for users, especially when support threshold is low. In this paper, we propose and study the problem of compressing repetitive gapped sequential patterns. Inspired by the ideas of summarizing frequent itemsets, RPglobal, we develop an algorithm, CRGSgrow (Compressing Repetitive Gapped Sequential pattern grow), including an efficient pruning strategy, SyncScan, and an efficient representative pattern checking scheme, -dominate sequential pattern checking. The CRGSgrow is a two-step approach: in the first step, we obtain all closed repetitive sequential patterns as the candidate set of representative repetitive sequential patterns, and at the same time get the most of representative repetitive sequential patterns; in the second step, we only spend a little time in finding the remaining the representative patterns from the candidate set. An empirical study with both real and synthetic data sets clearly shows that the CRGSgrow has good performance.
Ma Shilong
Tong Yongxin
Xu Ke
Yu Dan
Zhao Li
No associations
LandOfFree
Mining Compressed Repetitive Gapped Sequential Patterns Efficiently does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Mining Compressed Repetitive Gapped Sequential Patterns Efficiently, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Mining Compressed Repetitive Gapped Sequential Patterns Efficiently will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-494562