Sciweavers

95 search results - page 1 / 19
» Efficient Enumeration of Frequent Sequences
Sort
View
CIKM
1998
Springer
13 years 8 months ago
Efficient Enumeration of Frequent Sequences
In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex has...
Mohammed Javeed Zaki
DAWAK
2004
Springer
13 years 8 months ago
PROWL: An Efficient Frequent continuity Mining Algorithm on Event Sequences
Mining association rule in event sequences is an important data mining problem with many applications. Most of previous studies on association rules are on mining intra-transaction...
Kuo-Yu Huang, Chia-Hui Chang, Kuo-Zui Lin
DIS
2004
Springer
13 years 8 months ago
An Efficient Algorithm for Enumerating Closed Patterns in Transaction Databases
: The class of closed patterns is a well known condensed representations of frequent patterns, and have recently attracted considerable interest. In this paper, we propose an effic...
Takeaki Uno, Tatsuya Asai, Yuzo Uchida, Hiroki Ari...
ICDE
2004
IEEE
116views Database» more  ICDE 2004»
14 years 5 months ago
An Efficient Algorithm for Mining Frequent Sequences by a New Strategy without Support Counting
Mining sequential patterns in large databases is an important research topic. The main challenge of mining sequential patterns is the high processing cost due to the large amount ...
Ding-Ying Chiu, Yi-Hung Wu, Arbee L. P. Chen
IS
2008
13 years 4 months ago
Efficient mining of frequent episodes from complex sequences
Discovering patterns with highly significance is an important problem in data mining discipline. An episode is defined to be a partially ordered set of events for a consecutive an...
Kuo-Yu Huang, Chia-Hui Chang