Discovering patterns with great significance is an important problem in data mining discipline. An episode is defined to be a partially ordered set of events for consecutive and fixed-time intervals in a sequence. Most of previous studies on 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 that 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+.
GCS - Global Citation Score shows the Citation Frequency based on the total count in the Web of Science. LCR - Local Cited References shows the count of cited papers within the collection. LCS - Local Citation Score shows the Citation Frequency within the
In this presentation, given at TheServerSide Java Symposium Barcelona in June, Bruce Tate looks at how Java developers, framework designers, and language designers can learn from the capabilities of Ruby to improve Java. He specifically addresses language
Indian breaking news, top stories and headlines from sports, finance, politics, technology, entertainment, business at a glance only at indiagoes a new generation news service that aggregates and delivers Indian news flawlessly