Sciweavers

27 search results - page 2 / 6
» Mining Closed Episodes from Event Sequences Efficiently
Sort
View
DIS
2006
Springer
13 years 9 months ago
Mining Sectorial Episodes from Event Sequences
In this paper, we introduce a sectorial episode of the form C r, where C is a set of events and r is an event. The sectorial episode C r means that every event of C is followed b...
Takashi Katoh, Kouichi Hirata, Masateru Harao
JCIT
2010
174views more  JCIT 2010»
13 years 2 days ago
Efficient Ming of Top-K Closed Sequences
Sequence mining is an important data mining task. In order to retrieve interesting sequences from a large database, a minimum support threshold is needed to be specified. Unfortun...
Panida Songram
ICDE
2009
IEEE
173views Database» more  ICDE 2009»
13 years 3 months ago
Efficient Mining of Closed Repetitive Gapped Subsequences from a Sequence Database
There is a huge wealth of sequence data available, for example, customer purchase histories, program execution traces, DNA, and protein sequences. Analyzing this wealth of data to ...
Bolin Ding, David Lo, Jiawei Han, Siau-Cheng Khoo
DASFAA
2008
IEEE
137views Database» more  DASFAA 2008»
13 years 7 months ago
Efficient Mining of Recurrent Rules from a Sequence Database
We study a novel problem of mining significant recurrent rules from a sequence database. Recurrent rules have the form "whenever a series of precedent events occurs, eventuall...
David Lo, Siau-Cheng Khoo, Chao Liu 0001