MulSetRank: Multiple set ranking for personalized recommendation from implicit feedback

被引:2
作者
Wang, Chenxu [1 ,2 ]
Yang, Yu [1 ]
Suo, Kaiqiang [1 ]
Wang, Pinghui [2 ]
机构
[1] Xi An Jiao Tong Univ, Sch Software Engn, Xi'an 710049, Peoples R China
[2] Xi An Jiao Tong Univ, MOE Key Lab Intelligent Network & Network Secur, Xi'an, Peoples R China
基金
中国国家自然科学基金;
关键词
Personalized recommendation; Setwise ranking; Potential preference items;
D O I
10.1016/j.knosys.2022.108946
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Learning user preferences from implicit feedback through collaborative ranking is an approach that has received increased attention from researchers in recent years. The existing approaches focus on modeling the ranking differences between observed and unobserved items for independent individuals, ignoring their collaborative effects on the social recommendation. However, homophily theory suggests that, for a specific user, potential preference items can be mined from its friends or users with similar interests. Motivated by this observation, this paper presents a novel setwise ranking model that considers users' preference rankings among multiple sets of items. Unlike existing models, which only consider the preference differences between observed and unobserved items, our model assumes that some potential preference items are in-between. We propose a collaborative method that exploits users' behavioral similarities to mine users' potential preference items. Our approach allows us to capture users' collaborative signals at a finer granularity. We also develop a sampling method to efficiently compute the setwise preference probability. Finally, we conduct extensive experiments to evaluate the effectiveness and efficiency of the proposed model based on several benchmark datasets. The experimental results demonstrate that our approach outperforms the state-of-the-art methods. (C) 2022 Elsevier B.V. All rights reserved.
引用
收藏
页数:11
相关论文
共 69 条
  • [1] [Anonymous], 2008, PROC 25 INT C MACH L, DOI [10.1145/1390156.1390306, DOI 10.1145/1390156.1390306]
  • [2] [Anonymous], 2009, Proceeding of the 18th ACM conference on Information and knowledge management, CIKM 2009
  • [3] [Anonymous], 2007, ADV NEURAL INFORM PR
  • [4] Badrul S., 2001, P 10 INT C WORLD WID, P285, DOI DOI 10.1145/371920.372071
  • [5] Bawa M, 2005, WORLD WID WEB C, pPP651, DOI [10.1145/1060745.1060840, DOI 10.1145/1060745.1060840]
  • [6] Cantador Ivan, 2011, P RECSYS
  • [7] Cao Z., 2007, P 24 INT C MACH LEAR, P129
  • [8] Efficient algorithms for ranking with SVMs
    Chapelle, O.
    Keerthi, S. S.
    [J]. INFORMATION RETRIEVAL, 2010, 13 (03): : 201 - 215
  • [9] Efficient Neural Matrix Factorization without Sampling for Recommendation
    Chen, Chong
    Min, Zhang
    Zhang, Yongfeng
    Liu, Yiqun
    Ma, Shaoping
    [J]. ACM TRANSACTIONS ON INFORMATION SYSTEMS, 2020, 38 (02)
  • [10] An Efficient Adaptive Transfer Neural Network for Social-aware Recommendation
    Chen, Chong
    Zhang, Min
    Wang, Chenyang
    Ma, Weizhi
    Li, Minming
    Liu, Yiqun
    Ma, Shaoping
    [J]. PROCEEDINGS OF THE 42ND INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL (SIGIR '19), 2019, : 225 - 234