• Title of article

    Efficient mining of frequent episodes from complex sequences

  • Author/Authors

    Kuo-Yu Huang، نويسنده , , Chia-Hui Chang، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2008
  • Pages
    19
  • From page
    96
  • To page
    114
  • Abstract
    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 image 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 image.
  • Keywords
    Frequent episodes , Temporal association , DATA MINING
  • Journal title
    Information Systems
  • Serial Year
    2008
  • Journal title
    Information Systems
  • Record number

    1230048