FedRec: Federated Recommendation With Explicit Feedback
The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Abstract
Recommendation models have been widely embedded in various online services, while most of which are designed with the assumption that users’ original behaviors are available in a central server. This may cause the privacy issue. As a response, we follow a recent work called federated collaborative filtering (FCF) for item recommendation with implicit feedback and propose a novel and generic federated recommendation (FedRec) framework for rating prediction with explicit feedback. Specifically, we federate some basic and advanced factorization-based recommendation models both in batch style and in stochastic style. More importantly, in order to protect the private information of which items each user has rated, as well as not to significantly increase the computational and communication cost, we design two simple but effective strategies, i.e., user averaging and hybrid filling, in which some (instead of all) unrated items are randomly sampled and assigned with some virtual ratings accordingly. Empirical studies on two public datasets show the effectiveness of our FedRec in terms of the closeness of a federated model and an unfederated one, and the usefulness of the two filling strategies.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The MovieLens Datasets: History and Context
Harper, F. M., & Konstan, J. A. (2016) · ACM Transactions on Interactive Intelligent Systems · doi:10.1145/2827872 · Cited by 6,627
Federated Machine Learning: Concept and Applications
Yang, Q., Liu, Y., Chen, T., & Tong, Y. (2019) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/3298981 · Cited by 6,322
Federated Optimization: Distributed Machine Learning for On-Device Intelligence
Konečný, J., McMahan, H. B., Ramage, D., & Richtárik, P. (2016) · arXiv · doi:10.48550/arxiv.1610.02527 · Cited by 1,563
A secure federated transfer learning framework
Liu, Y., Kang, Y., Xing, C., Chen, T., & Yang, Q. (2020) · IEEE Intelligent Systems · doi:10.1109/mis.2020.2988525 · Cited by 645
Secure Federated Transfer Learning
Liu, Y., Kang, Y., Xing, C., Chen, T., & Yang, Q. (2018) · arXiv · doi:10.48550/arxiv.1812.03337 · Cited by 645
Federated Machine Learning: Concept and Applications
Yang, Q., Liu, Y., Chen, T., & Tong, Y. (2019) · arXiv · doi:10.48550/arxiv.1902.04885 · Cited by 600
Cited by
A survey on federated learning: challenges and applications
Wen, J., Zhang, Z., Lan, Y., Cui, Z., Cai, J., & Zhang, W. (2023) · International Journal of Machine Learning and Cybernetics · doi:10.1007/s13042-022-01647-y · Cited by 883
Communication-efficient federated learning via knowledge distillation
Wu, C., Wu, F., Lyu, L., Huang, Y., & Xie, X. (2022) · Nature Communications · doi:10.1038/s41467-022-29763-x · Cited by 618
A Generic Federated Recommendation Framework via Fake Marks and Secret Sharing
Lin, Z., Pan, W., Yang, Q., & Ming, Z. (2023) · ACM Transactions on Information Systems · doi:10.1145/3548456 · Cited by 44
Self-citationNeera, J., Chen, X., Aslam, N., Wang, K., & Shu, Z. (2023) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2021.3126577 · Cited by 42
Horizontal Federated Recommender System: A Survey
Wang, L., Zhou, H., Bao, Y., Yan, X., Shen, G., & Kong, X. (2024) · ACM Computing Surveys · doi:10.1145/3656165 · Cited by 37
Poisoning Federated Recommender Systems with Fake Users
Yin, M., Xu, Y., Fang, M., & Gong, N. Z. (2024) · Proceedings of the ACM Web Conference 2024 · doi:10.1145/3589334.3645492 · Cited by 27
“A prevailing application of FL is federated recommender systems (FedRecs) [2, 27, 28, 31, 38, 41, 46], where each participant holds its local interaction information and feature vector.”
BackgroundFederated Matrix Factorization Recommendation Based on Secret Sharing for Privacy Preserving
Zheng, X., Guan, M., Jia, X., Sun, L., & Luo, Y. (2024) · IEEE Transactions on Computational Social Systems · doi:10.1109/tcss.2023.3322824 · Cited by 14
“The federated recommendation system (FedRec) [13], [14] can solve the problem of centralized collection of users’ rating data by untrusted third parties in traditional recommendation systems.”
BackgroundDecentralized Graph Neural Network for Privacy-Preserving Recommendation
Zheng, X., Wang, Z., Chen, C., Qian, J., & Yang, Y. (2023) · Proceedings of the 32nd ACM International Conference on Information and Knowledge Management · doi:10.1145/3583780.3614834 · Cited by 10
FedNRM: A Federal Personalized News Recommendation Model Achieving User Privacy Protection
Yu, S., Jie, Z., Wu, G., Zhang, H., & Shen, S. (2023) · Intelligent Automation & Soft Computing · doi:10.32604/iasc.2023.039911 · Cited by 10
Zhang, L., Li, G., Yuan, L., Ding, X., & Rong, Q. (2024) · Information Processing & Management · doi:10.1016/j.ipm.2023.103580 · Cited by 9
Metadata
- Authors
- Lin, G., Liang, F., Pan, W., & Ming, Z.
- Venue
- IEEE Intelligent Systems
- Published
- 2021-09-01
- Volume
- 36
- Issue
- 5
- Pages
- 21-30
- ISSN
- 1541-1672 (ISSN-L)
- 1941-1294
- OpenAlex
- W3064112253
- Cited by
- 213
- References
- 6
- FWCI
- 18.60
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.