支持推荐非空率的关联规则推荐算法

doi:10.11959/j.issn.1000-436x.2017160

通信学报 ›› 2017, Vol. 38 ›› Issue (10): 18-25.doi: 10.11959/j.issn.1000-436x.2017160

支持推荐非空率的关联规则推荐算法

何明¹,刘伟世¹,张江²

¹ 北京工业大学信息学部计算机学院，北京 100124
² 国网英大国际控股集团有限公司信息化工作部，北京 100005

修回日期:2017-07-10 出版日期:2017-10-01 发布日期:2017-11-16
作者简介:何明（1975-），男，陕西礼泉人，博士，北京工业大学副教授，主要研究方向为大数据、推荐系统、机器学习等。|刘伟世（1989-），男，山东菏泽人，北京工业大学硕士生，主要研究方向为推荐系统。|张江（1980-），女，北京人，博士，国网英大国际控股集团有限公司信息化工作部经理，主要研究方向为网络通信协议、网络自愈、大数据等。
基金资助:
国家自然科学基金资助项目(91646201);国家自然科学基金资助项目(91546111);北京市自然科学基金资助项目(4153058);北京市自然科学基金资助项目(4113076);北京市教委面上基金资助项目(KM201710005023)

Association rules recommendation algorithm supporting recommendation nonempty

Ming HE¹,Wei-shi LIU¹,Jiang ZHANG²

¹ College of Computer,Faculty of Information Technology,Beijing University of Technology,Beijing 100124,China
² State Grid YingDa International Holdings Co.,Ltd.,Beijing 100005,China

Revised:2017-07-10 Online:2017-10-01 Published:2017-11-16
Supported by:
The National Natural Science Foundation of China(91646201);The National Natural Science Foundation of China(91546111);The Natural Science Foundation of Beijing(4153058);The Natural Science Foundation of Beijing(4113076);General Project of Beijing Municipal Education Commission(KM201710005023)

摘要/Abstract

摘要：

现有的关联规则推荐技术在数据提取时主要侧重于关联规则的提取效率，缺乏对冷、热门数据推荐平衡性的考虑和有效处理。为了提高个性化推荐效率和推荐质量，平衡冷门与热门数据推荐权重，对关联规则的Apriori算法频繁项集挖掘问题进行了重新评估和分析，定义了新的测评指标推荐非空率以及k前项频繁项集关联规则的概念，设计了基于 k 前项频繁项集的剪枝方法，提出了优化 Apriori 算法且适合不同测评标准值的 k前项频繁项集挖掘算法，降低频繁项集提取的时间复杂度。理论分析比较与实验表明，k 前项剪枝方法提高了频繁项集的提取效率，拥有较高的推荐非空率、调和平均值和推荐准确率，有效地平衡了冷、热门数据的推荐权重。

关键词: 关联规则, 推荐系统, 推荐非空率, 数据挖掘

Abstract:

Existing association rule recommendation technologies were focus on extraction efficiency of association rule in data mining.However,it lacked consideration of recommendation balance between popular and unusual data and efficient processing.In order to improve the quality and efficiency of personalized recommendation and balance the recommendation weight of cold and hot data,the problem of mining frequent itemset based on association rule was revaluated and analyzed,a new evaluation metric called recommendation RecNon and a notion of k-pre association rule were defined,and the pruning strategy based on k-pre frequent itemset was designed.Moreover,an association rule mining algorithm based on the idea was proposed,which optimized the Apriori algorithm and was suitable for different evaluation criteria,reduced the time complexity of mining frequent itemset.The theoretic analysis and experiment results on the algorithm show that the method improved the efficiency of data mining and has higher RecNon,F-measure and precision of recommendation,and efficiently balance the recommendation weight of cold data and popular one.

Key words: association rule, recommender system, recommendation nonempty, data mining

中图分类号:

TP319

何明,刘伟世,张江. 支持推荐非空率的关联规则推荐算法[J]. 通信学报, 2017, 38(10): 18-25.

Ming HE,Wei-shi LIU,Jiang ZHANG. Association rules recommendation algorithm supporting recommendation nonempty[J]. Journal on Communications, 2017, 38(10): 18-25.

图/表 11

表1

表2

图1

图2

图3

图4

图5

图6

图7

图8

图9

参考文献 12

[1]	ADOMAVICIUS G , TUZHILIN A . Toward the next generation of recommender systems:a survey of the state-of-the-art and possible extensions[J]. IEEE Transactions on Knowledge and Data Engineering, 2005,17(6): 734-749.
[2]	LIN W , ALVAREZ S , RUIZ C . Efficient adaptive-support association rule mining for recommender systems[J]. Data Mining and Knowledge Discovery, 2002,6(1): 83-105.
[3]	AGRAWAL R , IMIELINSKI T , SWAMI A . Mining association rules between sets of items in large databases[C]// The 1993 ACM SIGMOD International Conference on Management of Data. Washington, 1993: 207-216.
[4]	PARK J S , CHEN M S , YU P S . An effective hash-based algorithm for mining association rules[J]. ACM SIGMOD Record, 1997,24(2): 175-186.
[5]	TOIVONEN H , . Sampling large databases of association rules[C]// The 22th International Conference on Very Large Data Bases,San Francisco:Morgan Kaufmann Publishers Inc, 1996: 134-145.
[6]	魏玲, 魏永江, 高长元 ,等. 基于Bigtable与MapReduce的Apriori算法改进[J]. 计算机科学, 2015,42(10): 208-210.
	WEI L , WEI Y J , GAO C Y ,et al. Improved Apriori algorithm based on Bigtable and MapReduce[J]. Computer Science, 2015,42(10): 208-210.
[7]	刘兴彬, 杨建华, 谢高岗 ,等. 基于Apriori算法的流量识别特征自动提取方法[J]. 通信学报, 2008,29(12): 51-59.
	LIU X B , YANG J H , XIE G G ,et al. Automated mining of packet signatures for traffic identification at application layer with Apriori algorithm[J]. Journal on Communications, 2008,29(12): 51-59.
[8]	王大玲, 于戈, 鲍玉斌 . 一种具有最大推荐非空率的关联规则挖掘方法[J]. 软件学报, 2004,15(8): 1182-1188.
	WANG D L , YU G , BAO Y B . An approach of association rules mining with maximal nonblank for recommendation[J]. Journal of Software, 2004,15(8): 1182-1188.
[9]	SANDVIG J , MOBASHER B , BURKE R . Robustness of collaborative recommendation based on association rule mining[C]// The 2007 ACM Conference on Recommender Systems. 2007: 105-112.
[10]	HONG J Y , SUH E H , KIM J ,et al. Context-aware system for proactive personalized service based on context history[J]. Expert Systems with Applications, 2009,36(4): 7448-7457.
[11]	CHEN W Y , CHU J C , LUAN J ,et al. Collaborative filtering for orkut communities:discovery of user latent behavior[C]// International Conference on World Wide Web. 2009: 681-690.
[12]	GARCIA E , ROMERO C , VENTURA S ,et al. A collaborative educational association rule mining tool[J]. The Internet and Higher Education, 2011,14(2): 77-88.

事务编号（tid）	项集（items）
101	ABC
102	AB
103	AC
104	AD

项（item）	支持度（sup）
A	1
B	0.5
C	0.5
D	0.25

[1]	张忠平, 李森, 刘伟雄, 刘书霞. 基于快速密度峰值聚类离群因子的离群点检测算法[J]. 通信学报, 2022, 43(10): 186-195.
[2]	张忠平, 刘伟雄, 张玉停, 邓禹, 魏棉鑫. ERDOF：基于相对熵权密度离群因子的离群点检测算法[J]. 通信学报, 2021, 42(9): 133-143.
[3]	高胜, 向康, 田有亮, 谭伟杰, 冯涛, 吴晓雪. 基于BCP的联合委托学习模型及协议[J]. 通信学报, 2021, 42(5): 137-148.
[4]	徐丰力,李勇. 城市环境下的用户移动行为建模概述[J]. 通信学报, 2020, 41(7): 18-28.
[5]	项英倬,徐正国,游凌. 基于节点通信行为时序的指控信息流挖掘算法[J]. 通信学报, 2019, 40(9): 51-60.
[6]	王莹,苏壮. 无线网络中的移动预测综述[J]. 通信学报, 2019, 40(8): 157-168.
[7]	胡铮,袁浩,朱新宁,倪万里. 面向5G需求的人群流量预测模型研究[J]. 通信学报, 2019, 40(2): 1-10.
[8]	彭舰,王屯屯,陈瑜,刘唐,徐文政. 基于跨平台的在线社交网络用户推荐研究[J]. 通信学报, 2018, 39(3): 147-158.
[9]	高志强,王宇涛. 差分隐私技术研究进展[J]. 通信学报, 2017, 38(Z1): 151-155.
[10]	穆海蓉,丁丽萍,宋宇宁,卢国庆. DiffPRFs：一种面向随机森林的差分隐私保护算法[J]. 通信学报, 2016, 37(9): 175-182.
[11]	李洪成,吴晓平,陈燕. MapReduce框架下支持差分隐私保护的k-means聚类方法[J]. 通信学报, 2016, 37(2): 125-131.
[12]	刘曙曙,刘安,赵雷,刘冠峰,李直旭,郑凯,周晓方. 数据隐私保护的社会化推荐协议[J]. 通信学报, 2015, 36(12): 131-138.
[13]	吴祖峰,梁棋,刘峤,秦志光. 基于AdaBoost的链路预测优化算法[J]. 通信学报, 2014, 35(3): 116-123.
[14]	吴祖峰，梁棋，刘峤，秦志光. 基于AdaBoost的链路预测优化算法[J]. 通信学报, 2014, 35(3): 13-123.
[15]	丁丽萍，卢国庆. 面向频繁模式挖掘的差分隐私保护研究综述[J]. 通信学报, 2014, 35(10): 23-209.

支持推荐非空率的关联规则推荐算法

Association rules recommendation algorithm supporting recommendation nonempty

在线阅读

PDF下载

可视化

摘要/Abstract

引用本文

使用本文

图/表 11

参考文献 12

相关文章 15

Metrics

推荐阅读 0