计算机科学 ›› 2018, Vol. 45 ›› Issue (11A): 439-444.

• 大数据与数据挖掘 • 上一篇    下一篇

基于局部模型加权融合的Top-N电影推荐算法

汤颖1, 孙康高1, 秦绪佳1, 周建美2   

  1. 浙江工业大学计算机科学与技术学院 杭州3100231
    南通大学计算机科学与技术学院 江苏 南通2260192
  • 出版日期:2019-02-26 发布日期:2019-02-26
  • 作者简介:汤 颖(1977-),女,博士,副教授,硕士生导师,CCF会员,主要研究方向为信息可视化、数据挖掘和计算机图形图像,E-mail:ytang@zjut.edu.cn;孙康高(1992-),男,硕士生,主要研究方向为数据挖掘、推荐系统;秦绪佳(1968-),男,博士,教授,博士生导师,CCF会员,主要研究方向为数据可视化、计算机图形学;周建美(1977-),女,硕士,副教授,主要研究方向为信息安全、网络数据库。
  • 基金资助:
    本文受国家自然科学基金(71571160,61672462)资助。

Local Model Weighted Ensemble for Top-N Movie Recommendation

TANG Ying1, SUN Kang-gao1, QIN Xu-jia1, ZHOU Jian-mei2   

  1. School of Computer Science and Technology,Zhejiang University of Technology,Hangzhou 310023,China1
    School of Computer Science and Technology,Nantong University,Nantong,Jiangsu 226019,China2
  • Online:2019-02-26 Published:2019-02-26

摘要: 为了解决传统推荐算法使用单一模型无法准确捕获用户偏好的问题,将稀疏线性模型作为基本推荐模型,提出了基于用户聚类的局部模型加权融合算法来实现电影的Top-N个性化推荐。同时,为了实现用户聚类,文中利用LDA主题模型和电影的文本内容信息,提出了语义层次用户特征向量的计算方法,并基于此来实现用户聚类。在豆瓣网电影数据集上的实验验证结果表明,所提局部加权融合推荐算法提升了原始基模型的推荐效果,同时又优于一些传统的经典推荐算法,从而证明了该推荐算法的有效性。

关键词: 模型融合, 推荐系统, 稀疏线性模型, 主题模型

Abstract: In order to solve the problem that the traditional recommendation algorithms can not accurately capture the user preference with a single model,this paper proposed a Top-N personalized recommendation algorithm based on local model weighted ensemble.This recommendation algorithm adopts user clustering to compute the local models and takes the sparse linear model as the basic recommendation model.Meanwhile,the semantic-level feature vector representation of each user was proposed based on LDA topic model and movie text content information,so as to implement user clustering.The experiments of the film data crawled from Douban show that our local model weighted ensemble recommendation algorithm enhances the recommendation quality of the original base model and outperforms some traditional classical recommendation algorithms,which demonstrates the effectiveness of the proposed algorithm.

Key words: Model ensemble, Recommendation system, Sparse linear model, Topic model

中图分类号: 

  • TP301
[1]DESHPANDE M,KARYPIS G.Item-based top-n recommendation algorithms[J].ACM Transactions on Information Systems (TOIS),2004,22(1):143-177.
[2]NING X,KARYPIS G.Slim:Sparse linear methods for top-n recommender systems[C]∥2011 IEEE 11th International Conference on Data Mining (ICDM).IEEE,2011:497-506.
[3]FUNK S.Netflix Update:Try This at Home[OL].http://si-fter.org/~simon/journal/20061211.html.
[4]KOREN Y,BELL R,VOLINSKY C.Matrix factorization techniques for recommender systems[J].Computer,2009,42(8):30-37.
[5]KOREN Y.Factorization meets the neighborhood:a multiface-ted collaborative filtering model[C]∥Proceedings of the 14th ACM SIGKDD international conference on Knowledge Discoveryand Data Mining.ACM,2008:426-434.
[6]KOREN Y.Collaborative filtering with temporal dynamics[J].Communications of the ACM,2010,53(4):89-97.
[7]HU Y,KOREN Y,VOLINSKY C.Collaborative filtering for implicit feedback datasets[C]∥Eighth IEEE International Conference on Data Mining,2008(ICDM’08).IEEE,2008:263-272.
[8]KABBUR S,NING X,KARYPIS G.Fism:factored item simila-rity models for top-n recommender systems[C]∥Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.ACM,2013:659-667.
[9]CREMONESI P,KOREN Y,TURRIN R.Performance of re-commender algorithms on top-n recommendation tasks[C]∥Proceedings of the Fourth ACM Conference on Recommender Systems.ACM,2010:39-46.
[10]KANG Z,PENG C,CHENG Q.Top-N Recommender System via Matrix Completion[C]∥AAAI.2016:179-185.
[11]RENDLE S,FREUDENTHALER C,GANTNER Z,et al.BPR:Bayesian personalized ranking from implicit feedback[C]∥Proceedings of the Twenty-fifth Conference on Uncertainty in Artificial Intelligence.AUAI Press,2009:452-461.
[12]O’CONNOR M,HERLOCKER J.Clustering items for collaborative filtering[C]∥Proceedings of the ACM SIGIR Workshop on Recommender Systems.UC Berkeley,1999:128.
[13]XU B,BU J,CHEN C,et al.An exploration of improving colla-borative recommender systems via user-item subgroups[C]∥Proceedings of the 21st International Conference on World Wide Web.ACM,2012:21-30.
[14]LEE J,KIM S,LEBANON G,et al.Local low-rank matrix approximation[C]∥International Conference on Machine Lear-ning.2013:82-90.
[15]LEE J,BENGIO S,KIM S,et al.Local collaborative ranking[C]∥Proceedings of the 23rd International Conference on World Wide Web.ACM,2014:85-96.
[16]CHRISTAKOPOULOU E,KARYPIS G.Local item-item mo-dels for top-n recommendation [C]∥Proceedings of the 10th ACM Conference on Recommender Systems.ACM,2016:67-74.
[17]BLEI D M,NG A Y,JORDAN M I.Latent dirichlet allocation[J].Journal of Machine Learning Research,2003,3(1):993-1022.
[18]HOFFMAN M,BACH F R,BLEI D M.Online learning for latent dirichlet allocation[C]∥Advances in Neural Information Processing Systems.2010:856-864.
[19]SEDHAIN S,MENON A K,SANNER S,et al.Autorec:Autoencoders meet collaborative filtering[C]∥Proceedings of the 24th International Conference on World Wide Web.ACM,2015:111-112.
[20]CHENG H T,KOC L,HARMSEN J,et al.Wide & deep lear-ning for recommender systems[C]∥Proceedings of the 1st Workshop on Deep Learning for Recommender Systems.ACM,2016:7-10.
[1] 程章桃, 钟婷, 张晟铭, 周帆.
基于图学习的推荐系统研究综述
Survey of Recommender Systems Based on Graph Learning
计算机科学, 2022, 49(9): 1-13. https://doi.org/10.11896/jsjkx.210900072
[2] 王冠宇, 钟婷, 冯宇, 周帆.
基于矢量量化编码的协同过滤推荐方法
Collaborative Filtering Recommendation Method Based on Vector Quantization Coding
计算机科学, 2022, 49(9): 48-54. https://doi.org/10.11896/jsjkx.210700109
[3] 秦琪琦, 张月琴, 王润泽, 张泽华.
基于知识图谱的层次粒化推荐方法
Hierarchical Granulation Recommendation Method Based on Knowledge Graph
计算机科学, 2022, 49(8): 64-69. https://doi.org/10.11896/jsjkx.210600111
[4] 方义秋, 张震坤, 葛君伟.
基于自注意力机制和迁移学习的跨领域推荐算法
Cross-domain Recommendation Algorithm Based on Self-attention Mechanism and Transfer Learning
计算机科学, 2022, 49(8): 70-77. https://doi.org/10.11896/jsjkx.210600011
[5] 帅剑波, 王金策, 黄飞虎, 彭舰.
基于神经架构搜索的点击率预测模型
Click-Through Rate Prediction Model Based on Neural Architecture Search
计算机科学, 2022, 49(7): 10-17. https://doi.org/10.11896/jsjkx.210600009
[6] 齐秀秀, 王佳昊, 李文雄, 周帆.
基于概率元学习的矩阵补全预测融合算法
Fusion Algorithm for Matrix Completion Prediction Based on Probabilistic Meta-learning
计算机科学, 2022, 49(7): 18-24. https://doi.org/10.11896/jsjkx.210600126
[7] 蔡晓娟, 谭文安.
一种改进的融合相似度和信任度的协同过滤算法
Improved Collaborative Filtering Algorithm Combining Similarity and Trust
计算机科学, 2022, 49(6A): 238-241. https://doi.org/10.11896/jsjkx.210400088
[8] 何亦琛, 毛宜军, 谢贤芬, 古万荣.
基于点割集图分割的矩阵变换与分解的推荐算法
Matrix Transformation and Factorization Based on Graph Partitioning by Vertex Separator for Recommendation
计算机科学, 2022, 49(6A): 272-279. https://doi.org/10.11896/jsjkx.210600159
[9] 王君锋, 刘凡, 杨赛, 吕坦悦, 陈峙宇, 许峰.
基于多源迁移学习的大坝裂缝检测
Dam Crack Detection Based on Multi-source Transfer Learning
计算机科学, 2022, 49(6A): 319-324. https://doi.org/10.11896/jsjkx.210500124
[10] 姚烨, 朱怡安, 钱亮, 贾耀, 张黎翔, 刘瑞亮.
一种基于异质模型融合的 Android 终端恶意软件检测方法
Android Malware Detection Method Based on Heterogeneous Model Fusion
计算机科学, 2022, 49(6A): 508-515. https://doi.org/10.11896/jsjkx.210700103
[11] 郭亮, 杨兴耀, 于炯, 韩晨, 黄仲浩.
基于注意力机制和门控网络相结合的混合推荐系统
Hybrid Recommender System Based on Attention Mechanisms and Gating Network
计算机科学, 2022, 49(6): 158-164. https://doi.org/10.11896/jsjkx.210500013
[12] 熊中敏, 舒贵文, 郭怀宇.
融合用户偏好的图神经网络推荐模型
Graph Neural Network Recommendation Model Integrating User Preferences
计算机科学, 2022, 49(6): 165-171. https://doi.org/10.11896/jsjkx.210400276
[13] 洪志理, 赖俊, 曹雷, 陈希亮, 徐志雄.
基于遗憾探索的竞争网络强化学习智能推荐方法研究
Study on Intelligent Recommendation Method of Dueling Network Reinforcement Learning Based on Regret Exploration
计算机科学, 2022, 49(6): 149-157. https://doi.org/10.11896/jsjkx.210600226
[14] 余皑欣, 冯秀芳, 孙静宇.
结合物品相似性的社交信任推荐算法
Social Trust Recommendation Algorithm Combining Item Similarity
计算机科学, 2022, 49(5): 144-151. https://doi.org/10.11896/jsjkx.210300217
[15] 陈壮, 邹海涛, 郑尚, 于化龙, 高尚.
基于用户覆盖及评分差异的多样性推荐算法
Diversity Recommendation Algorithm Based on User Coverage and Rating Differences
计算机科学, 2022, 49(5): 159-164. https://doi.org/10.11896/jsjkx.210300263
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!