基于评分预测与排序预测的协同过滤推荐算法

doi:10.3969/j.issn.0372-2112.2017.12.033

电子学报 ›› 2017, Vol. 45 ›› Issue (12): 3070-3075.DOI: 10.3969/j.issn.0372-2112.2017.12.033

基于评分预测与排序预测的协同过滤推荐算法

李改¹, 陈强³, 李磊²

1. 顺德职业技术学院电子与信息工程学院, 广东顺德 528333;
2. 中山大学数据科学与计算机学院, 广东广州 510006;
3. 广东第二师范学院计算机科学系, 广东广州 510303

收稿日期:2016-09-13 修回日期:2017-02-28 出版日期:2017-12-25
- 作者简介:
- 李改,男,1981年生于湖北松滋.现为顺德职业技术学院电子与信息工程学院副教授.主要研究方向为数据挖掘,推荐系统,机器学习.E-mail:ligai999@126.com;陈强,男,1963年生于广东化州.现为广东第二师范学院计算机系教授,主要研究领域为数据挖掘,知识表示.E-mail:21115903@qq.com
- 基金资助:
- 国家自然科学基金 (No.61370186，No.61640222）; 广东省自然科学基金项目 (No.2016A030310018）; 广东省科技计划项目 (No.2014A010103040，No.2014B010116001）; 广州市科技计划项目 (No.201604010049，No.201510010203）; 广东第二师范学院教授博士科研专项 (No.2015ARF25）

Collaborative Filtering Recommendation Algorithm Based on Rating Prediction and Ranking Prediction

LI Gai¹, CHEN Qiang³, LI Lei²

1. Department of Electronic and Information Engineering, Shunde Polytechnic, Foshan, Guangdong 528300, China;
2. School of Data and Computer Science, Sun Yat-Sen University, Guangzhou, Guangdong 510006, China;
3. Department of Computer Science, Guangdong University of Education, Guangzhou, Guangdong 510303, China

Received:2016-09-13 Revised:2017-02-28 Online:2017-12-25 Published:2017-12-25
- Supported by:
- National Natural Science Foundation of China (No.61370186, No.61640222); Program of National Natural Science Foundation of Guangdong Province, China (No.2016A030310018); Science and Technology Project of Guangdong Province (No.2014A010103040, No.2014B010116001); Guangzhou Science and Technology Plan Project (No.201604010049, No.201510010203); Science Research Program of Professors and Ph.D of Guangdong University of Education (No.2015ARF25)

摘要/Abstract

摘要： 协同过滤推荐算法在电子商务领域运用广泛.之前的研究要么仅从评分预测的角度来研究，要么仅从排序预测的角度来研究.为了兼顾这两个方面，本文在传统的基于评分预测的PMF（Probabilistic Matrix Factorization）算法和基于排序预测的xCLiMF（Extended Collaborative Less-is-More Filtering）算法的基础上提出了一种基于评分预测与排序预测的协同过滤推荐算法URA（Unified Recommendation Algorithm），该方法通过在PMF和xCLiMF算法中共享用户和推荐对象的特征空间，利用PMF算法来学习高精度的用户和推荐对象的特征向量，从而进一步增强排序推荐性能.实验验证，该方法在评价指标NDCG和ERR下均优于PMF和xCLiMF算法，且复杂度与评分点个数线性相关.URA算法可运用于互联网信息推荐领域的大数据处理.

关键词: 推荐系统, 协同排序, 协同过滤, 评分预测, 排序预测

Abstract: Collaborative filtering (CF) recommendation algorithm is widely used in the field of e-commerce.The previous researches on CF focused on either rating prediction or ranking prediction.In order to take into account these two aspects,a collaborative filtering recommendation algorithm based on rating prediction and ranking prediction (Unified Recommendation Algorithm,URA) is proposed.URA shares common latent features of users and items in PMF (Probabilistic Matrix Factorization,rating-oriented) and xCLiMF (Extended Collaborative Less-is-More Filtering,ranking-oriented) algorithms,and PMF learns improved latent features of users and items in URA,so that URA improves the performance of ranking recommendation.Experimental results showed that our proposed URA Algorithm outperformed PMF and xCLiMF algorithms over evaluation metrics NDCG and ERR,and that the complexity of URA is shown to be linear with the number of observed ratings.URA is suitable for big data processing in the field of internet information recommendation.

Key words: recommended systems, collaborative ranking, collaborative filtering, rating prediction, ranking prediction

中图分类号:

TP302

李改, 陈强, 李磊. 基于评分预测与排序预测的协同过滤推荐算法[J]. 电子学报, 2017, 45(12): 3070-3075.

LI Gai, CHEN Qiang, LI Lei . Collaborative Filtering Recommendation Algorithm Based on Rating Prediction and Ranking Prediction[J]. Acta Electronica Sinica, 2017, 45(12): 3070-3075.

参考文献

[1] Adomavicius G,Tuzhilin A.Toward the next generation of recommender systems:a survey of the state-of-the-art and possible extenstions[J].IEEE Transactions on Knowledge and Data Engineering,2005,17(6):734-749.
[2] Ricci F,Rokach L,Shapira B,et al.Recommender System Handbook[M].New York,USA:Springer,2011.
[3] Salakhutdinov R,Mnih A.Probabilistic matrix factorization[A].Proceedings of the 21st Annual Conference on Neural Information Processing Systems[C].Vancouver B C,Canada:ACM,2007.252-260.
[4] Deshpande M,Karypis G.Item-based top-n recommendation algorithms[J].ACM Transactions on Information Systems,2003,22(1):143-177.
[5] Koren Y.Factorization meets the neighborhood:a multifaceted collaborative filtering model[A].Proceedings of the 25th International Conference on Knowledge Discovery and Data Mining[C].Las Vegas:ACM,2008.426-434.
[6] Zhu X W,Ming Z Y,Hao Y,et al.Tackling data sparseness in recommendation using social media based topic hierarchy modeling[A].Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence[C].Buenos Aires,Argentina:ACM,2015.2415-2421.
[7] Li G,Ou W H.Pairwise probabilistic matrix factorization for implicit feedback collaborative filtering[J].Neurocomputing,2016,204:17-25.
[8] Li G,Wang L Y,Ou W H.Robust personalized ranking from implicit feedback[J].International Journal of Pattern Recognition and Artificial Intelligence,2015,30(1):1-28.
[9] Li G,Chen Q.Exploiting explicit and implicit feedbacks for personalized ranking[J].Mathematical Problems in Engineering,2016,2016:1-11.
[10] Liu T Y.Learning to Rank for Information Retrieval[M].Berlin:Springer,2011.
[11] Yao W L,He J,Huang G Y,et al.SoRank:Incorporating social information into learning to rank models for recommendation[A].Proceedings of the 23th ACM International Conference on World Wide Web[C].Seoul,Korea:ACM,2014.409-410.
[12] Weimer M,Karatzoglou A,Le Q V,et al.CofiRank-maximum margin matrix factorization for collaborative ranking[A].Proceedings of the 21th Conference on Advances in Neural Information Processing Systems[C].Vancouver B C,Canada:Curran Associates,Inc,2007.79-86.
[13] Liu N N,Yang Q.Eigenrank:a ranking-oriented approach to collaborative filtering[A].Proceedings of the 31th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval[C].Singapore:ACM Press,2008.83-90.
[14] Shi Y,Karatzoglou A,Baltrunas L,et al.xCLiMF:Optimizing expected reciprocal rank for data with multiple levels of relevance[A].Proceedings of the Sixth ACM Conference on Recommender Systems[C].Hongkong:ACM Press,2013.431-433.
[15] Liu N N,Zhao M,Yang Q.Probabilistic latent preference analysis for collaborative filtering[A].Proceedings of ACM International Conference on Information and Knowledge Management[C].Hong Kong,China:ACM,2009.759-766.
[16] Shi Y,Larson M,Hanjalic A.List-wise learning to rank with matrix factorization for collaborative filtering[A].Proceedings of the Fourth ACM Conference on Recommender Systems[C].New York,USA:ACM,2010.269-272.
[17] Shi Y,Larson M,Hanjalic A.Unifying rating-oriented and ranking-oriented collaborative filtering for improved recommendation[J].Information Sciences,2013,229(6):29-39.

基于评分预测与排序预测的协同过滤推荐算法

Collaborative Filtering Recommendation Algorithm Based on Rating Prediction and Ranking Prediction

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

[1]	曹阳, 高旻, 余俊良, 范琪琳, 荣文戈, 文俊浩. 基于双图混合随机游走的社会化推荐模型[J]. 电子学报, 2023, 51(2): 286-296.
[2]	梁顺攀, 刘伟, 郑智中, 原福永. 基于方面和胶囊网络的跨域评分预测模型[J]. 电子学报, 2022, 50(9): 2102-2109.
[3]	张帅, 高旻, 文俊浩, 熊庆宇, 唐旭. 基于自监督学习的去流行度偏差推荐方法[J]. 电子学报, 2022, 50(10): 2361-2371.
[4]	王健, 刘嘉欣, 赵国生, 赵中楠. 移动群智感知中基于协同排序的任务推荐方法[J]. 电子学报, 2021, 49(10): 2012-2019.
[5]	郑孝遥, 罗永龙, 汪祥舜, 孙丽萍, 陈付龙, 胡桂银, 汪小寒. 基于位置服务的分布式差分隐私推荐方法研究[J]. 电子学报, 2021, 49(1): 99-110.
[6]	郭景峰, 朱晓松, 李爽. 直播电视推荐系统的评分预测算法研究[J]. 电子学报, 2020, 48(9): 1735-1740.
[7]	黄名选, 蒋曹清. 基于项权值排序挖掘的跨语言查询扩展[J]. 电子学报, 2020, 48(3): 568-576.
[8]	任开旭, 王玉龙, 刘同存, 李炜. 融合多维语义表示的概率矩阵分解模型[J]. 电子学报, 2019, 47(9): 1848-1854.
[9]	刘露, 胡封晔, 牛亮, 彭涛. 异质网络中基于节点影响力的相似度度量方法[J]. 电子学报, 2019, 47(9): 1929-1936.
[10]	肖云鹏, 孙华超, 戴天骥, 李茜, 李暾. 一种基于云模型的社交网络推荐系统评分预测方法[J]. 电子学报, 2018, 46(7): 1762-1767.
[11]	肖云鹏, 刘晏驰, 刘红, 刘媛妮. 一种基于动态角色标识和张量分解的推荐模型[J]. 电子学报, 2018, 46(3): 569-574.
[12]	鲜征征, 李启良, 黄晓宇, 陆寄远, 李磊. 融合显/隐式信任协同过滤算法的差分隐私保护[J]. 电子学报, 2018, 46(12): 3050-3059.
[13]	黄名选, 蒋曹清. 基于完全加权正负关联模式挖掘的越-英跨语言查询译后扩展[J]. 电子学报, 2018, 46(12): 3029-3036.
[14]	俞东进, 陈聪, 吴建华, 陈耀旺. 基于隐式反馈数据的个性化游戏推荐[J]. 电子学报, 2018, 46(11): 2626-2632.
[15]	范利云, 左万利, 王英, 王鑫. 一种基于差分隐私和时序的推荐系统模型研究[J]. 电子学报, 2017, 45(9): 2057-2064.