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 条
  • [1] [Anonymous], 2017, ARXIV171108267
  • [2] SamWalker: Social Recommendation with Informative Sampling Strategy
    Chen, Jiawei
    Wang, Can
    Zhou, Sheng
    Shi, Qihao
    Feng, Yan
    Chen, Chun
    [J]. WEB CONFERENCE 2019: PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE (WWW 2019), 2019, : 228 - 239
  • [3] On Sampling Strategies for Neural Network-based Collaborative Filtering
    Chen, Ting
    Sun, Yizhou
    Shi, Yue
    Hong, Liangjie
    [J]. KDD'17: PROCEEDINGS OF THE 23RD ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2017, : 767 - 776
  • [4] Sampler Design for Bayesian Personalized Ranking by Leveraging View Data
    Ding, Jingtao
    Yu, Guanghui
    He, Xiangnan
    Feng, Fuli
    Li, Yong
    Jin, Depeng
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2021, 33 (02) : 667 - 681
  • [5] Ding JT, 2019, PROCEEDINGS OF THE TWENTY-EIGHTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, P2230
  • [6] Goodfellow I, 2016, ARXIV
  • [7] Guo GB, 2018, PROCEEDINGS OF THE TWENTY-SEVENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, P4092
  • [8] Personalized ranking with pairwise Factorization Machines
    Guo, Weiyu
    Wu, Shu
    Wang, Liang
    Tan, Tieniu
    [J]. NEUROCOMPUTING, 2016, 214 : 191 - 200
  • [9] Adversarial Personalized Ranking for Recommendation
    He, Xiangnan
    He, Zhankui
    Du, Xiaoyu
    Chua, Tat-Seng
    [J]. ACM/SIGIR PROCEEDINGS 2018, 2018, : 355 - 364
  • [10] Neural Collaborative Filtering
    He, Xiangnan
    Liao, Lizi
    Zhang, Hanwang
    Nie, Liqiang
    Hu, Xia
    Chua, Tat-Seng
    [J]. PROCEEDINGS OF THE 26TH INTERNATIONAL CONFERENCE ON WORLD WIDE WEB (WWW'17), 2017, : 173 - 182