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
相关论文
共 50 条
  • [21] Generating Informative Responses with Controlled Sentence Function
    Ke, Pei
    Guan, Jian
    Huang, Minlie
    Zhu, Xiaoyan
    PROCEEDINGS OF THE 56TH ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS (ACL), VOL 1, 2018, : 1499 - 1508
  • [22] MORE SAMPLING CAN BE LESS INFORMATIVE
    CHIU, WK
    AMERICAN STATISTICIAN, 1976, 30 (04): : 204 - 205
  • [23] Pilot Surveys for Adaptive Informative Sampling
    Kemna, Stephanie
    Kroemer, Oliver
    Sukhatme, Gaurav S.
    2018 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA), 2018, : 6417 - 6424
  • [24] Generating indicative-informative summaries with SumUM
    Saggion, H
    Lapalme, G
    COMPUTATIONAL LINGUISTICS, 2002, 28 (04) : 497 - 526
  • [25] Bayesian estimation under informative sampling
    Savitsky, Terrance D.
    Toth, Daniell
    ELECTRONIC JOURNAL OF STATISTICS, 2016, 10 (01): : 1677 - 1708
  • [26] Generating pairs for the sporadic groupRu
    M. R. Darafsheh
    A. R. Ashrafi
    Journal of Applied Mathematics and Computing, 2003, 12 (1-2) : 143 - 154
  • [27] Scalable Bayes under Informative Sampling
    Savitsky, Terrance D.
    Srivastava, Sanvesh
    SCANDINAVIAN JOURNAL OF STATISTICS, 2018, 45 (03) : 534 - 556
  • [28] INFORMATIVE SAMPLING FOR MULTIVARIATE ARMAX SYSTEMS
    TIGELAAR, HH
    INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, 1990, 21 (12) : 2663 - 2671
  • [29] Generating pairs and group actions
    McCullough, Darryl
    JOURNAL OF PURE AND APPLIED ALGEBRA, 2014, 218 (05) : 777 - 783
  • [30] GENERATING ORDERED PAIRS IN AN LFSR
    HERY, WJ
    IEEE DESIGN & TEST OF COMPUTERS, 1987, 4 (02): : 3 - 3