Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Li Wang 0064

dblp:58/6810-64 · DBLP profile ↗
← Back
6ranked-venue papers
5as first author
6since 2021 · last 2026
0000-0003-2864-3019ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 3 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
2 papers
Recommender systems · 100%
Network and information security
1 paper
Security and privacy of machine learning · 100%
Artificial intelligence
1 paper
Language models and text generation · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Recommender systems
cross-domain recommendation
1.922026
A Multi-Modal Prompt-Tuning Framework for Non-Overlapping Multi-Domain Recommendation · IEEE Trans. Multim. 2026
Federated User Preference Modeling for Privacy-Preserving Cross-Domain Recommendation · IEEE Trans. Multim. 2025
Natural language and speech › Language models and text generation
prompt tuning
1.012026
A Multi-Modal Prompt-Tuning Framework for Non-Overlapping Multi-Domain Recommendation · IEEE Trans. Multim. 2026
Recommender systems › cross-domain recommendation
privacy-preserving cross-domain recommendation
0.912025
Federated User Preference Modeling for Privacy-Preserving Cross-Domain Recommendation · IEEE Trans. Multim. 2025
Security and privacy of machine learning
federated learning
0.912025
Federated User Preference Modeling for Privacy-Preserving Cross-Domain Recommendation · IEEE Trans. Multim. 2025
Security and privacy of machine learning › federated learning
federated recommendation
0.912025
Federated User Preference Modeling for Privacy-Preserving Cross-Domain Recommendation · IEEE Trans. Multim. 2025

Methods — techniques the papers use, named apart from their topics

prompt tuning · 2.0multimodal representation learning · 2.0federated learning · 1.7differential privacy · 1.7contrastive learning · 1.7
YearPublicationVenuePosition
2026 MEGG: replay via maximally extreme GGscore in incremental learning for neural recommendation models
abstract
Abstract Neural collaborative filtering (NCF)-based recommendation models have been widely adopted in practical recommender systems due to their effectiveness. However, these models are typically developed under the static deep learning paradigm, where training is conducted on fixed datasets with the implicit assumption of a static data distribution. This approach is ill-suited for dynamic environments, such as those encountered in real-world platforms, where user preferences and collaborative filtering patterns evolve continuously. To address this limitation, incremental learning-a paradigm designed to integrate new knowledge while preserving previously learned information-emerges as a promising alternative. Despite its potential, the direct application of conventional incremental learning methods, which are prevalent in domains like computer vision and natural language processing, is hindered by unique challenges in recommender systems. These include the distinct task paradigm, data complexity, and sparsity issues. Moreover, existing incremental learning approaches tailored for neural recommendation models remain scarce and often suffer from limited generalizability. To bridge this gap, we propose an innovative experience replay-based incremental learning framework specifically designed for neural recommendation models, termed Replay Samples with Maximally Extreme GGscore (MEGG). At the core of MEGG is a novel metric, the GGscore, which quantifies the influence of individual samples on model training. By selectively replaying samples with the most extreme GGscores, our method effectively mitigates catastrophic forgetting, thereby maintaining high predictive performance over time. A key advantage of MEGG lies in its data-centric nature, which renders it agnostic to the underlying model architecture. This ensures broad applicability across various neural recommendation models and seamless integration with existing incremental learning frameworks to further enhance performance. Extensive experiments conducted on three neural recommendation models across four benchmark datasets demonstrate the superior effectiveness of MEGG compared to state-of-the-art methods. Furthermore, additional evaluations highlight its scalability, efficiency, and robustness. The implementation of MEGG will be made publicly available upon acceptance.
Yunxiao Shi, Shuo Yang 0006, Haimin Zhang 0001, Li Wang 0064, Yongze Wang, Qiang Wu 0001, Min Xu 0001
Data Min. Knowl. Discov.4
2026 FedPCL-CDR: A federated prototype-based contrastive learning framework for privacy-preserving cross-domain recommendation
Li Wang 0064, Qiang Wu 0001, Min Xu 0001
Neural Networks1
2026 A Multi-Modal Prompt-Tuning Framework for Non-Overlapping Multi-Domain Recommendation
abstract
Cross-domain recommendation (CDR) aims to enhance recommendation accuracy in data-sparse domains by transferring knowledge from data-rich domains. Most existing CDR methods conduct knowledge transfer based on overlapping users or items to address the user cold-start problems, including few-shot (i.e., users with sparse interactions) and zero-shot (i.e., users with no interactions) scenarios. However, in real-world scenarios, such overlap is often sparse or non-existent, limiting the effectiveness of these approaches. To overcome this challenge, we propose a novelMulti-modalPrompt-tuningFramework forNon-overlappingMulti-DomainRecommendation (MPF-NMDR). MPF-NMDR transfers knowledge across non-overlapping domains, enhancing recommendation performance in both few-shot and zero-shot scenarios. Specifically, we first pre-train the MPF-NMDR framework on data from all domains to capture users' generalized cross-domain preferences, which are learned through the generalized multi-modal interest mining module. We then conduct prompt-tuning with domain, user, and item prompts in the target domain to capture distinctions among various domains, users, and items. In this process, only the prompt parameters are fine-tuned, while all other parameters remain frozen, enabling the model to capture the distinctions among domains, users, and items while preserving the cross-domain knowledge. Extensive experiments on Amazon and Douban review datasets validate the superior performance of MPF-NMDR compared to SOTA baselines. We release our code athttps://github.com/Lili1013/MPF_NMDR.
Li Wang 0064, Shoujin Wang, Qiang Wu 0001, Min Xu 0001
IEEE Trans. Multim.1
2025 Causal disentanglement for regulating social influence bias in social recommendation
Li Wang 0064, Min Xu 0001, Quangui Zhang, Yunxiao Shi, Qiang Wu 0001
Neurocomputing1
2025 Federated User Preference Modeling for Privacy-Preserving Cross-Domain Recommendation
abstract
Cross-domain recommendation (CDR) aims to address the data-sparsity problem by transferring knowledge across domains. Existing CDR methods generally assume that the user-item interaction data is shareable between domains, which leads to privacy leakage. Recently, some privacy-preserving CDR (PPCDR) models have been proposed to solve this problem. However, they primarily transfer simple representations learned only from user-item interaction histories, overlooking other useful side information, leading to inaccurate user preferences. Additionally, they transfer differentially private user-item interaction matrices or embeddings across domains to protect privacy. However, these methods offer limited privacy protection, as attackers may exploit external information to infer the original data. To address these challenges, we propose a novel Federated User Preference Modeling (FUPM) framework. In FUPM, first, a novel comprehensive preference exploration module is proposed to learn users' comprehensive preferences from both interaction data and additional data including review texts and potentially positive items. Next, a private preference transfer module is designed to first learn differentially private local and global prototypes, and then privately transfer the global prototypes using a federated learning strategy. These prototypes are generalized representations of user groups, making it difficult for attackers to infer individual information. Extensive experiments on four CDR tasks conducted on the Amazon and Douban datasets validate the superiority of FUPM over SOTA baselines.
Li Wang 0064, Shoujin Wang, Quangui Zhang, Qiang Wu 0001, Min Xu 0001
IEEE Trans. Multim.1
2024 A privacy-preserving framework with multi-modal data for cross-domain recommendation
abstract
Cross-domain recommendation (CDR) aims to enhance the recommendation accuracy in a target domain with sparse data by leveraging rich information in a source domain, thereby addressing the data-sparsity problem. Some existing CDR methods highlight the advantages of extracting domain-common and domain-specific features to learn comprehensive user and item representations. However, these methods cannot effectively disentangle these components, as they often rely on simple user-item historical interaction information (such as ratings, clicks, and browsing), neglecting the rich multi-modal features. In addition, they do not protect user-sensitive data from potential leakage during knowledge transfer between domains. To address these challenges, we propose a P rivacy- P reserving Framework with M ulti- M odal Data for C ross- D omain R ecommendation, called P2M2-CDR. Specifically, we first design a multi-modal disentangled encoder that utilizes multi-modal information to disentangle more informative domain-common and domain-specific embeddings. Furthermore, we introduce a privacy-preserving decoder to mitigate user privacy leakage during knowledge transfer. Local differential privacy (LDP) is used to obfuscate disentangled embeddings before the inter-domain exchange, thereby enhancing privacy protection. To ensure both consistency and differentiation among these obfuscated disentangled embeddings, we incorporate contrastive learning-based domain-inter and domain-intra losses. Extensive experiments conducted on six CDR tasks from two real-world datasets demonstrate that P2M2-CDR outperforms other state-of-the-art single- and cross-domain baselines. The code is available at https://github.com/Lili1013/P2M2-CDR .
Li Wang 0064, Lei Sang 0001, Quangui Zhang, Qiang Wu 0001, Min Xu 0001
Knowl. Based Syst.1