首页> 外文会议>International Computer Symposium >Efficient Mining of Frequent Target Episodes from Complex Event Sequences
【24h】

Efficient Mining of Frequent Target Episodes from Complex Event Sequences

机译:复杂事件序列的频繁目标剧集的高效挖掘

获取原文

摘要

Mining frequent episodes from event sequences is an important topic in data mining fields with wide applications. Most of the existing researches focused on mining frequent episodes from a single event sequence. However, sequences containing simultaneous events are frequently encountered and we refer to such sequences as complex event sequences. Moreover, for some practical applications, users are often interested in target episodes where the last event of an episode is the target event type. In this paper, we address the problem of mining frequent target episodes in complex event sequences. We first extend the state-of-the-art algorithm PPS to be PPS+, which serves as a basic method for mining episodes from complex event sequences. Then, we propose a novel algorithm named TEM-SES (Target Episode Mining using Simultaneous Events Set) to overcome the drawback of PPS+. Experimental evaluation demonstrates that the proposed TEM-SES algorithm outperforms PPS+ substantially in terms of execution time and memory consumption.
机译:挖掘事件序列的频繁剧集是具有广泛应用程序的数据挖掘字段中的重要主题。大多数现有研究都集中在从单个事件序列中挖掘频繁的剧集。然而,经常遇到包含同时事件的序列,并将这些序列称为复杂的事件序列。此外,对于某些实际应用,用户通常对目标剧集感兴趣,其中剧集的最后事件是目标事件类型。在本文中,我们解决了复杂事件序列中频繁的目标发作问题的问题。我们首先将最先进的算法PPS扩展为PPS +,它用作从复杂事件序列挖掘的基本方法。然后,我们提出了一种名为TEM-SES的新颖算法(使用同时事件设置的目标剧集挖掘)来克服PPS +的缺点。实验评估表明,所提出的TEM-SES算法在执行时间和存储器消耗方面大致优于PPS +。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号