Title :
Discovering Frequent Closed Episodes from an event sequence
Author :
Zhu, Huisheng ; Wang, Peng ; Wang, Wei ; Shi, Baile
Author_Institution :
Taizhou Teachers Coll., Taizhou, China
Abstract :
Serial episode mining is one of hot spots in temporal data mining with broad applications such as user-browsing behavior prediction, telecommunication alarm analysis, road traffic monitoring, and root cause diagnostics from faults log data in manufacturing. In this paper, as a step forward to analyzing patterns within an event sequence, we propose a novel algorithm FCEMiner (Frequent Closed Episodes Miner) for discovering all frequent closed episodes. To characterize the followed-by-closely relationships over event types well and avoid over-counting the support of long episodes, FCEMiner takes both minimal and non-overlapping occurrences of an episode into consideration. To perform iterative episode growth without generating any candidate, FCEMiner utilizes the depth-first search strategy with Apriori Property. To save the cost of post-processing on frequent episodes, FCEMiner checks the closures of some episodes during each valid episode growth. A set of performance studies on both synthetic and real-world datasets show that our algorithm is more efficient and effective.
Keywords :
data mining; iterative methods; pattern recognition; tree searching; FCEMiner algorithm; apriori property; depth first search strategy; event sequence; followed-by-closely relationships; frequent closed episodes discovery; frequent closed episodes miner algorithm; iterative episode growth; minimal occurrences; nonoverlapping occurrences; pattern analysis; serial episode mining; temporal data mining; Algorithm design and analysis; Communications technology; Data mining; Educational institutions; Indexes; Iron; Search problems; Data mining; Event sequence; Frequent closed episode; Minimal; non-overlapping occurrences;
Conference_Titel :
Neural Networks (IJCNN), The 2012 International Joint Conference on
Conference_Location :
Brisbane, QLD
Print_ISBN :
978-1-4673-1488-6
Electronic_ISBN :
2161-4393
DOI :
10.1109/IJCNN.2012.6252683