Sciweavers

95 search results - page 2 / 19
» Efficient Enumeration of Frequent Sequences
Sort
View
ICDE
2004
IEEE
155views Database» more  ICDE 2004»
14 years 7 months ago
BIDE: Efficient Mining of Frequent Closed Sequences
Previous studies have presented convincing arguments that a frequent pattern mining algorithm should not mine all frequent patterns but only the closed ones because the latter lea...
Jianyong Wang, Jiawei Han
WWW
2008
ACM
14 years 6 months ago
Efficient mining of frequent sequence generators
Sequential pattern mining has raised great interest in data mining research field in recent years. However, to our best knowledge, no existing work studies the problem of frequent...
Chuancong Gao, Jianyong Wang, Yukai He, Lizhu Zhou
IDEAS
2007
IEEE
138views Database» more  IDEAS 2007»
13 years 12 months ago
On Transversal Hypergraph Enumeration in Mining Sequential Patterns
The transversal hypergraph enumeration based algorithms can be efficient in mining frequent itemsets, however it is difficult to apply them to sequence mining problems. In this ...
Dong (Haoyuan) Li, Anne Laurent, Maguelonne Teisse...
APWEB
2006
Springer
13 years 9 months ago
Efficient Mining Strategy for Frequent Serial Episodes in Temporal Database
Discovering patterns with great significance is an important problem in data mining discipline. A serial episode is defined to be a partially ordered set of events for consecutive ...
Kuo-Yu Huang, Chia-Hui Chang
GFKL
2007
Springer
184views Data Mining» more  GFKL 2007»
13 years 9 months ago
FSMTree: An Efficient Algorithm for Mining Frequent Temporal Patterns
Research in the field of knowledge discovery from temporal data recently focused on a new type of data: interval sequences. In contrast to event sequences interval sequences contai...
Steffen Kempe, Jochen Hipp, Rudolf Kruse