TWCT-Stream：Algorithm for mining frequent patterns in data streams

doi:10.3778/j.issn.1002-8331.2009.20.044

Computer Engineering and Applications ›› 2009, Vol. 45 ›› Issue (20): 147-150.DOI: 10.3778/j.issn.1002-8331.2009.20.044

• 数据库、信息处理 • Previous Articles Next Articles

TWCT-Stream：Algorithm for mining frequent patterns in data streams

庄波¹，刘希玉²，隆坤¹

1.Department of Computer Science and Technology，Binzhou University，Binzhou，Shandong 256603，China
2.School of Management and Economics，Shandong Normal University，Jinan 250014，China

Received:2009-02-12 Revised:2009-05-08 Online:2009-07-11 Published:2009-07-11
Contact: ZHUANG Bo

TWCT-Stream：数据流上的频繁模式挖掘算法

庄波¹，刘希玉²，隆坤¹

1.滨州学院计算机科学技术系，山东滨州 256603
2.山东师范大学管理与经济学院，济南 250014

通讯作者: 庄波

Abstract

Abstract: A TWCT tree structure is proposed with tilted-time window framework embedded，which can maintain the complete set of frequent patterns at multiple time granularities.And this paper designs the sequential update and delete algorithms for the structure，which makes it can be saved in auxiliary storage in order to reduce the algorithms’ requirements of the main memory effectively.Taking advantage of this characteristic，TWCT-Stream，a frequent pattern mining algorithm in data stream，is proposed.And its pattern growth algorithm，TWCT-Growth，generates frequent patterns in lexical order suitable for the sequential updating of TWCT structure.Experiments have proved its memory requirements lower than the same kind of algorithms like FP-Stream and so on.

Key words: data stream mining, frequent pattern, tilted-time window

摘要： 提出一种结合倾斜时间窗的TWCT树结构，可以保存不同时间粒度下频繁模式的完全集，并设计了其顺序更新和删除算法，使其能够存储在外存，从而有效地降低算法的内存空间需求。结合TWCT树结构特点，提出了数据流上的频繁模式挖掘算法TWCT-Stream，其模式生长的TWCT-Growth算法按字典顺序生成频繁模式，以配合TWCT结构的顺序更新。实验证实算法的内存需求低于FP-Stream等同类算法。

关键词: 数据流挖掘, 频繁模式, 倾斜时间窗口

庄波¹，刘希玉²，隆坤¹. TWCT-Stream：Algorithm for mining frequent patterns in data streams[J]. Computer Engineering and Applications, 2009, 45(20): 147-150.

庄波¹，刘希玉²，隆坤¹. TWCT-Stream：数据流上的频繁模式挖掘算法[J]. 计算机工程与应用, 2009, 45(20): 147-150.

[1]	LIU Chun, ZHOU Yan, LI Xin. Mining Semantic Trajectory Frequent Pattern and Car Pooling Application Research [J]. Computer Engineering and Applications, 2019, 55(15): 96-103.
[2]	SUN Jun, ZHANG Xihuang. Top-k frequent patterns based on nodesets [J]. Computer Engineering and Applications, 2017, 53(6): 101-105.
[3]	CAO Bo1, NI Jiancheng2, LI Linlin1, YU Pingping1, YAO Binxiu1. Parallel frequence pattern mining algorithm based on Spark [J]. Computer Engineering and Applications, 2016, 52(20): 86-91.
[4]	LIU Weiming1，2, KUAI Hailong1, CHEN Zhigang3, MAO Yimin1，4. Algorithm based on ordered tree for mining maximal frequent items from uncertain data [J]. Computer Engineering and Applications, 2015, 51(24): 145-149.
[5]	DONG Lili, DONG Wei, ZHANG Xiang. Research for memory data clustering efficiency with CUDA [J]. Computer Engineering and Applications, 2015, 51(22): 243-251.
[6]	TAN Jun1，2, BU Yingyong1, CHEN Aibin2. Efficient frequent pattern tree structure over data streams [J]. Computer Engineering and Applications, 2013, 49(2): 152-154.
[7]	XIE Huosheng, HE Xingxing. Efficient algorithm for mining frequent sequential pattern based on sliding window in data stream [J]. Computer Engineering and Applications, 2012, 48(4): 121-124.
[8]	LIAO Furong1, WANG Chengliang2. Algorithm for mining maximal length frequent itemsets based on order FP-tree [J]. Computer Engineering and Applications, 2012, 48(30): 147-150.
[9]	WANG Yan, LI Lingling, SHAO Xiaoyan. Research on advanced frequent itemsets mining algorithm [J]. Computer Engineering and Applications, 2012, 48(19): 119-121.
[10]	XUN Yaling，WU Xiaoting，ZHANG Jifu. Distributed constructing algorithm of frequent pattern tree based on grid [J]. Computer Engineering and Applications, 2011, 47(31): 128-131.
[11]	MA Qingxia1，LI Guangshui1，SUN Mei2. Current status and typical application on frequent pattern mining [J]. Computer Engineering and Applications, 2011, 47(15): 138-144.
[12]	ZHANG Guanglu1，LEI Jingsheng2. Characteristics of data stream mining for frequent pattern based on landmark window [J]. Computer Engineering and Applications, 2011, 47(10): 131-134.
[13]	ZHAO Qian，SHANG Xue-qun. Mining co-regulated genes from microarray data quickly and effectively [J]. Computer Engineering and Applications, 2010, 46(9): 33-37.
[14]	YUAN Ben-gang¹，CHEN Li¹，JIN Yan². Mining of negative frequent patterns in databases [J]. Computer Engineering and Applications, 2010, 46(8): 117-119.
[15]	ZENG Zhi-yong，YANG Cheng-zhi，TAO Ye. Research of load balance FP-growth algorithm in parallel [J]. Computer Engineering and Applications, 2010, 46(4): 125-126.

TWCT-Stream：Algorithm for mining frequent patterns in data streams

TWCT-Stream：数据流上的频繁模式挖掘算法

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics