Dual Metric Learning for Effective and Efficient Cross-Domain Recommendations

被引:26
作者
Li, Pan [1 ]
Tuzhilin, Alexander [1 ]
机构
[1] NYU, Stern Sch Business, Dept Technol Operat & Stat, New York, NY 10012 USA
基金
澳大利亚研究理事会;
关键词
Cross domain recommendation; dual learning; metric learning; orthogonal mapping; ALGORITHMS;
D O I
10.1109/TKDE.2021.3074395
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Cross domain recommender systems have been increasingly valuable for helping consumers identify useful items in different applications. However, existing cross-domain models typically require large number of overlap users, which can be difficult to obtain in some applications. In addition, they did not consider the duality structure of cross-domain recommendation tasks, thus failing to take into account bidirectional latent relations between users and items and achieve optimal recommendation performance. To address these issues, in this paper we propose a novel cross-domain recommendation model based on dual learning that transfers information between two related domains in an iterative manner until the learning process stabilizes. We develop a novel latent orthogonal mapping to extract user preferences over multiple domains while preserving relations between users across different latent spaces. Furthermore, we combine the dual learning method with the metric learning approach, which allows us to significantly reduce the required common user overlap across the two domains and leads to even better cross-domain recommendation performance. We test the proposed model on two large-scale industrial datasets and six domain pairs, demonstrating that it consistently and significantly outperforms all the state-of-the-art baselines. We also show that the proposed model works well with very few overlap users to obtain satisfying recommendation performance comparable to the state-of-the-art baselines that use many overlap users.
引用
收藏
页码:321 / 334
页数:14
相关论文
共 78 条
  • [1] Toward the next generation of recommender systems: A survey of the state-of-the-art and possible extensions
    Adomavicius, G
    Tuzhilin, A
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2005, 17 (06) : 734 - 749
  • [2] [Anonymous], 2013, P 22 INT C WORLD WID
  • [3] [Anonymous], 2012, P 18 ACM SIGKDD INT, DOI [10.1145/2339530.2339643, DOI 10.1145/2339530.2339643]
  • [4] Bansal N., 2018, Advances in Neural Information Processing Systems
  • [5] BJORCK A, 1994, LINEAR ALGEBRA APPL, V198, P297
  • [6] Bobrikov V, 2016, P 3 WORKSHOP EXPT EC, P1
  • [7] Cantador I, 2015, Recommender systems handbook, P919, DOI DOI 10.1007/978-1-4899-7637-627
  • [8] Cross-domain Recommendations without Overlapping Data: Myth or Reality?
    Cremonesi, Paolo
    Quadrana, Massimo
    [J]. PROCEEDINGS OF THE 8TH ACM CONFERENCE ON RECOMMENDER SYSTEMS (RECSYS'14), 2014, : 297 - 300
  • [9] Davidson TR, 2018, UNCERTAINTY IN ARTIFICIAL INTELLIGENCE, P856
  • [10] Feng SS, 2015, PROCEEDINGS OF THE TWENTY-FOURTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI), P2069