Skip to content
Open access

Conditional Diffusion Denoising and Multi-Source Semantic Fusion for Social Recommendation

2026 · IEEE Access · Vol 14, pp. 121195-121211 · 0 citations · 46 references
Computer Science

TL;DR

A core-interest-guided conditional diffusion denoising approach is proposed, where user core interests extracted from historical interactions are used as semantic conditions to progressively refine noisy social representations in the latent space, and a unified framework, termed CDD-MSF, is proposed.

Abstract

Social recommendation alleviates data sparsity and cold-start issues by leveraging user social networks. However, real-world social graphs are often contaminated with noisy relations, such as weak or spurious links, which are amplified during graph propagation and degrade user representation learning. To address this issue, a core-interest-guided conditional diffusion denoising approach is proposed, where user core interests extracted from historical interactions are used as semantic conditions to progressively refine noisy social representations in the latent space. In addition, real-world recommendation is influenced not only by individual behaviors and social relations but also by global contextual factors, such as popularity trends and environmental biases. Effectively integrating these heterogeneous signals remains challenging. To this end, a multi-source semantic fusion module is developed, which employs soft-threshold multi-head attention and dynamic residual gating to adaptively align and fuse heterogeneous information. Based on these designs, a unified framework, termed CDD-MSF, is proposed. Extensive experiments on three real-world datasets demonstrate that CDD-MSF consistently outperforms state-of-the-art baselines in terms of Recall@K and NDCG@K, and exhibits strong robustness and generalization under highly sparse and noisy conditions.

Read PDF

Similar papers

Conference Open access Sep 2026

Manifold-Aligned Rectification Flow for Denoised Social Recommendation

Manifold-Aligned Rectification Flow is proposed, a flow matching based framework that explicitly rectifies noisy social representations toward preference-aligned embeddings and effectively bridges the gap between the social and preference domains, yielding robust and discriminative user representations.

Qing Meng, Zhu-Fu Song, Huiyu Min et al. · 0 citations
Open access 2026

Dual-Space Gated Fusion Adaptive Denoising and Diversity-Balanced Recommendation

Graph neural networks have become a widely adopted backbone for collaborative filtering because they capture high-order dependencies in user–item interaction graphs. However, noisy interactions can be amplified during graph propagation, while conventional contrastive objectives may over-separate behaviorally similar us...

Jun-Jie Wu, Xin-Hui Wang, Fei-Fan Zhao · 0 citations
Sep 2026

SoDRA: purifying social graphs with behavior verification for social recommendations

This work proposes SoDRA (Social Dynamic Refinement and Alignment), a framework that dynamically purifies social graphs via a closed-loop “guess → verify → update” mechanism, and employs multi-layer graph convolutional network propagation on both user-item and social graphs.

Yang Guo, Song-Song Hou, Xiang Li et al. · 0 citations
Oct 2026

Semantic Augmented Multiview Graph Learning With Frequency-Aware Propagation for Recommendation

Graph neural networks (GNNs) have been widely adopted in collaborative filtering to model higher order relationships between users and items. However, existing methods mainly focus on interaction-based structures and neglect the explicit modeling of semantic relations among users and among items. Within these graph str...

Yi-Xin Liu, Yu Zhang, Lei Sang et al. · 0 citations
Conference Aug 2026

Decoupled Graph Signal Processing for Noise-Robust Recommendation in Sparse Heterogeneous Networks

Real-world recommendation systems usually utilise heterogeneous user-item interaction graphs that are extremely sparse, have multi-type edges and are with considerable observation noise due to misclicks, accidental exposures and bot activities. Traditional graph convolutional recommenders propagate signals indiscrimina...

Sonam Karsoliya, Anupam Choudhary, Sapna Jain Choudhary et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.