Xufeng Liang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Xufeng Liang has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Tianyu Huang
School of Computer Science, Beijing Institute of Technology, Beijing, China
4 shared publications - Zhida Qin
School of Computer Science, Beijing Institute of Technology, Beijing, China
4 shared publications - Chong Zhang
Faculty of Electronic and Information Engineering, Xian Jiaotong University, Xian, China
2 shared publications - Gangyi Ding
School of Computer Science, Beijing Institute of Technology, Beijing, China
2 shared publications - Haoyan Fu
Beijing Institute of Technology, Beijing, China
2 shared publications - John Chi-Shing Lui
The Chinese University of Hong Kong (CUHK)
2 shared publications
Latest Publications
- Open Access
- 20 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 795-806
InfoDCL: Informative Noise Enhanced Diffusion Based Contrastive Learning
- 20 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 795-806
Open AccessInfoDCL: Informative Noise Enhanced Diffusion Based Contrastive Learning
- 6 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38 (6) , 3880-3894
SemDiff: Semantic Guided Diffusion-Based Collaborative Filtering Framework
Diffusion models have demonstrated promising potential in recommender systems owing to their powerful generative ability. However, due to the inherent sparse nature of real-world recommendation data and the inconsistency in the variation of reconstruction and ranking losses during training, existing works suffer from two issues: 1) Randomly sampled Gaussian noise addition tends to obscure original user preferences. 2) Training for generation and preference learning tasks interferes with each other, limiting the generative ability of the model. To address these issues, we propose SemDiff, a semantic guided diffusion-based collaborative filtering framework. For the first issue, instead of using random Gaussian noise, we leverage rich semantic information by incorporating auxiliary signals from text or image modalities to enhance the input data of denoising model. In response to the second issue, based on a comprehensive analysis of the mutual influence between generation and preference learning in diffusion recommender systems, we build a collaborative training objective strategy to transform the interference between them into mutual collaboration, which jointly enhances the effectiveness of model training. Additionally, we employ multiple GCN layers only during inference to incorporate higher-order co-occurrence information while maintaining training efficiency. Extensive experiments on four real-world datasets demonstrate that SemDiff significantly outperforms state-of-the-art methods. Our SemDiff offers an effective solution for enhancing recommendation performance and suggests a novel paradigm for applying diffusion methods in recommender systems.
- 6 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38 (6) , 3880-3894
SemDiff: Semantic Guided Diffusion-Based Collaborative Filtering Framework
Diffusion models have demonstrated promising potential in recommender systems owing to their powerful generative ability. However, due to the inherent sparse nature of real-world recommendation data and the inconsistency in the variation of reconstruction and ranking losses during training, existing works suffer from two issues: 1) Randomly sampled Gaussian noise addition tends to obscure original user preferences. 2) Training for generation and preference learning tasks interferes with each other, limiting the generative ability of the model. To address these issues, we propose SemDiff, a semantic guided diffusion-based collaborative filtering framework. For the first issue, instead of using random Gaussian noise, we leverage rich semantic information by incorporating auxiliary signals from text or image modalities to enhance the input data of denoising model. In response to the second issue, based on a comprehensive analysis of the mutual influence between generation and preference learning in diffusion recommender systems, we build a collaborative training objective strategy to transform the interference between them into mutual collaboration, which jointly enhances the effectiveness of model training. Additionally, we employ multiple GCN layers only during inference to incorporate higher-order co-occurrence information while maintaining training efficiency. Extensive experiments on four real-world datasets demonstrate that SemDiff significantly outperforms state-of-the-art methods. Our SemDiff offers an effective solution for enhancing recommendation performance and suggests a novel paradigm for applying diffusion methods in recommender systems.
- Open Access
- 28 January 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 44 (2) , 1-28
Multi-Relation Enhanced Dynamic Hypergraph for Session-based Recommendation
Session-based recommendation (SBR) systems have increasingly focused on hypergraph-based approaches due to their potent capability in capturing high-order item relationships. Typically, existing approaches rely on sequential item relations to manually construct fixed hypergraphs. However, this methodology neglects the multiple relations inherent in the original sequences, thereby impeding the hypergraph’s precision in discerning user preferences. Furthermore, the rigidity of fixed hypergraph structures tends to emphasize explicit relationships, ignoring the latent implicit patterns. In light of this, we present a novel Multi-relation enhanced Dynamic HyperGraph (MDHG) learning framework for session-based recommendation, to model intricate and variable item relations. Initially, we establish three distinct relation graphs which capture separate user behavior patterns to extract personalized interest preferences under differentiated intentions. Subsequently, we propose an enhanced dynamic hypergraph paradigm that adaptively generates hypergraph structures based on prior relation graph, thereby reinforcing and unveiling implicit connectivity relations in a layer-aware manner. Finally, to mitigate the noise among diverse relations, we introduce the maximum mutual information auxiliary task and employ the attention mechanism as a cross-relation aggregator. Extensive experiments on various real-world datasets verify the superiority of our MDHG model. Our code is publicly available at https://github.com/Qin-lab-code/MDHG .
- 28 January 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 44 (2) , 1-28
Open AccessMulti-Relation Enhanced Dynamic Hypergraph for Session-based Recommendation
Session-based recommendation (SBR) systems have increasingly focused on hypergraph-based approaches due to their potent capability in capturing high-order item relationships. Typically, existing approaches rely on sequential item relations to manually construct fixed hypergraphs. However, this methodology neglects the multiple relations inherent in the original sequences, thereby impeding the hypergraph’s precision in discerning user preferences. Furthermore, the rigidity of fixed hypergraph structures tends to emphasize explicit relationships, ignoring the latent implicit patterns. In light of this, we present a novel Multi-relation enhanced Dynamic HyperGraph (MDHG) learning framework for session-based recommendation, to model intricate and variable item relations. Initially, we establish three distinct relation graphs which capture separate user behavior patterns to extract personalized interest preferences under differentiated intentions. Subsequently, we propose an enhanced dynamic hypergraph paradigm that adaptively generates hypergraph structures based on prior relation graph, thereby reinforcing and unveiling implicit connectivity relations in a layer-aware manner. Finally, to mitigate the noise among diverse relations, we introduce the maximum mutual information auxiliary task and employ the attention mechanism as a cross-relation aggregator. Extensive experiments on various real-world datasets verify the superiority of our MDHG model. Our code is publicly available at https://github.com/Qin-lab-code/MDHG .
- Open Access
- 15 December 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 44 (1) , 1-32
Beyond Texts: Incorporating Co-occurrences into the Review-based Conversation Recommendation Systems
Conversational Recommender Systems (CRSs) interact with users through natural language to provide recommendations and generate responses. Due to limited information in conversation, existing works utilize KGs or reviews to improve CRS. Despite achievements, they overlook co-occurrence relations which have shown effectiveness in collaborative filtering systems. In this work, we first propose a novel framework named CoCRS , aiming to incorporate Co-occurrences into the Review-based Conversation Recommendation Systems . In CoCRS, we mine co-occurrences from two aspects: (1) item and entity , (2) user and item . For the first one, we extract entities from redundant review texts by KG and construct a relation-aware item-entity heterogeneous graph. In the second aspect, we analyze review sentiments and construct a sentiment-aware user-item bipartite graph. We encode two graphs to obtain user and entity embeddings. Since users in CRS are anonymous, we generate a virtual similar user representation to match reviews with users. Besides, we capture time-aware preference representation from two-time dimensions. Finally, we generate word-level user representation with word-oriented KG and model user preference by integrating the above representations. Extensive experiments demonstrate that CoCRS outperforms baselines and the cold-start experiment highlights its robustness. The Large Language Model (LLM) experiment illustrates the significant role of co-occurrence relationships in LLM-based CRS. Our code are available at https://github.com/Qin-lab-code/CoCRS .
- 15 December 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 44 (1) , 1-32
Open AccessBeyond Texts: Incorporating Co-occurrences into the Review-based Conversation Recommendation Systems
Conversational Recommender Systems (CRSs) interact with users through natural language to provide recommendations and generate responses. Due to limited information in conversation, existing works utilize KGs or reviews to improve CRS. Despite achievements, they overlook co-occurrence relations which have shown effectiveness in collaborative filtering systems. In this work, we first propose a novel framework named CoCRS , aiming to incorporate Co-occurrences into the Review-based Conversation Recommendation Systems . In CoCRS, we mine co-occurrences from two aspects: (1) item and entity , (2) user and item . For the first one, we extract entities from redundant review texts by KG and construct a relation-aware item-entity heterogeneous graph. In the second aspect, we analyze review sentiments and construct a sentiment-aware user-item bipartite graph. We encode two graphs to obtain user and entity embeddings. Since users in CRS are anonymous, we generate a virtual similar user representation to match reviews with users. Besides, we capture time-aware preference representation from two-time dimensions. Finally, we generate word-level user representation with word-oriented KG and model user preference by integrating the above representations. Extensive experiments demonstrate that CoCRS outperforms baselines and the cold-start experiment highlights its robustness. The Large Language Model (LLM) experiment illustrates the significant role of co-occurrence relationships in LLM-based CRS. Our code are available at https://github.com/Qin-lab-code/CoCRS .