Session-based recommendation (SR) predicts the next items from a sequence of previous items consumed by an anonymous user. Most existing SR models focus only on modeling intra-session characteristics but pay less attention to inter-session relationships of items, which has the potential to improve accuracy. Another critical aspect of recommender systems is computational efficiency and scalability, considering practical feasibility in commercial applications. To account for both accuracy and scalability, we propose a novel session-based recommendation with a random walk, namely S-Walk. Precisely, S-Walk effectively captures intra- and inter-session correlations by handling high-order relationships among items using random walks with restart (RWR). By adopting linear models with closed-form solutions for transition and teleportation matrices that constitute RWR, S-Walk is highly efficient and scalable. Extensive experiments demonstrate that S-Walk achieves comparable or state-of-the-art performance in various metrics on four benchmark datasets. Moreover, the model learned by S-Walk can be highly compressed without sacrificing accuracy, conducting two or more orders of magnitude faster inference than existing DNN-based models, making it suitable for large-scale commercial systems.
翻译:以会议为基础的建议(SR)预测了来自匿名用户所消费的先前物品序列的下一个项目。大多数现有的SR模式仅侧重于模拟会期内特点,而较少注意具有提高准确性潜力的项目闭会期间关系。建议系统的另一个关键方面是计算效率和可缩放性,同时考虑到商业应用的实际可行性。为了兼顾准确性和可缩放性,我们提出了一项具有随机行走的基于会议的新建议,即S-Walk。准确的说来,S-Walk通过处理使用随机行走与重新启动(RWRRR)的物品之间的高度顺序关系,有效地捕捉了会期内和闭会期间的相互关系。采用具有构成RWR的过渡和传送矩阵封闭式解决办法的线性模型,S-Walk是高度高效和可扩缩的。广泛的实验表明S-Walk在四个基准数据集的各种指标中取得了可比较或最先进的性能。此外,S-Walk所学的模型可以在不牺牲准确性的情况下高度压缩,进行两个或更多的数量级级的递增,比现有的DNNS型模型更适合大规模商业系统。