A novel approach for data stream maximal frequent itemsets mining

被引：0

作者：

Xu C.-H. ^{[1
]}

机构：

[1] Business Administration College, Contemporary Business and Trade Research Center, Contemporary Business and Collaborative Innovation Research Center, Zhejiang Gongshang University, Hangzhou City

来源：

International Journal of Wireless and Mobile Computing | 2016年 / 10卷 / 03期

关键词：

FP-tree; Maximal frequent itemsets; Orderly compound; Self-adjusting;

D O I：

10.1504/IJWMC.2016.077214

中图分类号：

学科分类号：

摘要：

This paper proposes a novel algorithm AMMFI based on self-adjusting and orderly compound policy to solve the problems of existing algorithms for mining maximal frequent itemsets in a data stream. The proposed algorithm processes the data stream based on sliding window technique and scans data stream fragments single-pass to obtain and store frequent itemsets in frequent itemsets list. It then constructs a self-adjusting and orderly FP-tree, dynamically adjusts the tree structure with the insertion of itemsets, uses mixed subset pruning method to reduce the search space, and merges nodes with the same min-sup in identical branch. Finally, orderly compound FP-tree is generated and it avoids superset checking in the process of mining maximal frequent itemsets. Detailed simulation analysis demonstrates that the presented algorithm is of high efficiency of space and time and is more stable. © 2016 Inderscience Enterprises Ltd.

引用

页码：224 / 231

页数：7

共 18 条

[1]

Alrabaee S., Khasawneh M., Agarwal A., Goel N., Zaman M., Applications architectures and protocol design issues for cognitive radio networks: A survey, International Journal of Wireless and Mobile Computing, 7, 5, pp. 415-427, (2014)

[2]

Ao F.J., Yan Y.J., Liu B.H., Huang K.D., Online mining maximal frequent itemsets in sliding window over data streams, Journal of System Simulation in Chinese, 21, 4, pp. 1134-1139, (2009)

[3]

Babcock B., Babu S., Datar M., Motwani R., Widom J., Models and issues in data stream systems, Proceedings of the PODS'2002, pp. 1-16, (2002)

[4]

Deypir M., Sadreddini M.H., A dynamic layout of sliding window for frequent itemset mining over data streams, Journal of Systems and Software, 85, 3, pp. 746-759, (2012)

[5]

Farzanyar Z., Kangavari M., Cercone N., Max-FISM: Mining (recently) maximal frequent itemsets over data streams using the sliding window model, Computers and Mathematics with Applications, 64, 6, pp. 1706-1718, (2012)

[6]

Hu T.M., Sung S.Y., Xiong H., Fu Q., Discovery of maximum length frequent itemsets, Information Sciences, 178, 1-2, pp. 69-87, (2008)

[7]

Kiran M., Ram Mohana Reddy G., Bat-termite: A novel hybrid bio inspired routing protocol for mobile ad hoc networks, International Journal of Wireless and Mobile Computing, 7, 3, pp. 258-269, (2014)

[8]

Li H.F., Chen H., Mining non-derivable frequent itemsets over data stream, Data and Knowledge Engineering, 68, 5, pp. 481-498, (2009)

[9]

Li H., Lee S.-Y., Mining frequent itemsets over data streams using efficient window sliding techniques, Expert Systems with Applications, 36, 2, pp. 1466-1477, (2009)

[10]

Li H., Lee S., Shan M., Online mining (recently) maximal frequent itemsets over data streams, Proceedings of the Fifteenth International Workshops on Research Issues in Data Engineering: Stream Data Mining and Applications, pp. 11-18, (2005)

← 1 2 →