首页> 外文期刊>Information Systems >Efficient mining of frequent episodes from complex sequences
【24h】

Efficient mining of frequent episodes from complex sequences

机译:从复杂序列中高效挖掘频繁发作

获取原文
获取原文并翻译 | 示例
       

摘要

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+.
机译:发现具有重要意义的模式是数据挖掘学科中的重要问题。情节定义为序列中连续时间和固定时间间隔的事件的部分排序集合。以前关于事件的大多数研究都只考虑一系列事件(称为简单序列)中的频繁事件。在现实世界中,我们可能会在每个时隙中找到各种时间间隔(小时,天,周等)的事件集。我们将这样的序列称为复杂序列。在复杂序列中挖掘频繁事件比在简单序列中具有更广泛的应用。在本文中,我们讨论了以复杂序列挖掘频繁事件的问题。我们将先前的算法MINEPI扩展到MINEPI +,以便从复杂序列中进行情节挖掘。此外,为挖掘任务引入了一种称为EMMA的内存固定算法。对现实和综合数据集的实验评估表明,EMMA比MINEPI +更有效。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号