24 June 2025 in IEEE Transactions on Knowledge and Data Engineering
Knowledge-aware recommendations improve performance by using knowledge graphs as auxiliary information. Recently, researchers have introduced the contrastive learning paradigm in knowledge-aware recommendations to enhance representation learning. However, most contrastive learning methods rely on manually or randomly generated knowledge views, making it challenging to generalize to different data distributions and alleviate knowledge noise effects. To solve these issues, we propose a mask diffusion-based contrastive learning method for knowledge-aware recommendation. Specifically, we apply local masked input to the diffusion model, using a mask prediction paradigm to adaptively generate views from both global and local perspectives, thereby enhancing the model’s generalization capability across different data distributions. Additionally, we propose a conditional inference process, leveraging user intentions to provide reasonable denoising guidance. At the same time, we design a collaborative knowledge diffusion loss aimed at improving the consistency between generated data and user behavior patterns. In this way, we combine the diffusion model with contrastive learning for the knowledge-aware recommendation, which can improve the generalization ability of the model. Our experimental results on four datasets show the effectiveness of our model.
3 June 2025 in Neural Networks
3 November 2025 in Knowledge-Based Systems
4 February 2026 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
Social recommendations assume that users with social networks tend to have similar pReferences and leverage the social network of users to improve personalized recommendations. However, the scarcity of interactive and social data, along with the presence of irrelevant or fake social connections, poses challenges in accurately predicting user preferences. Recent research has leveraged diffusion models to eliminate invalid social connections from the social relation graph, but this approach incurs high resource costs for large-scale item prediction. To address these issues, we propose an efficient latent space diffusion model for social recommendation named latent diffusion method for social recommendation (LDSR), which can reduce resource costs by clustering user social relationships and performing diffusion in a low-dimensional space. During the diffusion process, we inject and eliminate Gaussian noise and residuals in multiple steps, enhancing the model’s ability to recognize noise while ensuring output diversity and determinism. Additionally, we design a reconstruction strategy to capture latent social relationships, which helps to densify the social relation graph. The nonsmooth nature of the latent space can disrupt downstream task outputs, so we introduce variation constraints to smooth the latent space, reducing the impact of latent perturbations during generation. Furthermore, we incorporate user-item collaborative information to guide the reverse process, enhancing the controllability of the generated content to provide reasonable denoising. Extensive experiments on four publicly available datasets demonstrate that LDSR outperforms the state-of-the-art models, exhibiting superior training efficiency, robustness against sparsity and noise, and enhanced interpretability.
15 June 2025 in Neural Networks
2 February 2024 in IEEE Transactions on Computational Social Systems
Knowledge graph (KG) is of growing significance in enabling explainable recommendations. Recent research works involve constructing propagation-based recommendation models. Nevertheless, most of the current propagation-based recommendation methods cannot explicitly handle the diverse relations of items, resulting in the inability to model the underlying hierarchies and diverse relations, and it is difficult to capture the high-order collaborative information of items to learn premium representation. To address these issues, we leverage hyperbolic dynamic neural networks for knowledge-aware recommendation (KHDNN). Technically speaking, we embed users and items (forming user–item bipartite graphs), along with entities and relations (constituting KGs), into hyperbolic space, followed by encoding these embeddings using an encoder. The encoded embedding is passed through a hyperbolic dynamic filter to explicitly handle relations and model different relational structures. Furthermore, we design a fresh aggregation strategy based on relations to propagate and capture higher-order collaborative signals as well as knowledge associations. Meanwhile, we extract semantic information via a bilateral memory network to fuse item collaborative signals and knowledge associations. Empirical results from four datasets show that KHDNN surpasses cutting-edge baseline methods. Additionally, we demonstrate that the KHDNN can perform knowledge-aware recommendations with complex relations.