Sciweavers

IS
2008

Efficient mining of frequent episodes from complex sequences

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 and fixed time intervals in a sequence. Previous studies in episodes consider only frequent episodes in a sequence of events (called simple sequence). In real world, we may find a set of events at each time slot in terms of various intervals (hours, days, weeks, etc.) We refer to such sequences as complex sequences. Mining frequent episodes in complex sequences has more extensive applications than in simple sequences. In this paper, we discuss the problem on mining frequent episodes in a complex sequence. We extend previous algorithm MINEPI to MINEPI+ for episode mining from complex sequences. Furthermore, a memory-anchored algorithm called EMMA is introduced for the mining task. Experimental evaluation on both real world and synthetic data sets shows that EMMA is more efficient than MINEPI+.
Kuo-Yu Huang, Chia-Hui Chang
Added 12 Dec 2010
Updated 12 Dec 2010
Type Journal
Year 2008
Where IS
Authors Kuo-Yu Huang, Chia-Hui Chang
Comments (0)