Algorithm of matrix and Prefix-tree for mining frequent itemsets

Abstract

Abstract: Traditional algorithm of frequent itemsets mining’s execution efficiency is low. MPFI algorithm based on matrix and Prefix-tree is raised for frequent itemsets mining. It can quickly mining frequent itemsets of transaction database. MPFI algorithm only scan transaction database once, builds vertical binary matrix. Binary vector for frequent itemsets information and Prefix-tree data structure for compression storage of frequent itemsets is applied in the algorithm, without candidate itemsets. According to theoretical analysis and experimental results, MPFI algorithm can effectively improve the efficiency of frequent itemsets mining.

Key words: frequent itemsets, matrix, binary, Prefix-tree

摘要： 传统频繁项集挖掘算法的执行效率较低。提出了一种基于矩阵与前缀树的频繁项集挖掘算法MPFI，能快速地挖掘事务数据库中的频繁项集。MPFI算法只需扫描事务数据库一次，构建垂直方向的二进制矩阵，应用二进制位向量表达频繁项集信息，利用前缀树压缩存储频繁项集的相关信息，不产生候选项集。理论分析与实验结果表明，MPFI算法能有效地提高频繁项集挖掘效率。

关键词: 频繁项集, 矩阵, 二进制, 前缀树

DING Bangxu, HUANG Yongqing. Algorithm of matrix and Prefix-tree for mining frequent itemsets[J]. Computer Engineering and Applications, 2015, 51(22): 154-157.

丁邦旭，黄永青. 矩阵与前缀树方法挖掘频繁项集[J]. 计算机工程与应用, 2015, 51(22): 154-157.

[1]	ZOU Jie, LI Jun. Multi-strategy Covariance Matrix Learning Differential Evolution Algorithm [J]. Computer Engineering and Applications, 2021, 57(7): 78-87.
[2]	YANG Li, WU Yi, WEI Debin, PAN Chengsheng. Satellite Network Traffic Prediction Based on Spatiotemporal Correlation [J]. Computer Engineering and Applications, 2021, 57(7): 101-106.
[3]	LU Manjiao, ZHANG Wei, XU Tao. Optimal Replenishment Strategy Based on Dynamic Matrix Model [J]. Computer Engineering and Applications, 2021, 57(7): 263-268.
[4]	WANG Changlong, ZHANG Yuandong, MIAO Hong, YANG Yuheng. Application of Double Channel Convolutional Neural Network in Pumpkin Diseases Identification [J]. Computer Engineering and Applications, 2021, 57(5): 183-189.
[5]	GAN Xinyan, GAO Xiang. Research on Cloud Manufacturing System Selection Based on Hesitant Fuzzy Decision Making Algorithm [J]. Computer Engineering and Applications, 2021, 57(2): 134-142.
[6]	DING Yuxiang, BIAN Weixin, JIE Biao, ZHAO Jun. Super-Resolution Image Reconstruction Based on Neighborhood Regression and Sparse Representation [J]. Computer Engineering and Applications, 2021, 57(2): 230-236.
[7]	WANG Yingbo, SUN Yongdi. GNN-Based Matrix Factorization Recommendation Algorithm [J]. Computer Engineering and Applications, 2021, 57(19): 129-134.
[8]	CAI Xiumei, BIAN Jingwei, WU Chengmao, WANG Yan. Research on Robust Feature Extraction and Matching Methods Based on LBP [J]. Computer Engineering and Applications, 2021, 57(16): 228-236.
[9]	ZHANG Chengling, LI Jinjin, LIN Yidong. Attribute Reduction in Formal Contexts Based on OE-Concept Lattices [J]. Computer Engineering and Applications, 2021, 57(15): 82-89.
[10]	XIA Ying, ZHANG Jinfeng. POI Recommendation Fusing Social Relations and Local Geographic Factors [J]. Computer Engineering and Applications, 2021, 57(15): 133-139.
[11]	BAI Lu, ZHAO Xin, KONG Yuting, ZHANG Zhenghang, SHAO Jinxin, QIAN Yurong. Survey of Spectral Clustering Algorithms [J]. Computer Engineering and Applications, 2021, 57(14): 15-26.
[12]	ZHANG Yang, LU Mingming, ZHENG Yiji, LI Haifeng. Student Grade Prediction Based on Graph Auto-Encoder Model [J]. Computer Engineering and Applications, 2021, 57(13): 251-257.
[13]	ZHANG Ren, HE Ning. A Survey of Micro-Expression Recognition Methods [J]. Computer Engineering and Applications, 2021, 57(1): 38-47.
[14]	WANG Jie, HUANG Lixia, ZHANG Xueying. Multi-source Location of Speech Signal Based on Improved DSB Method [J]. Computer Engineering and Applications, 2021, 57(1): 173-180.
[15]	HUO Lin, LU Yinli. Improved Particle Swarm Optimization for Android Malware Detection [J]. Computer Engineering and Applications, 2020, 56(7): 96-101.

Algorithm of matrix and Prefix-tree for mining frequent itemsets

矩阵与前缀树方法挖掘频繁项集

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics