Frequent Closed Episode Mining Based on Minimal and Non-Overlapping Occurrences

Zhu Huisheng; Wang Wei; Shi Baile

Journal of Computer Research and Development > 2013 > 50(4): 852-860.

Zhu Huisheng, Wang Wei, Shi Baile. Frequent Closed Episode Mining Based on Minimal and Non-Overlapping Occurrences[J]. Journal of Computer Research and Development, 2013, 50(4): 852-860.

Citation:

Zhu Huisheng, Wang Wei, Shi Baile. Frequent Closed Episode Mining Based on Minimal and Non-Overlapping Occurrences[J]. Journal of Computer Research and Development, 2013, 50(4): 852-860.

Citation:

Zhu Huisheng, Wang Wei, Shi Baile. Frequent Closed Episode Mining Based on Minimal and Non-Overlapping Occurrences[J]. Journal of Computer Research and Development, 2013, 50(4): 852-860.

PDF (3276 KB)

Frequent Closed Episode Mining Based on Minimal and Non-Overlapping Occurrences

1(Taizhou Teachers College, Taizhou, Jiangsu 225300) 2(School of Computer Science, Fudan University, Shanghai 200433)

More Information

Published Date: April 14, 2013

Graphical Abstract

Abstract

Abstract

Mining frequent closed episodes from an event sequence is an important task. The existing research work is based on the support definition of minimal occurrences and the breadth-first search strategy, which unavoidably leads to the issues such as over-counting the occurrences of an episode and generating a huge number of candidate episodes. In this paper, a novel algorithm FCEMiner is proposed to mine frequent closed episodes from an event sequence, which employs the support definition of both minimal and non-overlapping occurrences and the depth-first search strategy. Moreover, FCEMiner utilizes the non-closed unanimity of special forward extension to skip redundant closure checking and narrow down the search space of frequent closed episodes. Both theoretical study and experimental evaluation confirm that FCEMiner is able to effectively discover frequent closed episodes from an event sequence.
- event sequence,
- frequent closed episode,
- minimal and non-overlapping occurrence,
- depth-first,
- data mining

FullText(HTML)

References (0)

[1]	Jiang Tao, Li Zhanhuai. A Survey on Local Pattern Mining in Gene Expression Data[J]. Journal of Computer Research and Development, 2018, 55(11): 2343-2360. DOI: 10.7544/issn1000-1239.2018.20170629
[2]	Ding Zhaoyun, Jia Yan, Zhou Bin. Survey of Data Mining for Microblogs[J]. Journal of Computer Research and Development, 2014, 51(4): 691-706.
[3]	Liu Dayou, Chen Huiling, Qi Hong, and Yang Bo. Advances in Spatiotemporal Data Mining[J]. Journal of Computer Research and Development, 2013, 50(2): 225-239.
[4]	Lei Xiangxin, Yang Zhiying, Huang Shaoyin, Hu Yunfa. Mining Frequent Subtree on Paging XML Data Stream[J]. Journal of Computer Research and Development, 2012, 49(9): 1926-1936.
[5]	Liao Guoqiong, Wu Lingqin, Wan Changxuan. Frequent Patterns Mining over Uncertain Data Streams Based on Probability Decay Window Model[J]. Journal of Computer Research and Development, 2012, 49(5): 1105-1115.
[6]	Zhu Ranwei, Wang Peng, and Liu Majin. Algorithm Based on Counting for Mining Frequent Items over Data Stream[J]. Journal of Computer Research and Development, 2011, 48(10): 1803-1811.
[7]	Hu Wenyu, Sun Zhihui, Wu Yingjie. Study of Sampling Methods on Data Mining and Stream Mining[J]. Journal of Computer Research and Development, 2011, 48(1): 45-54.
[8]	Yang Bingru, Gao Jing, and Song Wei. Application Research of Cognitive Physics in Data Mining[J]. Journal of Computer Research and Development, 2006, 43(8): 1432-1438.
[9]	Liu Xuejun, Xu Hongbing, Dong Yisheng, Wang Yongli, Qian Jiangbo. Mining Frequent Patterns in Data Streams[J]. Journal of Computer Research and Development, 2005, 42(12): 2192-2198.
[10]	Yan Yuejin, Li Zhoujun, and Chen Huowang. A Depth-First Search Algorithm for Mining Maximal Frequent Itemsets[J]. Journal of Computer Research and Development, 2005, 42(3).