arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2104.08490cs.IRcs.LG
收藏

用于有效和高效跨域推荐的双度量学习

Dual Metric Learning for Effective and Efficient Cross-Domain Recommendations

New York University(纽约大学)

Pan Li, Alexander Tuzhilin

摘要:

跨领域推荐系统在帮助消费者识别不同应用中的有用项目方面越来越有价值。然而,现有的跨领域模型通常需要大量的重叠用户,这在某些应用中可能难以获得。此外,他们没有考虑跨域推荐任务的二元结构,从而无法考虑用户和项目之间的双向潜在关系,并实现最佳推荐性能。为了解决这些问题,在本文中,我们提出了一种新的跨域推荐模型的基础上,双学习,在两个相关的域之间的信息传递,以迭代的方式,直到学习过程稳定。我们开发了一种新的潜在的正交映射提取用户的偏好在多个领域,同时保持用户之间的关系在不同的潜在空间。此外,我们结合了双重学习方法与度量学习方法,这使我们能够显着减少所需的共同用户在两个域的重叠,并导致更好的跨域推荐性能。我们在两个大规模工业数据集和六个域对上测试了所提出的模型,证明它始终显著优于所有最先进的基线。我们还表明,所提出的模型可以很好地与非常少的重叠用户,以获得令人满意的推荐性能相媲美的国家的最先进的基线,使用许多重叠用户。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑