In recommender systems (RSs), predicting the next item that a user interacts with is critical for user retention. While the last decade has seen an explosion of RSs aimed at identifying relevant items that match user preferences, there is still a range of aspects that could be considered to further improve their performance. For example, often RSs are centered around the user, who is modeled using her recent sequence of activities. Recent studies, however, have shown the effectiveness of modeling the mutual interactions between users and items using separate user and item embeddings. Building on the success of these studies, we propose a novel method called DeePRed that addresses some of their limitations. In particular, we avoid recursive and costly interactions between consecutive short-term embeddings by using long-term (stationary) embeddings as a proxy. This enable us to train DeePRed using simple mini-batches without the overhead of specialized mini-batches proposed in previous studies. Moreover, DeePRed's effectiveness comes from the aforementioned design and a multi-way attention mechanism that inspects user-item compatibility. Experiments show that DeePRed outperforms the best state-of-the-art approach by at least 14% on next item prediction task, while gaining more than an order of magnitude speedup over the best performing baselines. Although this study is mainly concerned with temporal interaction networks, we also show the power and flexibility of DeePRed by adapting it to the case of static interaction networks, substituting the short- and long-term aspects with local and global ones.
翻译:在推荐系统(RSs)中,预测用户与用户互动的下一个项目对于用户保留至关重要。虽然过去十年里,RSs在确定符合用户偏好的相关项目方面出现了爆炸性,但仍有一系列可以考虑进一步提高其性能的方面。例如,RSs往往以用户为中心,而用户是使用最近一系列活动的模型。然而,最近的研究表明,用户和项目使用单独的用户和项目嵌入来模拟相互互动的有效性。在这些研究成功的基础上,我们提出了一个名为Deepred的新方法,旨在解决其某些局限性。特别是,我们避免连续短期嵌入的短期嵌入之间反复发生和代价高昂的相互作用,办法是使用长期(固定)嵌入作为替代。这使我们能够使用简单的小型布局来培训DeepPRed,而不必使用先前研究中提议的专门小型布局。此外,Deepred的功效来自上述设计以及一个检查用户-项目兼容性的多面关注机制。实验显示,在下一个本地网络中,DePRed超越了它们之间的周期性互动关系,我们通过使用长期(固定式)嵌化的网络,而最接近于最快速的基线化的系统,我们通过最接近于最快速的排序。