.png){kind=icon}
返回
Mining sequential patterns with periodic wildcard gaps
.png){kind=icon}
PRE
AI
DOI：10.1007/s10489-013-0499-4.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Mining frequent patterns with periodic wildcard gaps is a critical data mining problem to deal with complex real-world problems. This problem can be described as follows: given a subject sequence, a pre-specified threshold, and a variable gap-length with wildcards between each two consecutive letters. The task is to gain all frequent patterns with periodic wildcard gaps. State-of-the-art mining algorithms which use matrices or other linear data structures to solve the problem not only consume a large amount of memory but also run slowly. In this study, we use an Incomplete Nettree structure (the last layer of a Nettree which is an extension of a tree) of a sub-pattern P to efficiently create Incomplete Nettrees of all its super-patterns with prefix pattern P and compute the numbers of their supports in a one-way scan. We propose two new algorithms, MAPB (Mining sequentiAl Pattern using incomplete Nettree with Breadth first search) and MAPD (Mining sequentiAl Pattern using incomplete Nettree with Depth first search), to solve the problem effectively with low memory requirements. Furthermore, we design a heuristic algorithm MAPBOK (MAPB for tOp-K) based on MAPB to deal with the Top-K frequent patterns for each length. Experimental results on real-world biological data demonstrate the superiority of the proposed algorithms in running time and space consumption and also show that the pattern matching approach can be employed to mine special frequent patterns effectively.
Keyword:
Sequential pattern mining
Periodic wildcard gap
Pattern matching
Heuristic algorithm
Nettree
期刊
IF:
3.5
论文数:
7.6K
被引数:
1.7W
机构
引用论文
Lower Extremity Necrotizing Fasciitis in Diabetic and Nondiabetic Patients: Mortality and Amputation
PREAI
分享收藏
Mining interesting user behavior patterns in mobile commerce environments在移动商务环境中挖掘有趣的用户行为模式.png)
APPLIED INTELLIGENCE
APPLIED INTELLIGENCEIF3.5
PREAI
分享收藏STNR: A suffix tree based noise resilient algorithm for periodicity detection in time series databasesAPPLIED INTELLIGENCE
APPLIED INTELLIGENCEIF3.5
PREAI
分享收藏HUC-Prune: an efficient candidate pruning technique to mine high utility patternsAPPLIED INTELLIGENCE
APPLIED INTELLIGENCEIF3.5
PREAI
分享收藏Pattern matching with wildcards and gap-length constraints based on a centrality-degree graphAPPLIED INTELLIGENCE
APPLIED INTELLIGENCEIF3.5
PREAI
分享收藏
查看更多内容