Education, Science, Technology, Innovation and Life
Open Access
Sign In

A Review of Research on Pruning Strategies in Maximum Frequent Itemset Mining Algorithms

Download as PDF

DOI: 10.23977/acss.2025.090319 | Downloads: 6 | Views: 86

Author(s)

Fentian Li 1

Affiliation(s)

1 The Tourism College of Changchun University, Changchun, Jilin, 130607, China

Corresponding Author

Fentian Li

ABSTRACT

The mining of frequent itemsets has become a hot topic among researchers. If the process of mining frequent itemsets is regarded as a search problem, then the search space is an enumeration tree. In order to minimize unnecessary nodes for search, the optimization of pruning technology can improve the mining efficiency of frequent itemsets to a certain extent. This is one of the important means to improve the efficiency of frequent itemsets. This article improves the definitions of frequent itemsets and enumeration trees, analyzes the use of various pruning strategies, and summarizes the efficiency of various pruning strategies for mining maximum frequent itemsets.

KEYWORDS

Frequent Itemsets; Enumeration Tree; Pruning Strategy; Maximum Frequent Itemsets

CITE THIS PAPER

Fentian Li, A Review of Research on Pruning Strategies in Maximum Frequent Itemset Mining Algorithms. Advances in Computer, Signals and Systems (2025) Vol. 9: 159-167. DOI: http://dx.doi.org/10.23977/acss.2025.090319.

REFERENCES

[1] Zhang Qing, Tan Xu, Lu Xin. Research frontier and prospects of frequent item set mining [J]. Journal of Shenzhen Information Vocational and Technical College, 2024, 22(01): 1-14. 2024-01-010.
[2] Liu Wenjie, Yang Haijun. Closed frequent itemset mining algorithm based on ESCS pruning strategy [J]. Journal of Jilin University (Information Science Edition), 2023, 41(02): 329-337.2023.02.021.
[3] Gu Junhua, Li Ruting, Zhang Yajuan, et al. Research on improved frequent item set mining algorithm and its application [J]. Computer Applications and Software, 2019, 36(09): 260-269.2019-09-047.
[4] Geng Xiaohai. Research on frequent item set mining algorithm based on data flow [D]. Chongqing University of Posts and Telecommunications, 2020.2020.000163.
[5] Zhao Xincan. Research on association rules mining of high-dimensional data and incremental data based on big data environment [D]. Jiangxi University of Science and Technology, 2021.2021.000587.
[6] Zhang Yang, Wang Rui, Wu Guanfeng, et al. Parallel mining algorithm of frequent itemsets based on N-list and DiffNodeset structures [J]. Computer Science, 2023, 50(11):55-61.2023-11-008.
[7] Wang Bin, Liu Hao, Li Xiaohua, et al. High-weighted fault-tolerant frequent itemset mining algorithm based on weighted dynamic trees [J]. Journal of Qingdao University of Science and Technology, 2023, 44(03): 130-137.2023-03-017.
[8] Zhao Xuejian, Zhao Ke. Biologically inspired frequent itemset mining strategy based on genetic algorithm [J]. Computer Science, 2023, 50(S2): 636-643. 
[9] Zhao Qi. Research on multi-dimensional association rule algorithm based on Fp-Growth[D]. Harbin University of Science and Technology, 2023.2023.000257.
[10] Yang Yong, Zhang Lei, Qu Fuheng, et al. THIMFUP algorithm based on most frequent item extraction and candidate set pruning [J]. Journal of Jilin University (Science Edition), 2021, 59(03): 635-642.2020277.
[11] Xu Jingwen, You Jinguo, Wang Quankun, et al. Research on the unified computing framework of data cubes and frequent itemsets [J]. Journal of Computer Science, 2023, 46(04): 780-802.2023-04-007.
[12] Shi Xiaochen. Data flow anomaly detection based on maximum frequent items [J]. Computer Knowledge and Technology, 2022, 18(25): 118-120+125.2022.1663.
[13] Yan Lixia, Ling Xinghong, Ni Hongtao. Mixed data frequent itemset mining algorithm based on Apriori algorithm [J]. Computer Simulation, 2023, 40(12): 538-542.2023-12-095.

Downloads: 40421
Visits: 793893

Sponsors, Associates, and Links


All published work is licensed under a Creative Commons Attribution 4.0 International License.

Copyright © 2016 - 2031 Clausius Scientific Press Inc. All Rights Reserved.