Frequent episode mining within the latest time windows over event streams

被引:0
作者
Shukuan Lin
Jianzhong Qiao
Ya Wang
机构
[1] Northeastern University,College of Information Science and Engineering
[2] Xuchang College,School of Computer Science and Technology
来源
Applied Intelligence | 2014年 / 40卷
关键词
Episode; Minimal occurrence; Event stream;
D O I
暂无
中图分类号
学科分类号
摘要
With the wide use of EDGEs (electronic data gathering equipments) such as sensors and RFID (radio frequency identification) devices, unprecedented volumes of event streams have been generated. Mining frequent episodes within the latest time windows over event streams plays a significant role in event monitoring. It helps to generate episode rules, which can reflect the latest change, and predict future events effectively. The paper proposes how to mine MinEpi (minimal occurrence based frequent episode) within the latest time windows. The existing MinEpi mining methods are all Apriori-like, which need to scan data time after time and generate quantities of candidate episodes. This results in high time and space cost. Moreover, Apriori-like methods cannot be applied to event streams. For these problems, the paper proposes the episode matrix and frequent episode tree based mining method (EM&FET), which can generate frequent 2-episodes by constructing an episode matrix and generate higher-level frequent episodes directly by extending lower-level ones gradually, only scanning data once without candidate generation. Moreover, the paper further improves EM&FET, which enhances efficiency and saves space greatly. The experiments on different types of real data sets show the effectiveness and high efficiency of EM&FET and its improvement.
引用
收藏
页码:13 / 28
页数:15
相关论文
共 27 条
[1]  
Welbourne E(2009)Building the Internet of things using RFID: the RFID ecosystem experience IEEE Internet Comput 13 48-55
[2]  
Battle L(2010)Model of the resource addressing in the Internet of things J Softw 21 1657-1666
[3]  
Cole G(2007)Discovering frequent generalized episodes when events persist for different duration IEEE Trans Knowl Data Eng 19 1188-1201
[4]  
Gould K(2009)DRFP-tree:disk-resident frequent pattern tree Appl Intell 30 84-97
[5]  
Rector K(2011)HUC-prune: an efficient candidate pruning technique to mine high utility patterns Appl Intell 34 181-198
[6]  
Raymer S(2013)Mining interesting user behavior patterns in mobile commerce environments Appl Intell 38 418-435
[7]  
Balazinska M(1997)Discovery of frequent episodes in event sequences Data Min Knowl Discov 1 259-289
[8]  
Borriello G(undefined)undefined undefined undefined undefined-undefined
[9]  
Kong N(undefined)undefined undefined undefined undefined-undefined
[10]  
Li XD(undefined)undefined undefined undefined undefined-undefined