Federated Learning based Latent Factorization of Tensors for Privacy-Preserving QoS Prediction

Shuai Zhong, Zengtong Tang, Di Wu
7/29/2024
cs.LGcs.CR

No confident code implementation found for this paper.

Abstract

In applications related to big data and service computing, dynamic connections tend to be encountered, especially the dynamic data of user-perspective quality of service (QoS) in Web services. They are transformed into high-dimensional and incomplete (HDI) tensors which include abundant temporal pattern information. Latent factorization of tensors (LFT) is an extremely efficient and typical approach for extracting such patterns from an HDI tensor. However, current LFT models require the QoS data to be maintained in a central place (e.g., a central server), which is impossible for increasingly privacy-sensitive users. To address this problem, this article creatively designs a federated learning based on latent factorization of tensors (FL-LFT). It builds a data-density -oriented federated learning model to enable isolated users to collaboratively train a global LFT model while protecting user's privacy. Extensive experiments on a QoS dataset collected from the real world verify that FL-LFT shows a remarkable increase in prediction accuracy when compared to state-of-the-art federated learning (FL) approaches.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{zhong2024federated,
  title  = {Federated Learning based Latent Factorization of Tensors for Privacy-Preserving QoS Prediction},
  author = {Shuai Zhong and Zengtong Tang and Di Wu},
  year   = {2024},
  eprint = {2407.19828},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2407.19828v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2407.19828.svg)](https://codeofpaper.com/paper/2407.19828)

Discussion