通过挖掘用户与物品子图间的关联,提升推荐模型的准确性。
Graph Cross-Correlated Network for Recommendation
- 分层提取用户和物品邻居的语义信息,避免信息压缩
- 构建跨子图相关项,增强用户与物品的关联建模
- 适用于需要精细关系建模的推荐场景
协同过滤(CF)模型在推荐系统中表现优异,将用户和物品表示为嵌入向量。近年来,图神经网络在用户-物品交互图上的强大建模能力使其备受关注。现有图基CF模型通过多层图卷积将每个用户/物品及其子图编码为单一超向量,并用点积推断用户-物品关系,但各层邻居携带特定语义,统一编码会削弱语义信息,造成潜力浪费。为此,本文提出图交叉相关网络(GCR),作为通用推荐范式,显式建模用户与物品子图间的相关性。GCR首先引入普通图表示(PGR),直接从每层邻居提取信息生成对应的PGR向量;然后设计交叉相关聚合(CCA),构建用户与物品子图PGR向量之间的可能交叉相关项;最后综合这些交叉相关项进行推荐。实验表明,GCR在交互预测和点击率预测任务上均优于当前最优模型。
原文摘要 · Abstract (English)
Collaborative filtering (CF) models have demonstrated remarkable performance in recommender systems, which represent users and items as embedding vectors. Recently, due to the powerful modeling capability of graph neural networks for user-item interaction graphs, graph-based CF models have gained increasing attention. They encode each user/item and its subgraph into a single super vector by combining graph embeddings after each graph convolution. However, each hop of the neighbor in the user-item subgraphs carries a specific semantic meaning. Encoding all subgraph information into single vectors and inferring user-item relations with dot products can weaken the semantic information between user and item subgraphs, thus leaving untapped potential. Exploiting this untapped potential provides insight into improving performance for existing recommendation models. To this end, we propose the Graph Cross-correlated Network for Recommendation (GCR), which serves as a general recommendation paradigm that explicitly considers correlations between user/item subgraphs. GCR first introduces the Plain Graph Representation (PGR) to extract information directly from each hop of neighbors into corresponding PGR vectors. Then, GCR develops Cross-Correlated Aggregation (CCA) to construct possible cross-correlated terms between PGR vectors of user/item subgraphs. Finally, GCR comprehensively incorporates the cross-correlated terms for recommendations. Experimental results show that GCR outperforms state-of-the-art models on both interaction prediction and click-through rate prediction tasks.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。