Research on high efficiency mining frequent itemsets on association rules

doi:10.3778/j.issn.1002-8331.2011.03.042

Computer Engineering and Applications ›› 2011, Vol. 47 ›› Issue (3): 139-141.DOI: 10.3778/j.issn.1002-8331.2011.03.042

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

Research on high efficiency mining frequent itemsets on association rules

ZHANG Yuntao¹，YU Zhilou²，ZHANG Huaxiang¹

1.School of Information Science and Engineering，Shandong Normal University，Jinan 250014，China
2.Inspur Group，Jinan 250101，China

Received:2009-06-26 Revised:2009-10-23 Online:2011-01-21 Published:2011-01-21
Contact: ZHANG Yuntao

关联规则中频繁项集高效挖掘的研究

张云涛¹，于治楼²，张化祥¹

1.山东师范大学信息科学与工程学院，济南 250014
2.浪潮集团有限公司，济南 250101

通讯作者: 张云涛

Abstract

Abstract: An improved algorithm Apriori-M which combines with 2-itemsets support count matrix is brought forward for its lower efficiency of time.The algorithm scans the database to generate 2-itemsets support count matrix，and then improves the efficiency of the connectivity and the pruning by the character of the matrix；gets all the frequent itemsets correctly by scanning the database second time，and also solves the question about generating 2-itemsets invalid.Experimental results show that the capability of the improved algorithm is more efficient than Apriori.

Key words: association rules, Apriori algorithm, transaction database, frequent itemsets, support matrix

摘要： 针对Apriori时间性能较低的缺陷，结合二项集支持度矩阵提出了Apriori改进算法Apriori-M。在扫描数据库时生成一个二项集支持度矩阵，利用矩阵的性质提高了连接和剪枝的效率；通过第二次扫描数据库就能正确地获取所有的频繁项集，并很好地解决了Apriori生成无效二项集的问题。实验结果表明Apriori-M的性能优于Apriori。

关键词: 关联规则, Apriori算法, 事务数据库, 频繁项, 支持度矩阵

CLC Number:

TP391.4

ZHANG Yuntao¹，YU Zhilou²，ZHANG Huaxiang¹. Research on high efficiency mining frequent itemsets on association rules[J]. Computer Engineering and Applications, 2011, 47(3): 139-141.

张云涛¹，于治楼²，张化祥¹. 关联规则中频繁项集高效挖掘的研究[J]. 计算机工程与应用, 2011, 47(3): 139-141.

[1]	ZHANG Zhenhai，ZHANG Xiangting. Context-Aware Information Service Recommendation Method for High-Speed Rail [J]. Computer Engineering and Applications, 2021, 57(12): 231-236.
[2]	YANG Geying, SHEN Xiajiong, SHI Xianjin, ZHANG Lei. Visualization of Association Rules in Context of Concept Lattices [J]. Computer Engineering and Applications, 2021, 57(1): 84-91.
[3]	JI Wenlu, WANG Hailong, SU Guibin, LIU Lin. Review of Recommendation Methods Based on Association Rules Algorithm [J]. Computer Engineering and Applications, 2020, 56(22): 33-41.
[4]	GU Junhua, SU Ming, ZHANG Yajuan, ZHANG Danhong. Research on Fast Frequent Pattern Mining Algorithm Based on Bitmap-Code List [J]. Computer Engineering and Applications, 2020, 56(19): 86-93.
[5]	YANG Zhen, GENG Xiuli. Research on Mining Association Rules Based on Multi-Granularity Attribute Reduction [J]. Computer Engineering and Applications, 2019, 55(6): 133-139.
[6]	CAO Weidong1，2, XU Daidai2, WANG Jing2, WANG Jialiang2. NOSHOW Prediction and Strong Factor Association Analysis in Civil Aviation [J]. Computer Engineering and Applications, 2019, 55(2): 221-227.
[7]	CAO Jingjing1, REN Xinxin2, XU Xianhao2. Research on Logistics Path Frequent Patterns Based on Parallel Apriori [J]. Computer Engineering and Applications, 2019, 55(11): 257-264.
[8]	LIU Yan, ZHANG Jin, CHEN Jing, YIN Meijuan, ZHANG Weili. Detection of hype groups based on mining maximum frequent itemsets in Microblogs [J]. Computer Engineering and Applications, 2017, 53(4): 90-97.
[9]	CHEN Yanan, ZHU Xijun. Association analysis of TCM asthma medication combination based on Hadoop [J]. Computer Engineering and Applications, 2017, 53(13): 95-98.
[10]	XUE Fuliang1, MA Li2. Improved association rule recommendation method based on dynamic product taxonomy [J]. Computer Engineering and Applications, 2016, 52(4): 135-141.
[11]	SHANG Zhaowei, LI Zhenhua, ZHANG Lan. Log-based collaborative automatic image annotation [J]. Computer Engineering and Applications, 2015, 51(8): 178-182.
[12]	ZHANG Zhonglin, SHI Haoyin, YAN Guanghui. Method of tendency measure mining in dynamic association rules based on grey-Markov model [J]. Computer Engineering and Applications, 2015, 51(7): 154-159.
[13]	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.
[14]	DING Bangxu, HUANG Yongqing. Algorithm of matrix and Prefix-tree for mining frequent itemsets [J]. Computer Engineering and Applications, 2015, 51(22): 154-157.
[15]	YIN Shaohong, SHAN Kunyu, FAN Guidan. Mining algorithm research of data stream maximum frequent itemsets in sliding window [J]. Computer Engineering and Applications, 2015, 51(22): 145-149.

Research on high efficiency mining frequent itemsets on association rules

关联规则中频繁项集高效挖掘的研究

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics