Computer Science ›› 2022, Vol. 49 ›› Issue (5): 159-164.doi: 10.11896/jsjkx.210300263

• Database & Big Data & Data Science • Previous Articles     Next Articles

Diversity Recommendation Algorithm Based on User Coverage and Rating Differences

CHEN Zhuang, ZOU Hai-tao, ZHENG Shang, YU Hua-long, GAO Shang   

  1. College of Computer,Jiangsu University of Science and Technology,Zhenjiang,Jiangsu 212003,China
  • Received:2021-03-25 Revised:2021-08-07 Online:2022-05-15 Published:2022-05-06
  • About author:CHEN Zhuang,born in 1995,postgra-duate.His main research interests include recommender system and so on.
    ZOU Hai-tao,born in 1984,Ph.D,lecturer.His main research interests include data mining and information retrieval.

Abstract: Traditional recommender systems usually focus on improving recommendation accuracy while neglecting the diversity of recommendation lists.However,several studies have shown that,users’ diversity needs also take an important part of their sa-tisfaction.In this paper,a user-coverage model based on item rating differences is proposed.During generating user’s interest domain(user coverage),on the one hand,the model combines rating differences between users across an item with user-coverage model effectively,thus obtaining a more precise interest domain of the user.On the other hand,objective function is constructed in the form of vector by mapping a user’s and an itemset’s interest domain to two m-dimensional vectors (called user vector and itemset vector respectively),which can reduce the number of iterations in the calculation process.In addition,a new items selection strategy is provided by similarity relationship between those two m-dimensional vectors.The proposed model has superior performance in both accuracy and diversity.User vector for a specific user is a constant,however,finding the most matching itemset vector will be an NP-hard problem.During the implementation of the proposed model,a greedy algorithm is chosen to solve the optimization problem based on critical theoretical boundary.Experimental comparisons with the state-of-the-arts related to diversity recommendation in recent years on two real-world data sets demonstrate that the proposed algorithm can effectively improve the diversity of the recommendation.

Key words: Diversity, Rating differences, Recommender systems, Similarity, User coverage

CLC Number: 

  • TP181
[1]NAHTA R,MEENA Y K,GOPALANI D,et al.Embeddingmetadata using deep collaborative filtering to address the cold start problem for the rating prediction task[J].Multimedia Tools and Applications,2021,80(12):18553-18581.
[2]XU J,YAO Y,TONG H,et al.HoORaYs:High-order optimization of rating distance for recommender systems[C]//Procee-dings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD ’17).2017:525-534.
[3]HE Y,ZOU H,YU H,et al.Adaptive and efficient high-orderrating distance optimization model with slack variable[J].Knowledge-Based Systems,2020,205:106228.
[4]ZHANG Q,LIU L,WEN J H.Recommendation Algorithm withField Trust and Distrust Based on SVD[J].Computer Science,2019,46(10):27-31.
[5]MCNEE S M,RIEDL J,KONSTAN J A.Being accurate is not enough:How accuracy metrics have hurt recommender systems[C]//Extended Abstracts Proceedings of the 2006 Conference on Human Factors in Computing Systems.2006:1097-1101.
[6]CREMONESI P,F GARZOTTO,NEGRO S,et al.Looking for “Good” Recommendations:A Comparative Evaluation of Re-commender Systems[M]//Human-computer Interaction-INTERACT,2011.Berlin:Springer,2011:152-168.
[7]CHENG P,WANG S,MA J,et al.Learning to Recommend Accurate and Diverse Items[C]//Proceedings of the 26th International Conference on World Wide Web.2017:183-192.
[8]SHA C,WU X,NIU J.A Framework for Recommending Relevant and Diverse Items[C]//Proceedings of the 25th International Joint Conference on Artificial Intelligence.2016:3868-3875.
[9]PANTELI A,BOUTSINAS B.Improvement of similarity-diversity trade-off in recommender systems based on a facility location model[J].Neural Computing and Applications,2021(5):1-13.
[10]LE W,LIU Q,CHEN E H,et al.Relevance Meets Coverage:A Unified Framework to Generate Diversified Recommendations[J].ACM Transactions on Intelligent Systems and Technology,2016,7(3):1-30.
[11]SALAKHUTDINOV R.Probabilistic Matrix Factorization[C]//Proceedings of the 20th International Conference on Neural Information Processing Systems.2007:1257-1264.
[12]SHAMEEM A P P,NICOLAS U,YVES G.A Coverage-Based Approach to Recommendation Diversity On Similarity Graph[C]//Proceedings of the 10th ACM Conference on Recommender Systems.2016:15-22.
[13]HE Y,ZOU H,YU H,et al.Diversity-Aware Recommendation by User Interest Domain Coverage Maximization[C]//2019 IEEE International Conference on Data Mining (ICDM).2019:1084-1089.
[14]AZIN A,BRANISLAV K,SHLOMOB,et al.Optimal Greedy Diversity for Recommendation[C]//IJCAI.2015:1742-1748.
[15]HOCHBA,DORIT S.Approximation Algorithms for NP-Hard Problems[J].ACM SIGACT News,1997,28(2):40-52.
[16]FISHER M L,NEMHAUSER G L,WOLSEY L A.An Analysis of Approximations for Maximizing Submodular Set Functions I[J].Mathematical Programming,1978,14(1):265-294.
[1] WU Zi-yi, LI Shao-mei, JIANG Meng-han, ZHANG Jian-peng. Ontology Alignment Method Based on Self-attention [J]. Computer Science, 2022, 49(9): 215-220.
[2] CHAI Hui-min, ZHANG Yong, FANG Min. Aerial Target Grouping Method Based on Feature Similarity Clustering [J]. Computer Science, 2022, 49(9): 70-75.
[3] ZHENG Wen-ping, LIU Mei-lin, YANG Gui. Community Detection Algorithm Based on Node Stability and Neighbor Similarity [J]. Computer Science, 2022, 49(9): 83-91.
[4] LI Bin, WAN Yuan. Unsupervised Multi-view Feature Selection Based on Similarity Matrix Learning and Matrix Alignment [J]. Computer Science, 2022, 49(8): 86-96.
[5] ZENG Zhi-xian, CAO Jian-jun, WENG Nian-feng, JIANG Guo-quan, XU Bin. Fine-grained Semantic Association Video-Text Cross-modal Entity Resolution Based on Attention Mechanism [J]. Computer Science, 2022, 49(7): 106-112.
[6] HUANG Shao-bin, SUN Xue-wei, LI Rong-sheng. Relation Classification Method Based on Cross-sentence Contextual Information for Neural Network [J]. Computer Science, 2022, 49(6A): 119-124.
[7] CAI Xiao-juan, TAN Wen-an. Improved Collaborative Filtering Algorithm Combining Similarity and Trust [J]. Computer Science, 2022, 49(6A): 238-241.
[8] WANG Yi, LI Zheng-hao, CHEN Xing. Recommendation of Android Application Services via User Scenarios [J]. Computer Science, 2022, 49(6A): 267-271.
[9] WANG Yu-fei, CHEN Wen. Tri-training Algorithm Based on DECORATE Ensemble Learning and Credibility Assessment [J]. Computer Science, 2022, 49(6): 127-133.
[10] CHENG Ke-yang, WANG Ning, CUI Hong-gang, ZHAN Yong-zhao. Interpretability Optimization Method Based on Mutual Transfer of Local Attention Map [J]. Computer Science, 2022, 49(5): 64-70.
[11] YANG Xu-hua, WANG Lei, YE Lei, ZHANG Duan, ZHOU Yan-bo, LONG Hai-xia. Complex Network Community Detection Algorithm Based on Node Similarity and Network Embedding [J]. Computer Science, 2022, 49(3): 121-128.
[12] YU Dong, XIE Wan-ying, GU Shu-hao, FENG Yang. Similarity-based Curriculum Learning for Multilingual Neural Machine Translation [J]. Computer Science, 2022, 49(1): 24-30.
[13] LIU Yi, MAO Ying-chi, CHENG Yang-kun, GAO Jian, WANG Long-bao. Locality and Consistency Based Sequential Ensemble Method for Outlier Detection [J]. Computer Science, 2022, 49(1): 146-152.
[14] LUO Yue-tong, WANG Tao, YANG Meng-nan, ZHANG Yan-kong. Historical Driving Track Set Based Visual Vehicle Behavior Analytic Method [J]. Computer Science, 2021, 48(9): 86-94.
[15] ZHENG Jian-wei, HUANG Juan-juan, QIN Meng-jie, XU Hong-hui, LIU Zhi. Hyperspectral Image Denoising Based on Non-local Similarity and Weighted-truncated NuclearNorm [J]. Computer Science, 2021, 48(9): 160-167.
Full text



No Suggested Reading articles found!