.png){kind=icon}
Return
Mining sequential rules with itemset constraints
.png){kind=icon}
PRE
AI
DOI：10.1007/s10489-020-02153-w.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Mining sequential rules from a sequence database usually returns a set of rules with great cardinality. However, in real world applications, the end-users are often interested in a subset of sequential rules. Particularly, they may consider only rules that contain a specific set of items. The naive strategy is to apply such itemset constraints into the post-processing step. However, such approaches require much effort and time. This paper proposes the effective methods for integrating itemset constraints into the actual mining process. We proposed two algorithms, namely MSRIC-R and MSRIC-P, to solve this problem in which MSRIC-R pushed the constraints into the rule generating phase, and MSRIC-P pushes into the pattern mining phase. Experiments show that the proposed algorithms outperform the post-processing approach.
Keywords:
Sequential rules
Itemset constraint
Sequential patterns
Prefix-tree
Sequence database
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.5
Papers:
7.6K
Citations:
1.7W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
View more