DELISP: Efficient Discovery of Generalized Sequential Patterns by Delimited Pattern-Growth Technology

Lin, Ming-Yen; Lee, Suh-Yin; Wang, Sheng‐Shun

doi:10.1007/3-540-47887-6_19

Cited by 9 publications

(8 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In real life applications, one needs to extract sequential patterns under specific time constraints like Time-windows, minimum and maximum gap between consecutive transactions of a sequence. Such constraints have been introduced in [10], but very little work has been done in this field [10,7,12,6,8]. We are currently investigating on incorporating time constraints into bitSPADE.…”

Section: Resultsmentioning

confidence: 96%

See 1 more Smart Citation

bitSPADE: A Lattice-based Sequential Pattern Mining Algorithm Using Bitmap Representation

Aseervatham

Osmani

Viennet

2006

Sixth International Conference on Data Mining (ICDM'06)

View full text Add to dashboard Cite

Sequential pattern mining allows to discover temporal relationship between items within a database. The patterns can then be used to generate association rules. When the databases are very large, the execution speed and the memory usage of the mining algorithm become critical parameters. Previous research has focused on either one of the two parameters. In this paper, we present bitSPADE, a novel algorithm that combines the best features of SPAM, one of the fastest algorithm, and SPADE, one of the most memory efficient algorithm. Moreover, we introduce a new pruning strategy that enables bitSPADE to reach high performances. Experimental evaluations showed that bitSPADE ensures an efficient tradeoff between speed and memory usage by outperforming SPADE by both speed and memory usage factors more than 3.4 and SPAM by a memory consumption factor up to more than an order of magnitude.

show abstract

Section: Resultsmentioning

confidence: 96%

“…Many other algorithms have adopted this approach [7,11,2,5,8]. The other approach is the pattern growth method [3,9,6,4]. This method recursively grows patterns by performing database projection according to the frequent items.…”

Section: Related Workmentioning

confidence: 99%

bitSPADE: A Lattice-based Sequential Pattern Mining Algorithm Using Bitmap Representation

Aseervatham

Osmani

Viennet

2006

Sixth International Conference on Data Mining (ICDM'06)

View full text Add to dashboard Cite

show abstract

“…Such constraints have been introuced in [11], but very little work has been done in this field [9,6,11,5,7]. We are currently investigating on incorporating time constraints into dSpade.…”

Section: Resultsmentioning

confidence: 99%

Mining Sequential Patterns in Dense Databases

Gouda¹,

Hassaan²

2011

IJDMS

View full text Add to dashboard Cite

show abstract

“…For example, if max-gap = 30, min-gap = 0, and window-size = 7, a sequential pattern h(a, b), (c, d)i means that items a and b were purchased within 7 days of each other, items c and d also were purchased within 7 days of each other, and the time-interval between itemsets (a, b) and (c, d) is more than 7 days but within 30 days. Other researchers followed this concept and proposed more efficient algorithms [3,22,24,25]. Joshi et al [18] presented a universal formulation of sequential patterns, which unifies and generalizes most previous studies in generalized sequential pattern mining.…”

Section: Related Workmentioning

confidence: 98%