论文标题
有效的基于邻里的交互模型,用于在异质图上推荐
An Efficient Neighborhood-based Interaction Model for Recommendation on Heterogeneous Graph
论文作者
论文摘要
由于Hin能够表征复杂的图并包含丰富的语义,因此近年来,基于异质信息网络(HIN)推荐系统的涌入。尽管现有的方法已经提高了绩效,但在实用中,他们仍然面临以下问题。一方面,大多数现有的基于HIN的方法都依赖于明确的路径到达性来利用用户和项目之间的基于路径的语义相关性,例如基于Metapath的相似性。这些方法很难使用和集成,因为路径连接稀疏或嘈杂,并且通常具有不同的长度。另一方面,其他基于图的方法旨在通过在预测前将节点及其邻域信息压缩为单个嵌入来学习有效的异质网络表示。这种弱耦合方式在建模中忽略了节点之间的丰富相互作用,这引入了早期的摘要问题。在本文中,我们提出了一个基于端到端的邻里相互作用模型(NIREC)来解决上述问题。具体而言,我们首先分析了HINS学习相互作用的重要性,然后提出了一种新颖的表述,以通过其Metapath引导的邻域捕获每对节点之间的互动模式。然后,为了探索Metapaths之间的复杂相互作用并处理大规模网络上的学习复杂性,我们以卷积的方式制定相互作用,并通过快速的傅立叶变换有效地学习。在四种不同类型的异质图上进行的广泛实验证明了与最新的NIREC的性能提高。据我们所知,这是在基于HIN的建议中提供高效的基于邻里的交互模型的第一项工作。
There is an influx of heterogeneous information network (HIN) based recommender systems in recent years since HIN is capable of characterizing complex graphs and contains rich semantics. Although the existing approaches have achieved performance improvement, while practical, they still face the following problems. On one hand, most existing HIN-based methods rely on explicit path reachability to leverage path-based semantic relatedness between users and items, e.g., metapath-based similarities. These methods are hard to use and integrate since path connections are sparse or noisy, and are often of different lengths. On the other hand, other graph-based methods aim to learn effective heterogeneous network representations by compressing node together with its neighborhood information into single embedding before prediction. This weakly coupled manner in modeling overlooks the rich interactions among nodes, which introduces an early summarization issue. In this paper, we propose an end-to-end Neighborhood-based Interaction Model for Recommendation (NIRec) to address the above problems. Specifically, we first analyze the significance of learning interactions in HINs and then propose a novel formulation to capture the interactive patterns between each pair of nodes through their metapath-guided neighborhoods. Then, to explore complex interactions between metapaths and deal with the learning complexity on large-scale networks, we formulate interaction in a convolutional way and learn efficiently with fast Fourier transform. The extensive experiments on four different types of heterogeneous graphs demonstrate the performance gains of NIRec comparing with state-of-the-arts. To the best of our knowledge, this is the first work providing an efficient neighborhood-based interaction model in the HIN-based recommendations.