IPGAN: Generating Informative Item Pairs by Adversarial Sampling

被引:13
作者
Guo, Guibing [1 ]
Zhou, Huan [1 ]
Chen, Bowei [1 ]
Liu, Zhirong [2 ]
Xu, Xiao [1 ]
Chen, Xu [3 ]
Dong, Zhenhua [1 ]
He, Xiuqiang [1 ]
机构
[1] Northeastern Univ, Software Coll, Shenyang 110819, Peoples R China
[2] Huawei Noahs Ark Lab, Shenzhen 518129, Peoples R China
[3] UCL, Dept Comp Sci, London WC1E 6BT, England
基金
中国国家自然科学基金;
关键词
Correlation; Training; Generative adversarial networks; Learning systems; Noise measurement; Gallium nitride; Standards; Generative adversarial network (GAN); item pair sampling strategy; recommender system;
D O I
10.1109/TNNLS.2020.3028572
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Negative sampling plays an important role in ranking-based recommender models. However, most existing sampling methods cannot generate informative item pairs with positive and negative instances due to two limitations: 1) they merely treat observed items as positive instances, ignoring the existence of potential positive items (i.e., nonobserved items users may prefer) and the probability of observed but noisy items and 2) they fail to capture the relationship between positive and negative items during negative sampling, which may cause the unexpected selection of potential positive items. In this article, we introduce a dynamic sampling strategy to search informative item pairs. Specifically, we first sample a positive instance from all the items by leveraging the overall features of user's observed items. Then, we strategically select a negative instance by considering its correlation with the sampled positive one. Formally, we propose an item pair generative adversarial network named IPGAN, where our sampling strategy is realized in two generative models for positive and negative instances, respectively. In addition, IPGAN can also ensure that the sampled item pairs are informative relative to the ground truth by a discriminative model. What is more, we propose a batch-training approach to further enhance both user and item modeling by alleviating the special bias (noise) from different users. This approach can also significantly accelerate the process of model training compared with classical GAN method for recommendation. Experimental results on three real data sets show that our approach outperforms other state-of-the-art approaches in terms of recommendation accuracy.
引用
收藏
页码:694 / 706
页数:13
相关论文
共 30 条
  • [11] Enhancing Knowledge Graph Embedding with Probabilistic Negative Sampling
    Kanojia, Vibhor
    Maeda, Hideyuki
    Togashi, Riku
    Fujita, Sumio
    [J]. WWW'17 COMPANION: PROCEEDINGS OF THE 26TH INTERNATIONAL CONFERENCE ON WORLD WIDE WEB, 2017, : 801 - 802
  • [12] Koren Y., 2008, P 14 ACM SIGKDD INT, P426, DOI DOI 10.1145/1401890.1401944
  • [13] CPLR: Collaborative pairwise learning to rank for personalized recommendation
    Liu, Hongzhi
    Wu, Zhonghai
    Zhang, Xing
    [J]. KNOWLEDGE-BASED SYSTEMS, 2018, 148 : 31 - 40
  • [14] RankMBPR: Rank-Aware Mutual Bayesian Personalized Ranking for Item Recommendationl
    Yu, Lu
    Zhou, Ge
    Zhang, Chuxu
    Huang, Junming
    Liu, Chuang
    Zhang, Zi-Ke
    [J]. WEB-AGE INFORMATION MANAGEMENT, PT I, 2016, 9658 : 244 - 256
  • [15] A Personalised Ranking Framework with Multiple Sampling Criteria for Venue Recommendation
    Manotumruksa, Jarana
    Macdonald, Craig
    Ounis, Iadh
    [J]. CIKM'17: PROCEEDINGS OF THE 2017 ACM CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, 2017, : 1469 - 1478
  • [16] Adaptive Bayesian personalized ranking for heterogeneous implicit feedbacks
    Pan, Weike
    Zhong, Hao
    Xu, Congfu
    Ming, Zhong
    [J]. KNOWLEDGE-BASED SYSTEMS, 2015, 73 : 173 - 180
  • [17] Qiu H., 2016, P 2016 C US MOD AD P, P305
  • [18] Improving Pairwise Learning for Item Recommendation from Implicit Feedback
    Rendle, Steffen
    Freudenthaler, Christoph
    [J]. WSDM'14: PROCEEDINGS OF THE 7TH ACM INTERNATIONAL CONFERENCE ON WEB SEARCH AND DATA MINING, 2014, : 273 - 282
  • [19] Rendle Steffen, 2009, UAI, P452
  • [20] Ricci F, 2011, RECOMMENDER SYSTEMS HANDBOOK, P1, DOI 10.1007/978-0-387-85820-3_1