计算机科学 ›› 2020, Vol. 47 ›› Issue (6A): 494-499.doi: 10.11896/JsJkx.190900016

• 数据库 & 大数据 & 数据科学 • 上一篇    下一篇

基于牛顿法的自适应高阶评分距离推荐模型研究

邹海涛, 郑尚, 王琦, 于化龙, 高尚   

  1. 江苏科技大学计算机学院 江苏 镇江 212003
  • 发布日期:2020-07-07
  • 通讯作者: 高尚(gao_shang@sohu.com)
  • 作者简介:nkroben@outlook.com
  • 基金资助:
    江苏省高等学校自然科学研究基金(18JBK520011);镇江市重点研发计划-社会发展(SH2019021)

Adaptive High-order Rating Distance Recommendation Model Based on Newton Optimization

ZOU Hai-tao, ZHENG Shang, WANG Qi, YU Hua-long and GAO Shang   

  1. School of Computer Science,Jiangsu University of Science and Technology,ZhenJiang,Jiangsu 212003,China
  • Published:2020-07-07
  • About author:ZOU Hai-tao, born in 1984, Ph.D, lecturer.His main research interests include data mining and information retrieval.
    GAO Shang, born in 1972, Ph.D, professor, is a member of China Computer Federation.His main research interests include intelligent computing and pattern recognition.
  • Supported by:
    This work was suppored by the Natural Science Foundation of the Higher Education Institutions of Jiangsu Province, China (18JBK520011) and Primary Research & Developement Plan (Social development) of ZhenJiang City (SH2019021).

摘要: 现有的一些算法引入了隐语义模型克服数据稀缺带来的问题,为用户提供更有效的推荐。一般情况下,这些方法通过线性组合若干多项式,引入相应参数平衡各个部分比重,以构造优化函数,最终达到最小评分误差或实现最大的偏好等目的。经典模型通常只考虑用户对某一产品的预测评分和实际评分差异(即,一阶评分距离),忽略了其在不同产品上的预测评分与实际评分之间的差值 (即,二阶评分距离)。因此,高阶评分距离模型同时将两种距离集成到算法之中,并使用随机梯度下降法求解目标函数。可是,上述优化函数中的相关参数往往是手动设置,而且随机梯度下降法求解目标函数的收敛速度较慢,使得该模型缺乏灵活性,也增加了时间消耗。为了提高模型的适应性和效率,文中提出了一种融合归一化函数的自适应高阶评价距离模型,并利用牛顿法求解改进后的高阶评分距离凸优化函数。此方法不仅移除了若干静态参数,而且加快了优化函数的收敛速度。提出的模型具有坚实的理论支持,经过3个实际数据集的实验结果表明,此模型具有较好的预测精度和运行效率。

关键词: 高价评分距离, 牛顿法, 凸优化, 推荐系统, 隐语义模型

Abstract: Some existing recommendation algorithms introduce latent factor model to overcome the problems caused by data scarcity,so as to provide more effective recommendations for users.In general,those methods construct an optimization function to achieve the minimum rating error or maximum preference,etc,by integrating several polynomials with the corresponding parameters to balance each part,and use stochastic gradient descent to solve this function.Nevertheless,the above mentioned models only consider the difference between the estimated and real ratings of the same user-item pair (i.e.,the first-order rating distance),and ignore the difference between the estimated and real ratings of the same user across different items (i.e.,the second-order rating distance).Hence,high-order rating distance model,HoORaYs,with good accuracy in terms of item ranking and predictive ratings which takes these two kinds of distances into account is proposed.Unfortunately,this model still has some flaws in adap-tability and efficiency due to its manually setting parameters,its non-convergence.Aiming at improving the recommendation adap-tability and efficiency,an adaptive high-order rating distance model which integrates a data scale sensitive function is proposed.It utilizes Newton method to solve the convex optimization problem about rating distance.This method not only eliminates manually setting parameters,but also accelerates the optimization function convergence speed.The proposed model has a solid theoretical support.Experiments on three real datasets show that,it has good prediction accuracy and operation efficiency.

Key words: Convex optimization, High-order rating distance, Latent factor model, Newton method, Recommender systems

中图分类号: 

  • TP181
[1] KABBUR S,NING X,KARYPIS G.FISM:factored item similarity models for top-N recommender systems//Internatio-nal Conference on Knowledge Discovery & Data Mining,2013:659-667.
[2] ZHOU K,ZHA H.Learning binary codes for collaborative filtering//International Conference on Knowledge Discovery and Data Mining.2012:498-506.
[3] ZHANG Z,WANG Q,RUAN L,et al.Preference preserving hashing for efficient recommendation//International Confe-rence on Research and Development in Information Retrieval.2014:183-192.
[4] BHARGAVA P,PHAN T,ZHOU J,et al.Who,What,When,and Where:Multi-Dimensional Collaborative Recommendations Using Tensor Factorization on Sparse User-Generated Data//International Conference on World Wide Web.2015:130-140.
[5] CHENG Z,YING D,LEI Z,et al.Aspect-aware latent factor model:rating prediction with ratings and reviews//International Conference on World Wide Web.2018:639-648.
[6] XU J,YAO Y,TONG H,et al.HoORaYs:High-order optimization of rating distance for recommender systems//Procee-dings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD ’17).2017:525-534.
[7] ZOU H,GONG Z,HU W.Identifying diverse reviews about products.World Wide Web,2017,20(2):351-369.
[8] LIANG D,ALTOSAAR J,CHARLIN L,et al.Factorization meets the item embedding:regularizing matrix factorization with item co-occurrence//International Conference on Recommender Systems.2016:59-66.
[9] GEMULLA R,NIJKAMP E,HAAS P J,et al.Large-scale matrix factorization with distributed stochastic gradient descent//International Conference on Knowledge Discovery and Data Mining,2011:69-77.
[10] XU C,ZHENG Q,ZHANG Y,et al.Learning to rank features for recommendation over multiple categories//International Conference on Research and Development in Information Retrieval.2016:305-314.
[11] GUO G,ZHANG J,YORKE-SMITH N.Trustsvd:Collabora tive filtering with both the explicit and implicit influence of user trust and of item ratings//Twenty-ninth AAAI Conference on Artificial Intelligence.2015:123-129.
[12] OH J,HAN W S,YU H,et al.Fast and robust parallel SGD matrix factorization//International Conference onKnow-ledge Discovery and Data Mining.2015:865-874.
[13] WU L,HSIEH C J,SHARPNACK J.Large-scale collaborative ranking in near-linear time//International Conference on Knowledge Discovery and Data Mining.2017:515-524.
[14] HESTENES M R,STIEFEL E.Methods of conJugate gradients for solving linear systems.J.Res.Nat.Bur.Stand,1952,49(6):409-436.
[15] RODIN E Y.Nonlinear programming analysis and methods.Computers & Mathematics with Applications,1977,3(2):151-151.
[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] 郭亮, 杨兴耀, 于炯, 韩晨, 黄仲浩.
基于注意力机制和门控网络相结合的混合推荐系统
Hybrid Recommender System Based on Attention Mechanisms and Gating Network
计算机科学, 2022, 49(6): 158-164. https://doi.org/10.11896/jsjkx.210500013
[10] 熊中敏, 舒贵文, 郭怀宇.
融合用户偏好的图神经网络推荐模型
Graph Neural Network Recommendation Model Integrating User Preferences
计算机科学, 2022, 49(6): 165-171. https://doi.org/10.11896/jsjkx.210400276
[11] 洪志理, 赖俊, 曹雷, 陈希亮, 徐志雄.
基于遗憾探索的竞争网络强化学习智能推荐方法研究
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
[12] 余皑欣, 冯秀芳, 孙静宇.
结合物品相似性的社交信任推荐算法
Social Trust Recommendation Algorithm Combining Item Similarity
计算机科学, 2022, 49(5): 144-151. https://doi.org/10.11896/jsjkx.210300217
[13] 陈壮, 邹海涛, 郑尚, 于化龙, 高尚.
基于用户覆盖及评分差异的多样性推荐算法
Diversity Recommendation Algorithm Based on User Coverage and Rating Differences
计算机科学, 2022, 49(5): 159-164. https://doi.org/10.11896/jsjkx.210300263
[14] 喻昕, 林植良.
解决一类非光滑伪凸优化问题的新型神经网络
Novel Neural Network for Dealing with a Kind of Non-smooth Pseudoconvex Optimization Problems
计算机科学, 2022, 49(5): 227-234. https://doi.org/10.11896/jsjkx.210400179
[15] 陈晋鹏, 胡哈蕾, 张帆, 曹源, 孙鹏飞.
融合时间特性和用户偏好的卷积序列化推荐
Convolutional Sequential Recommendation with Temporal Feature and User Preference
计算机科学, 2022, 49(1): 115-120. https://doi.org/10.11896/jsjkx.201200192
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!