欢迎访问陕西师范大学学报(自然科学版)官方网站!
人工智能专题

基于上下文与马尔科夫矩阵分解的流式推荐算法

  • 纪淑娟 ,
  • 申彦博 ,
  • 王振
展开
  • 山东科技大学 计算机科学与工程学院,山东 青岛 266590

收稿日期: 2021-07-19

  网络出版日期: 2022-05-10

基金资助

国家自然科学基金(71772107, 62072288);青岛社会科学规划研究(QDSKL1801138);山东省自然科学基金(ZR2018BF013, ZR2013FM023, ZR2014FP011)

A streaming recommendation algorithm based on context and Markov matrix decomposition

  • JI Shujuan ,
  • SHEN Yanbo ,
  • WANG Zhen
Expand
  • College of Computer Science and Technology, Shandong University of Science and Technology, Qingdao 266590, Shandong, China

Received date: 2021-07-19

  Online published: 2022-05-10

摘要

为了验证用户对项目评分时所处的上下文环境是否会对用户的偏好产生影响,基于矩阵过程的马尔科夫分解方法,提出了一种基于上下文的流式推荐算法(streaming recommendation algorithm based on context,C-SRA),该方法可以从嘈杂的上下文中有效选取与评分相关的上下文信息,并将选取的上下文信息分为主观上下文和客观上下文两类。基于LDOS-CoMoDa数据集的两组对比实验显示,C-SRA算法无论是评分预测性能还是推荐性能均优于其他对比算法。

本文引用格式

纪淑娟 , 申彦博 , 王振 . 基于上下文与马尔科夫矩阵分解的流式推荐算法[J]. 陕西师范大学学报(自然科学版), 2022 , 50(3) : 104 -111 . DOI: 10.15983/j.cnki.jsnu.2022112

Abstract

In order to verify whether the context environment in which users rate items would affect their preferences, according to the Markovian factorization of matrix processes method, a streaming recommendation algorithm based on context (C-SRA) is proposed. On the basis of this method, the selected context information is divided into subjective context and objective context, and the two types of context information and algorithm are integrated in turn. Finally, two groups of experiments based on LDOS-CoMoDa data set show that the C-SRA performed better than the other comparison algorithms in both rate prediction and the recommendation.

参考文献

[1] LOMBARDI S, ANAND S S, GORGOGLIONE M.Context and customer behaviour in recommendation[C]//Proceedings of the Third ACM Conference on Recommender Systems (RecSys'09), New York,USA: ACM Press, 2009.
[2] BALTRUNAS L, RICCI F.Context-dependent items generation in collaborativefiltering[C]//Proceedings of the Third ACM Conference on Recommender Systems (RecSys'09), New York,USA: ACM Press, 2009.
[3] KARATZOGLOU A,AMATRIAIN X,BALTRUNAS L,et al.Multiverse recommendation:N-dimensional tensor factorization for context-aware collaborative filtering[C]//Proceedings of the Fourth ACM Conference on Recommender Systems(RecSys'10).New York,USA:ACM,2010.
[4] OKU K,NAKAJIMA S,MIYAZAKI J,et al.Context-aware SVM for context-dependent information recommendation[C]//7th International Conference on Mobile Data Management (MDM'06).Nara,Japan:IEEE,2006:109.
[5] KIM S,YOON Y I.Architecture of 4-way tensor factorization for context-aware recommendations[C]//2016 International Conference on Big Data and Smart Computing (BigComp).Hong Kong,China:IEEE,2016:18-23.
[6] WU W M,ZHAO J L,ZHANG C S,et al.Improving performance of tensor-based context-aware recommenders using Bias tensor factorization with context feature auto-encoding[J].Knowledge-Based Systems,2017,128:71-77.
[7] HENZINGER M,RAGHAVAN P,RAJAGOPALAN S.Computing on data streams[M]//External Memory Algorithms.Providence:American Mathematical Society,1999:107-118.
[8] AGARWAL D,CHEN B C,ELANGO P.Fast online learning through offline initialization for time-sensitive recommendation[C]//KDD'10:Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.Washington DC,USA:ACM,2010:703-712.
[9] BHARGAVA P,PHAN T,ZHOU J Y,et al.Who,what,when,and where:multi-dimensional collaborative recommendations using tensor factorization on sparse user-generated data[C]//Proceedings of the 24th International Conference on World Wide Web.Florence,Italy:Republic and Canton of Geneva,2015:130-140.
[10] PENG F R,LU X,MA C,et al.Multi-level preference regression for cold-start recommendations[J].International Journal of Machine Learning and Cybernetics,2018,9(7):1117-1130.
[11] DING Y,LI X.Time weight collaborative filtering[C]//CIKM'05:Proceedings of the 14th ACM International Conference on Information and Knowledge Management.Bremen,Germany:ACM,2005:485-492.
[12] KOREN Y.Collaborative filtering with temporal dynamics[C]//KDD'09:Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.Paris,France:ACM,2009:447-456.
[13] YIN D W,HONG L J,XUE Z Z,et al.Temporal dynamics of user interests in tagging systems[C]//AAAI'11:Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence.San Francisco,USA:ACM,2011:1279-1285.
[14] ZHANG D,MAO R,LI W.The recurrence dynamics of social tagging[C]//Proceedings of the 18th International Conference on World Wide Web-WWW'09.Madrid,Spain:ACM,2009.
[15] ZHANG R C,MAO Y Y.Movie recommendation via Markovian factorization of matrix processes[J].IEEE Access,2019,7:13189-13199.
[16] 申彦博.基于上下文的流式推荐算法研究[D].青岛:山东科技大学,2020.
SHEN Y B.Research on the streaming recommendation algorithms based on context[D].Qingdao:Shandong University of Science and Technology,2020.
[17] ZHENG Y,MOBASHER B,BURKE R.Incorporating context correlation into context-aware matrix factorization[C]//CPCR+ITWP'15:Proceedings of the 2015 International Conference on Constraints and Preferences for Configuration and Recommendation and Intelligent Techniques for Web Personalization.Buenos Aires,Argentina:IJCAI,2015:21-27.
[18] 张聪.一种基于树结构的三支增量聚类算法研究[D].重庆: 重庆邮电大学, 2015.
ZHANG C.Study on a tree-based incremental three-way decision clustering algorithm[D].Chongqing: Chongqing University of Posts and Telecommunications, 2015.
[19] SALAKHUTDINOV R R, MNIH A. Probabilistic matrix factorization[M].San Francisco:Curran and Associates Inc.,2007.
文章导航

/