2006
DOI: 10.1007/11823728_27
|View full text |Cite
|
Sign up to set email alerts
|

COBRA: Closed Sequential Pattern Mining Using Bi-phase Reduction Approach

Abstract: Abstract. In this work, we study the problem of closed sequential pattern mining. We propose a novel approach which extends a frequent sequence with closed itemsets instead of single items. The motivation is that closed sequential patterns are composed of only closed itemsets. Hence, unnecessary item extensions which generates non-closed sequential patterns can be avoided. Experimental evaluation shows that the proposed approach is two orders of magnitude faster than previous works with a modest memory cost.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
14
0

Year Published

2009
2009
2021
2021

Publication Types

Select...
7
2
1

Relationship

0
10

Authors

Journals

citations
Cited by 16 publications
(14 citation statements)
references
References 11 publications
0
14
0
Order By: Relevance
“…Huang et al [8] proposed the COBRA algorithm. It extends a frequent sequence with closed itemsets instead of single items.…”
Section: Cobramentioning
confidence: 99%
“…Huang et al [8] proposed the COBRA algorithm. It extends a frequent sequence with closed itemsets instead of single items.…”
Section: Cobramentioning
confidence: 99%
“…COBRA by Huang et al [19] uses several pruning techniques while traversing the prefixtree. The authors show that a closed sequence has only closed itemsets as elements.…”
Section: Sequence Miningmentioning
confidence: 99%
“…The COBRA algorithm was developed by Huang et al [14]. It adopts a bi-phase reduction method for closed sequential pattern mining.…”
Section: Related Workmentioning
confidence: 99%