用超图对比学习挖掘多模态推荐中的深层用户-商品关联。
MMHCL: Multi-Modal Hypergraph Contrastive Learning for Recommendation
- 构建用户与商品的双超图,捕捉共享偏好和多模态语义相似性。
- 通过对比学习增强特征区分度,提升稀疏数据下的推荐效果。
- 适合解决冷启动和数据稀疏问题的推荐系统研究者使用。
多模态内容分享平台的兴起推动了个性化推荐系统的发展。以往方法常面临数据稀疏和冷启动问题,难以充分挖掘多模态数据中的语义用户-商品关联。为此,我们提出一种新型多模态超图对比学习(MMHCL)框架。为全面探索用户-商品关系,构建用户-用户(u2u)超图和商品-商品(i2i)超图,分别挖掘用户间的共享偏好和商品间复杂的多模态语义相似性。该过程生成更密集的二阶语义信息,与一阶用户-商品交互融合,以缓解数据稀疏问题。随后设计对比特征增强范式,通过协同对比学习最大化/最小化同一/不同用户、商品的二阶(如用户共享偏好模式)与一阶(用户选中商品信息)嵌入间的互信息,有效提升特征可区分性。相比仅使用稀疏的一阶用户-商品交互,本方法获得更稠密的二阶超图,挖掘出更丰富的共享属性,从而在一定程度上缓解数据稀疏与冷启动问题。大量实验全面验证了方法的有效性。代码已公开于:https://github.com/Xu107/MMHCL。
原文摘要 · Abstract (English)
The burgeoning presence of multimodal content-sharing platforms propels the development of personalized recommender systems. Previous works usually suffer from data sparsity and cold-start problems, and may fail to adequately explore semantic user-product associations from multimodal data. To address these issues, we propose a novel Multi-Modal Hypergraph Contrastive Learning (MMHCL) framework for user recommendation. For a comprehensive information exploration from user-product relations, we construct two hypergraphs, i.e. a user-to-user (u2u) hypergraph and an item-to-item (i2i) hypergraph, to mine shared preferences among users and intricate multimodal semantic resemblance among items, respectively. This process yields denser second-order semantics that are fused with first-order user-item interaction as complementary to alleviate the data sparsity issue. Then, we design a contrastive feature enhancement paradigm by applying synergistic contrastive learning. By maximizing/minimizing the mutual information between second-order (e.g. shared preference pattern for users) and first-order (information of selected items for users) embeddings of the same/different users and items, the feature distinguishability can be effectively enhanced. Compared with using sparse primary user-item interaction only, our MMHCL obtains denser second-order hypergraphs and excavates more abundant shared attributes to explore the user-product associations, which to a certain extent alleviates the problems of data sparsity and cold-start. Extensive experiments have comprehensively demonstrated the effectiveness of our method. Our code is publicly available at: https://github.com/Xu107/MMHCL.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。