###
:2019,28(4):151-156
本文二维码信息
码上扫一扫!
基于增强二部图网络结构的推荐算法
(福州大学 经济与管理学院, 福州 350108)
Recommendation Algorithm Based on Enhanced Bipartite Graph Network
(School of Economics and Management, Fuzhou University, Fuzhou 350108, China)
摘要
图/表
参考文献
相似文献
本文已被:浏览 213次   下载 128
投稿时间:2018-10-19    修订日期:2018-11-06
中文摘要: 协同过滤推荐算法的数据稀疏性与冷启动问题影响和制约了推荐的质量.基于用户-项目二部图的信任计算可以有效的利用用户间的潜在联系提高推荐性能.提出一种融合基于二部图的增强繁殖信任与JMSD相关系数的推荐方法,包括对改进的加权用户-项目自适应繁殖信任度的计算,在此基础上融合用户偏好的增强信任度机制,以及线性加权JMSD相关系数,两组数据集下的对比实验表明,与三种基准算法对比改进的算法模型具有更低的平均绝对误差(MAE),更高的召回率(Recall),提高了推荐质量.
Abstract:The data sparsity and cold start problem of collaborative filtering recommendation algorithm affects and constrains the quality of recommendation. Trust calculation based on user-project bipartite graph can effectively utilize the hidden connection between users. The algorithm model proposed in this study includes the calculation of improved user-project adaptive trust, incorporates an improved enhanced trust mechanism based on user preferences, linear weighted JMSD correlation coefficient. Experiments under the two sets of data set show that the improved algorithm model has a lower Mean Absolute Error (MAE) and higher recall rate (Recall) than the three benchmark algorithms, both models have their own focus, which improves the quality of recommendations.
文章编号:     中图分类号:    文献标志码:
基金项目:国家自然科学基金(61300104);福建省自然科学基金(2018J01791)
引用文本:
张岐山,文闯.基于增强二部图网络结构的推荐算法.计算机系统应用,2019,28(4):151-156
ZHANG Qi-Shan,WEN Chuang.Recommendation Algorithm Based on Enhanced Bipartite Graph Network.COMPUTER SYSTEMS APPLICATIONS,2019,28(4):151-156

用微信扫一扫

用微信扫一扫