EDBT 2026 Demo / reviewers in the wild / expert
Yuan Liu 0021
dblp:87/2948-21
· DBLP profile ↗
13ranked-venue papers in the field
0as first author
11since 2021 · last 2026
—ORCID · conflict
Domains — venue-derived; a paper can count in several
Data Mining & Knowledge Discovery · 6Information Retrieval & Web Search · 4Knowledge Engineering, Semantic Web & Information Systems · 3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | KE-FedRS: Tackling Data Sparsity in Federated Recommendation via Knowledge EnhancementabstractFederated recommendation systems (FRSs) have recently gained widespread attention due to their ability to train collaborative recommendation models without exchanging raw user data. However, existing FRSs face a severe challenge of data sparsity, which manifests at both the user and item levels. First, user data sparsity: some users may only have a small number of interactions with items, struggling to adequately train the personalized user embedding locally. Second, item data sparsity: some items may only receive a small number of user ratings, causing the global model to lack knowledge about them. Considering these, we propose the Knowledge Enhanced Federated Recommendation System named as KE-FedRS, of which the core idea is to enhance the knowledge of users with few interactions and items with few ratings at both the local and global levels. Specifically, at the local level, we introduce an auxiliary user embedding and average and aggregate this auxiliary embedding across similar users, thereby enriching the knowledge of the local user embedding. At the global level, we propose a hybrid client selection strategy based on item embedding discrepancies, prioritizing clients that exhibit greater divergence in item embeddings from others, thus enhancing the knowledge of items with fewer interactions in the global model. We conduct comprehensive experiments on four real-world datasets, and the results show that the proposed method consistently outperforms baseline approaches in terms of HR@10 and NDCG@10. Jiayu Bao, Hongjian Shi, Rui Zhou 0021, Haozhao Wang, Yuan Liu 0021 |
WWW | 6 |
| 2026 | Personalized semi-decentralized federated recommender
Jiayu Bao, Yicheng Di, Song Shen, Rongsheng Hu, Yuan Liu 0021 |
Inf. Process. Manag. | 5 |
| 2026 | FedRL: A Reinforcement Learning Federated Recommender System for Efficient Communication Using Reinforcement Selector and Hypernet GeneratorabstractThe field of recommender systems aims to predict users’ latent interests by analyzing their preferences and behaviors. However, privacy concerns about user data collection lead to challenges such as incomplete initial information and data sparsity. Federated learning has emerged to address these privacy issues in recommender systems. However, federated recommender systems face heterogeneity among edge devices regarding data features and sample sizes. Moreover, differences in computational and storage capabilities introduce communication overhead and processing delays during parameter aggregation at the third-party server. This article introduces a framework named FedRL , a reinforcement learning federated recommender system for efficient communication using Reinforcement Selector and Hypernet Generator, to address the proposed issues. The Reinforcement Selector dynamically selects participating edge devices and helps to maximize their use of local data resources. Meanwhile, Hypernet Generator optimizes communication bandwidth consumption during the federated learning parameter transmission, enabling rapid deployment and updates of new model architectures or hyperparameters. Furthermore, the framework incorporates item attributes as content embeddings in edge devices’ recommender models, enriching them with global information. Real-world dataset experiments demonstrate that the proposed solution balances recommender quality and communication efficiency. The code for this work is publicly available on GitHub: https://github.com/diyicheng/FedRL . Yicheng Di, Hongjian Shi, Ruhui Ma, Honghao Gao, Yuan Liu 0021 |
Trans. Recomm. Syst. | 5 |
| 2025 | DiffKD: collaborative graph diffusion with knowledge distillation for multimodal recommendation
Wenyu Ma, Hongbin Xia, Yuan Liu 0021 |
J. Intell. Inf. Syst. | 3 |
| 2025 | Efficient federated recommender system based on Slimify Module and Feature Sharpening Module
Yicheng Di, Hongjian Shi, Jiansong Fan, Jiayu Bao, Gaoyuan Huang, Yuan Liu 0021 |
Knowl. Inf. Syst. | 6 |
| 2025 | Federated cross-domain recommendation system based on bias eliminator and personalized extractor
Yicheng Di, Hongjian Shi, Qi Wang 0142, Shunyuan Jia, Jiayu Bao, Yuan Liu 0021 |
Knowl. Inf. Syst. | 6 |
| 2025 | GDDRec: graph neural diffusion model for diversified recommendation
Muzi Zhao, Zhenping Xie, Yuan Liu 0021, Qianyi Zhan |
Knowl. Inf. Syst. | 5 |
| 2025 | Feature refinement for cross-domain aspect-based sentiment analysis: a contrastive learning and domain alignment perspective
Hongbin Xia, Yuan Liu 0021 |
Knowl. Inf. Syst. | 3 |
| 2025 | Non-Parallel Story Author-Style Transfer with Disentangled Representation LearningabstractNon-parallel story author-style transfer is an important but challenging task in natural language process, which requires transferring an input story into another author-style while maintaining source semantics. Despite recent progress, current text style transfer systems still face the challenges of low robustness of the model and low quality of the generated stories. To address these challenges, we propose an end-to-end framework incorporating dual encoder components and a fusion mechanism, which can achieve explicit style-content disentanglement and effectively fusing source-domain content with target-domain stylistic features. First, we extract text from source stories containing content information using empirical extraction rules and prompt engineering. And then, we propose a novel generation model which achieves story-style transfer through capturing source content features and target style features and then fusing them. We use two additional training objectives to learn high-level discourse representations. Moreover, we have constructed a new dataset for this task. Extensive experiments based on automatic and human evaluation show that our model significantly outperforms state-of-the-art baselines, achieving approximately 8.5% average improvement in comprehensive performance metrics, demonstrating the effectiveness of our model in story-style transfer. Hongbin Xia, Xiangzhong Meng, Yuan Liu 0021 |
ACM Trans. Knowl. Discov. Data | 3 |
| 2025 | Federated Recommender System Based on Diffusion Augmentation and Guided DenoisingabstractSequential recommender systems often struggle with accurate personalized recommendations due to data sparsity issues. Existing works use variational autoencoders and generative adversarial network methods to enrich sparse data. However, they often overlook diversity in the latent data distribution, hindering the model’s generative capacity. This characteristic of generative methods can introduce additional noise in many cases. Moreover, retaining personalized user preferences through the generation process remains a challenge. This work introduces DGFedRS, a Federated Recommender System Based on Diffusion Augmentation and Guided Denoising, designed to capture the diversity in the latent data distribution while preserving user-specific information and suppressing noise. In particular, we pre-train the diffusion model using the recommender dataset and use a diffusion augmentation strategy to generate interaction sequences, expanding the sparse user-item interactions in the discrete space. To preserve user-specific preferences in the generated interactions, we employ a guided denoising strategy to guide the generation process during reverse diffusion. Subsequently, we design a noise control strategy to reduce the damage to personalized information during the diffusion process. Additionally, a stepwise scheduling strategy is devised to input generated data into the sequential recommender model based on their challenge levels. The success of the DGFedRS approach is demonstrated by thorough experiments conduct on three real-world datasets. Yicheng Di, Hongjian Shi, Ruhui Ma, Yuan Liu 0021 |
ACM Trans. Inf. Syst. | 5 |
| 2024 | CMC-MMR: multi-modal recommendation model with cross-modal correction
Hongbin Xia, Yuan Liu 0021 |
J. Intell. Inf. Syst. | 3 |
| 2020 | Denoising of Magnetic Resonance Images with Deep Neural Regularizer Driven by Image PriorabstractMagnetic resonance imaging (MRI) is an important medical diagnosis technique in clinical diagnosis, while the quality of MR images is always damaged by the noise which is caused in the image acquisition process. In the classic image denoising methods, how to design an excellent regularizer with the prior knowledge of image is the key to solve the denoising problem. In this work, we introduce the deep neural regularizer for the MRI denoising tasks, the deep neural regularizer is made up of neural network structure and objective function, similar to the classic regularizer, both of these two parts are designed with the prior knowledge of image. The proposed neural network has three main parts: encoder network, decoder network and skip connections, the encoder network which consists of five down-sampling blocks is enforced to deeply extract low-resolution or highly-abstract MR image features, similar to the encoder network architecture, the decoder network is made up of five up-sampling blocks and is enforced to restore high-resolution MR image features. To generate more finer image features, we also use skip connections to transmit the abstract information from encoder to decoder directly. The objective function consists of data fidelity term and image quality penalty term, specifically, to enforce the capability of data fidelity term, we add the self-designed image structural consistency calculation to data fidelity term besides only calculating the image consistency over image pixels with mean squared error. Meanwhile, to guide the network generate more clearer image and reduce noise information, with the prior knowledge of image sharpness, an image quality penalty term which calculates the MR image sharpness is also added to the objective function. Experimental results over the simulated MRI data and real clinical data demonstrate the proposed network can achieve superior performance compared with other methods in terms of peak signal to noise ratio, structure similarity index, image average gradient and image information entropy. Yazhou Zhu 0001, Lihua Li 0002, Yuan Liu 0021 |
DSAA | 5 |
| 2015 | Evolutionary sampling: A novel way of machine learning within a probabilistic framework
Zhenping Xie, Jun Sun 0008, Vasile Palade, Shitong Wang 0001, Yuan Liu 0021 |
Inf. Sci. | 5 |