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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Zhitao Li 0005

dblp:71/7318-5 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
4since 2021 · last 2026
0009-0008-4136-5846ORCID · conflict

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

Databases, data management, data science and information retrieval · 3 · 2 first-author · 3 since 2021Applied, interdisciplinary, general and emerging computing · 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
3 papers
Recommender systems · 100%
Network and information security
2 papers
Security and privacy of machine learning · 79% Privacy and data protection · 21%

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

TopicWeightPapersLastEvidence papers
Recommender systems
federated recommendation
1.622025
Ownership Verification for Federated Recommendation · ACM Trans. Inf. Syst. 2025
FedCORE: Federated Learning for Cross-Organization Recommendation Ecosystem · IEEE Trans. Knowl. Data Eng. 2024
Recommender systems › sequential recommendation › side information-enhanced sequential recommendation
multi-behavior sequential recommendation
1.012026
A survey on multi-behavior sequential recommendation · Sci. China Inf. Sci. 2026
Recommender systems
sequential recommendation
1.012026
A survey on multi-behavior sequential recommendation · Sci. China Inf. Sci. 2026
Security and privacy of machine learning › model intellectual property protection
model watermarking
0.912025
Ownership Verification for Federated Recommendation · ACM Trans. Inf. Syst. 2025
Privacy and data protection
privacy-preserving machine learning
0.212024
FedCORE: Federated Learning for Cross-Organization Recommendation Ecosystem · IEEE Trans. Knowl. Data Eng. 2024

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

contrastive loss · 1.7backdoor watermarking · 1.7MSE loss · 1.7federated learning · 1.5collaborative training · 1.5
YearPublicationVenuePosition
2026 A survey on multi-behavior sequential recommendation
Xiaoqing Chen 0004, Zhitao Li 0005, Weike Pan, Qiang Yang 0001, Zhong Ming 0001
Sci. China Inf. Sci.2
2025 Ownership Verification for Federated Recommendation
abstract
Most federated learning-based recommender systems allow clients to access a well-trained high-quality model locally, which provides adversaries with the opportunity to infringe the legitimate copyright of the model. In response, we study an emerging and important problem, i.e., copyright protection of a federated recommendation model, which has not yet been addressed in the community of federated learning or recommender systems. We propose the first backdoor-based ownership verification scheme for federated recommendation (OVFR), which enables the server to claim its ownership for a given suspicious recommendation model. First, we propose to generate a trigger set tailored to recommendation scenarios. In particular, we generate some fake users and items, and then construct a set of fake users with fake interaction records as a trigger set. Moreover, we ensure that the distribution of the popularity of the fake items follows a long-tailed distribution for the effectiveness of the incorporated watermarking. To provide robustness assurance, we propose two different hybrid strategies to make the embeddings of the fake items similar to those of the real items. Second, we focus on effectively learning from a trigger set for recommendation scenarios. In particular, we design an MSE loss function and a contrastive loss function for incorporating the backdoor-based watermarking into the item embeddings, since the item embeddings are often more valuable and easier to be accessed than other parameters of a federated recommendation model. We then design a contrastive loss function to reduce the risk of the fake items being detected. Extensive experiments on three public datasets show the effectiveness of our OVFR in terms of ownership verification, model performance, and robustness.
Enyue Yang, Weike Pan, Lixin Fan, Hanlin Gu, Zhitao Li 0005, Qiang Yang 0001, Zhong Ming 0001
ACM Trans. Inf. Syst.5
2024 Decentralized Federated Recommendation with Privacy-aware Structured Client-level Graph
abstract
Recommendation models are deployed in a variety of commercial applications to provide personalized services for users. However, most of them rely on the users’ original rating records that are often collected by a centralized server for model training, which may cause privacy issues. Recently, some centralized federated recommendation models are proposed for the protection of users’ privacy, which however requires a server for coordination in the whole process of model training. As a response, we propose a novel privacy-aware decentralized federated recommendation (DFedRec) model, which is lossless compared with the traditional model in recommendation performance and is thus more accurate than other models in this line. Specifically, we design a privacy-aware structured client-level graph for the sharing of the model parameters in the process of model training, which is a one-stone-two-bird strategy, i.e., it protects users’ privacy via some randomly sampled fake entries and reduces the communication cost by sharing the model parameters only with the related neighboring users. With the help of the privacy-aware structured client-level graph, we propose two novel collaborative training mechanisms in the setting without a server, including a batch algorithm DFedRec(b) and a stochastic one DFedRec(s), where the former requires the anonymity mechanism while the latter does not. They are both equivalent to probabilistic matrix factorization trained in a centralized server and are thus lossless. We then provide formal analysis of privacy guarantee of our methods and conduct extensive empirical studies on three public datasets with explicit feedback, which show the effectiveness of our DFedRec, i.e., it is privacy aware, communication efficient, and lossless.
Zhitao Li 0005, Zhaohao Lin, Feng Liang 0003, Weike Pan, Qiang Yang 0001, Zhong Ming 0001
ACM Trans. Intell. Syst. Technol.1
2024 FedCORE: Federated Learning for Cross-Organization Recommendation Ecosystem
abstract
A recommendation system is of vital importance in delivering personalization services, which often brings continuous dual improvement in user experience and organization revenue. However, the data of one single organization may not be enough to build an accurate recommendation model for inactive or new cold-start users. Moreover, due to the recent regulatory restrictions on user privacy and data security, as well as the commercial conflicts, the raw data in different organizations cannot be merged to alleviate the scarcity issue in training a model. In order to learn users’ preferences from such cross-silo data of different organizations and then provide recommendations to the cold-start users, we propose a novel federated learning framework, i.e., federated cross-organization recommendation ecosystem (FedCORE). Specifically, we first focus on the ecosystem problem of cross-organization federated recommendation, including cooperation patterns and privacy protection. For the former, we propose a privacy-aware collaborative training and inference algorithm. For the latter, we define four levels of privacy leakage and propose some methods for protecting the privacy. We then conduct extensive experiments on three real-world datasets and two seminal recommendation models to study the impact of cooperation in our proposed ecosystem and the effectiveness of privacy protection.
Zhitao Li 0005, Xueyang Wu 0001, Weike Pan, Youlong Ding, Zeheng Wu, Shengqi Tan, Qian Xu 0005, Qiang Yang 0001, Zhong Ming 0001
IEEE Trans. Knowl. Data Eng.1