Please wait a minute...
Advanced Search
数据分析与知识发现  2019, Vol. 3 Issue (4): 117-125     https://doi.org/10.11925/infotech.2096-3467.2018.0662
  研究论文 本期目录 | 过刊浏览 | 高级检索 |
基于条件型游走的四部图推荐方法*
张怡文1(),张臣坤1,杨安桔1,计成睿1,岳丽华2
1安徽新华学院信息工程学院 合肥 230088
2中国科学技术大学计算机学院 合肥 230026
A Conditional Walk Quadripartite Graph Based Personalized Recommendation Algorithm
Yiwen Zhang1(),Chenkun Zhang1,Anju Yang1,Chengrui Ji1,Lihua Yue2
1Institute of Information Engineering, Anhui Xinhua University, Hefei 230088, China
2School of Computer, University of Science and Technology of China, Hefei 230026, China
全文: PDF (780 KB)   HTML ( 1
输出: BibTeX | EndNote (RIS)      
摘要 

【目的】通过挖掘用户与项目、用户与类别的关系特征, 提取用户偏好, 优化个性化推荐效果。【方法】提取用户对项目的评分和项目的度属性, 挖掘用户偏好, 提出用户-项目二部图上的游走条件; 通过用户-项目-类别三部图映射到用户-类别二部图, 构建类别-用户-项目-类别四部图; 建立通过项目和类别共同挖掘用户偏好的个性化推荐方法。【结果】利用MovieLens电影评分数据, 分别对基于二部图、加权二部图、三部图的方法与本文方法进行对比实验, 结果表明, 本文方法在准确率、MAE、召回率、覆盖率方面分别有所优化。【局限】MovieLens数据集缺少用户对电影评论性的文字数据集, 不能通过语义分析用户偏好。【结论】本文对用户评分和项目度属性进行用户偏好分析, 通过条件型游走四部图推荐方法, 优化推荐效果。

服务
把本文推荐给朋友
加入引用管理器
E-mail Alert
RSS
作者相关文章
张怡文
张臣坤
杨安桔
计成睿
岳丽华
关键词 推荐系统四部图条件游走个性化推荐    
Abstract

[Objective] By mining the relation characteristics between users and items, or between users and categories, this Paper extracts user preferences to optimize recommendation effect. [Methods] This paper extracts user rating and items degree attribute, mines user preferences, and puts forward the walk condition of User-Item bipartite graph; The category-User-Project-Category quadripartite graph is established by mapping User-Item-Category tripartite graph to the User-Category bipartite graph. The personalized recommendation method for user preferences through items and categories is proposed. [Results] Choosing MovieLens ratings data set as the source data, respectively comparing the experimental difference based on bipartite graph, weighted bipartite graph, tripartite graph and quadripartite graph, the results show that the Precision rate, MAE, recall rate, and coverage have been respectively optimized with this proposed method. [Limitations] Due to Movielens lack of critical textual data of users for movies, it is hard to analyze user preferences through the semantic. [Conclusions] This research analyzed user preferences through user ratings and degree attribute, it can be determined that the recommendation effect of quadripartite graph based on conditional walk is great.

Key wordsRecommendation System    Quadripartite Graph    Conditional Walk    Personalized Recommendation
收稿日期: 2018-06-21      出版日期: 2019-05-29
基金资助:*本文系安徽省高校优秀青年人才支持计划重点项目(项目编号: gxyqZD2018087)、安徽省质量工程项目“精品资源共享课程”(项目编号: 2015gxk081)和安徽新华学院校级团队项目“基于用户兴趣的二部图随机游走推荐方法研究”(项目编号: 2016td020)的研究成果之一
引用本文:   
张怡文,张臣坤,杨安桔,计成睿,岳丽华. 基于条件型游走的四部图推荐方法*[J]. 数据分析与知识发现, 2019, 3(4): 117-125.
Yiwen Zhang,Chenkun Zhang,Anju Yang,Chengrui Ji,Lihua Yue. A Conditional Walk Quadripartite Graph Based Personalized Recommendation Algorithm. Data Analysis and Knowledge Discovery, 2019, 3(4): 117-125.
链接本文:  
https://manu44.magtech.com.cn/Jwk_infotech_wk3/CN/10.11925/infotech.2096-3467.2018.0662      或      https://manu44.magtech.com.cn/Jwk_infotech_wk3/CN/Y2019/V3/I4/117
[1] Wang H, Wang N, Yeung D Y.Collaborative Deep Learning for Recommender Systems[C]//Proceedings of the 21st ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 2014:1235-1244.
[2] 孟祥武, 刘树栋, 张玉洁, 等. 社会化推荐系统研究[J]. 软件学报, 2015, 26(6): 1356-1372.
[2] (Meng Xiangwu, Liu Shudong, Zhang Yujie, et al.Research on Social Recommender Systems[J]. Journal of Software, 2015, 26(6): 1356-1372.)
[3] Mooney R J, Roy L.Content-based Book Recommending Using Learning for Text Categorization[C]//Proceedings of the 5th ACM Conference on Digital Libraries. 2000: 195-204.
[4] Breese J S, Heckerman D, Kadie C.Empirical Analysis of Predictive Algorithms for Collaborative Filtering[C]// Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence. 1998: 43-52.
[5] Zhuang F, Luo D, Yuan N J, et al.Representation Learning with Pair-wise Constraints for Collaborative Ranking[C]// Proceedings of the 10th ACM International Conference on Web Search and Data Mining. ACM, 2017: 567-575.
[6] 刘淇, 陈恩红. 结合二部图投影与排序的协同过滤[J]. 小型微型计算机系统, 2010, 31(5): 835-839.
[6] (Liu Qi, Chen Enhong.Collaborative Filtering Through Combining Bipartite Graph Projection and Ranking[J]. Journal of Chinese Computer Systems, 2010, 31(5): 835-839.)
[7] 孙林, 吴相林, 罗松涛, 等. 基于二分图资源分配动力学的推荐排序研究[J]. 计算机工程与设计, 2010, 31(23): 5032-5035.
[7] (Sun Lin, Wu Xianglin, Luo Songtao, et al.Recommendation Ranking Based on Resource Allocation Dynamics on Bipartite Graph[J]. Computer Engineering and Design, 2010, 31(23): 5032-5035.)
[8] 张怡文, 王冉, 程家兴. 基于用户兴趣度的改进二部图随机游走推荐方法[J]. 计算机应用与软件, 2015, 32(6): 76-79.
[8] (Zhang Yiwen, Wang Ran, Cheng Jiaxing.Improved Recommendation Algorithm of Bipartite Graph Random Walk Based on User Interest Degree[J]. Computer Applications and Software, 2015, 32(6): 76-79.)
[9] 王明佳, 韩景倜. 基于条件型游走二部图协同过滤算法[J]. 计算机应用研究, 2017, 34(12): 3685-3688.
[9] (Wang Mingjia, Han Jingti.Collaborative Filtering Algorithm Based on Conditional Walk Bipartite Graph[J]. Application Research of Computers, 2017, 34(12): 3685-3688.)
[10] Shang M S, Zhang Z K, Zhou T, et al.Collaborative Filtering with Diffusion-Based Similarity on Tripartite Graphs[J]. Physica A: Statistical Mechanics & Its Applications, 2012, 389(6): 1259-1264.
[11] 张艳梅, 王璐, 曹怀虎, 等. 基于用户-兴趣-项目三部图的推荐算法[J]. 模式识别与人工智能, 2015, 28(10): 913-921.
[11] (Zhang Yanmei, Wang Lu, Cao Huaihu, et al.Recommendation Algorithm Based on User-Interest-Item Tripartite Graph[J]. Pattern Recognition and Artificial Intelligence, 2015, 28(10): 913-921.)
[12] 廖志芳, 李玲, 刘丽敏, 等. 三部图张量分解标签推荐算法[J]. 计算机学报, 2012, 35(12): 2625-2632.
[12] (Liao Zhifang, Li Ling, Liu Limin, et al.A Tripartite Decomposition of Tensor for Social Tagging[J]. Chinese Journal of Computers, 2012, 35(12): 2625-2632.)
[13] 陈洁敏, 李建国, 汤非易, 等. 融合“用户-项目-用户兴趣标签图”的协同好友推荐算法[J]. 计算机科学与探索, 2018, 12(1): 92-100.
[13] (Chen Jiemin, Li Jianguo, Tang Feiyi, et al.Combining User-Item-Tag Tripartite Graph and Users Personal Interests for Friends Recommendation[J]. Journal of Frontiers of Computer Science and Technology, 2018, 12(1): 92-100.)
[14] 陈梅梅, 薛康杰. 基于改进张量分解模型的个性化推荐算法研究[J]. 数据分析与知识发现, 2017, 1(3): 38-45.
[14] (Chen Meimei, Xue Kangjie.Personalized Recommendation AlgorithmBased on Modified Tensor Decomposition Model[J]. Data Analysis and Knowledge Discovery, 2017, 1(3): 38-45.)
[15] 王明佳, 韩景倜. 基于条件型游走二部图协同过滤算法[J].计算机应用研究, 2017, 34(12): 3685-3688.
[15] (Wang Mingjia, Han Jingti.Collaborative filtering algorithm based on conditional walk bipartite graph[J]. Application Research of Computers, 2017, 34(12): 3685-3688.)
[16] Harper F M, Konstan J A. The MovieLens Datasets: History and Context[J]. ACM Transactions on Interactive Intelligent Systems, 2016, 5(4): Article No.19.
[17] Li J, Tang Y, Chen J.Leveraging Tagging and Rating for Recommendation: RMF Meets Weighted Diffusion on Tripartite Graphs[J]. Physica A: Statistical Mechanics & Its Applications, 2017, 483: 398-411.
[1] 吴彦文, 蔡秋亭, 刘智, 邓云泽. 融合多源数据和场景相似度计算的数字资源推荐研究*[J]. 数据分析与知识发现, 2021, 5(11): 114-123.
[2] 丁浩, 艾文华, 胡广伟, 李树青, 索炜. 融合用户兴趣波动时序的个性化推荐模型*[J]. 数据分析与知识发现, 2021, 5(11): 45-58.
[3] 于硕,Hayat Dino Bedru,储新倍,袁宇渊,万良田,夏锋. 科学发现偶然性研究综述[J]. 数据分析与知识发现, 2021, 5(1): 16-35.
[4] 杨恒,王思丽,祝忠明,刘巍,王楠. 基于并行协同过滤算法的领域知识推荐模型研究*[J]. 数据分析与知识发现, 2020, 4(6): 15-21.
[5] 魏伟,郭崇慧,邢小宇. 基于语义关联规则的试题知识点标注及试题推荐*[J]. 数据分析与知识发现, 2020, 4(2/3): 182-191.
[6] 温彦,马立健,曾庆田,郭文艳. 基于地理信息偏好修正和社交关系偏好隐式分析的POI推荐 *[J]. 数据分析与知识发现, 2019, 3(8): 30-39.
[7] 焦富森,李树青. 基于物品质量和用户评分修正的协同过滤推荐算法 *[J]. 数据分析与知识发现, 2019, 3(8): 62-67.
[8] 叶佳鑫,熊回香. 基于标签的跨领域资源个性化推荐研究*[J]. 数据分析与知识发现, 2019, 3(2): 21-32.
[9] 聂卉. 结合词向量和词图算法的用户兴趣建模研究 *[J]. 数据分析与知识发现, 2019, 3(12): 30-40.
[10] 丁浩,李树青. 基于用户多类型兴趣波动趋势预测分析的个性化推荐方法 *[J]. 数据分析与知识发现, 2019, 3(11): 43-51.
[11] 李杰, 杨芳, 徐晨曦. 考虑时间动态性和序列模式的个性化推荐算法*[J]. 数据分析与知识发现, 2018, 2(7): 72-80.
[12] 刘东苏, 霍辰辉. 基于图像特征匹配的推荐模型研究*[J]. 数据分析与知识发现, 2018, 2(3): 49-59.
[13] 侯银秀, 李伟卿, 王伟军, 张婷婷. 基于用户偏好与商品属性情感匹配的图书个性化推荐研究*[J]. 数据分析与知识发现, 2017, 1(8): 9-17.
[14] 陈梅梅, 薛康杰. 基于标签簇多构面信任关系的个性化推荐算法研究*[J]. 数据分析与知识发现, 2017, 1(5): 94-101.
[15] 陈梅梅, 薛康杰. 基于改进张量分解模型的个性化推荐算法研究*[J]. 数据分析与知识发现, 2017, 1(3): 38-45.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
版权所有 © 2015 《数据分析与知识发现》编辑部
地址:北京市海淀区中关村北四环西路33号 邮编:100190
电话/传真:(010)82626611-6626,82624938
E-mail:jishu@mail.las.ac.cn