用大模型将语义知识转为拓扑连接,提升推荐系统效果
Turning Semantics into Topology: LLM-Driven Attribute Augmentation for Collaborative Filtering
- 通过大模型推断用户-物品交互意图,生成中间属性节点构建增强图
- 在多个数据集上显著提升推荐性能,冷启动场景也表现稳定
- 适合做推荐系统升级的开发者,尤其关注语义融合与图结构建模
大型语言模型(LLMs)凭借其丰富的世界知识和推理能力,在增强推荐系统方面展现出巨大潜力。然而,如何有效将这些语义信号转化为传统的协同过滤嵌入仍是一个开放挑战。现有方法通常处于两个极端:直接推理方法在大规模检索中计算开销过大,而基于嵌入的方法主要关注单向特征增强,而非整体协同信号提升。为此,我们提出拓扑增强图协同过滤(TAGCF),将语义知识转化为拓扑连通性。不同于依赖文本特征或直接交互合成的方法,TAGCF利用大模型从用户-物品对中推断交互意图与潜在因果关系,并将其表示为丰富后的用户-属性-物品(U-A-I)图中的中间属性节点。为进一步建模该增强结构中的异质关系,我们提出自适应关系加权图卷积(ARGC),采用关系特定的预测网络动态估计每类关系的重要性。在多个基准数据集和协同过滤基线上的实验表明,框架具有持续提升效果,全面评估包括冷启动场景,验证了其有效性和鲁棒性。所有代码将公开发布。
原文摘要 · Abstract (English)
Large Language Models (LLMs) have shown great potential for enhancing recommender systems through their extensive world knowledge and reasoning capabilities. However, effectively translating these semantic signals into traditional collaborative embeddings remains an open challenge. Existing approaches typically fall into two extremes: direct inference methods are computationally prohibitive for large-scale retrieval, while embedding-based methods primarily focus on unilateral feature augmentation rather than holistic collaborative signal enhancement. To bridge this gap, we propose Topology-Augmented Graph Collaborative Filtering (TAGCF), a novel framework that transforms semantic knowledge into topological connectivity. Unlike existing approaches that depend on textual features or direct interaction synthesis, TAGCF employs LLMs to infer interaction intents and underlying causal relationships from user-item pairs, representing these insights as intermediate attribute nodes within an enriched User-Attribute-Item (U-A-I) graph. Furthermore, to effectively model the heterogeneous relations in this augmented structure, we propose Adaptive Relation-weighted Graph Convolution (ARGC), which employs relation-specific prediction networks to dynamically estimate the importance of each relation type. Extensive experiments across multiple benchmark datasets and CF backbones demonstrate consistent improvements, with comprehensive evaluations including cold-start scenarios validating the effectiveness and robustness of our framework. All code will be made publicly available. For anonymous review, our code is available at the following anonymous link: https://anonymous.4open.science/r/AGCF-2441353190/.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。