用行为模式量化增强推荐系统中的用户物品关联
Representation Quantization for Collaborative Filtering Augmentation
- 分解预训练表示,通过向量量化提取用户多维度兴趣模式
- 在多个数据集上显著提升推荐性能,优于现有基线方法
- 适合需要提升稀疏数据下推荐效果的研究与应用
协同过滤算法在推荐系统中面临数据稀疏性问题。传统方法通常依赖重叠交互邻居或粗粒度属性进行关联,难以有效融合交互序列与属性中的行为特征。为此,我们提出一种两阶段协同推荐算法DQRec:基于分解的量化变分自编码器(DQ-VAE)。该方法将预训练表征嵌入分解为独立维度并进行向量量化,生成语义ID作为用户多方面兴趣等行为模式。通过将这些语义ID用于特征与同质连接增强,系统同时丰富隐式和显式用户/物品特征,并识别模式相似邻居,从而提升信息传播效率。在多个数据集上的实验表明,DQRec在推荐性能上显著优于基线方法。
原文摘要 · Abstract (English)
As the core algorithm in recommendation systems, collaborative filtering (CF) algorithms inevitably face the problem of data sparsity. Since CF captures similar users and items for recommendations, it is effective to augment the lacking user-user and item-item homogeneous linkages. However, existing methods are typically limited to connecting through overlapping interacted neighbors or through similar attributes and contents. These approaches are constrained by coarse-grained, sparse attributes and fail to effectively extract behavioral characteristics jointly from interaction sequences and attributes. To address these challenges, we propose a novel two-stage collaborative recommendation algorithm, DQRec: Decomposition-based Quantized Variational AutoEncoder (DQ-VAE) for Recommendation. DQRec augments features and homogeneous linkages by extracting the behavior characteristics jointly from interaction sequences and attributes, namely patterns, such as user multi-aspect interests. Inspired by vector quantization (VQ) technology, we propose a new VQ algorithm, DQ-VAE, which decomposes the pre-trained representation embeddings into distinct dimensions, and quantize them to generates semantic IDs. We utilize the generated semantic IDs as the extracted patterns mentioned above. By integrating these semantic ID patterns into the recommendation process through feature and linkage augmentation, the system enriches both latent and explicit user and item features, identifies pattern-similar neighbors, and thereby improves the efficiency of information diffusion. Experimental comparisons with baselines across multiple datasets demonstrate the superior performance of the proposed DQRec method.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。