A Privacy-Preserving Distributed Contextual Federated Online Learning Framework with Big Data Support in Social Recommender Systems

• Published in: IEEE transactions on knowledge and data engineering 2021-03, Vol.33 (3), p.824-838
• Main Authors: Zhou, Pan, Wang, Kehao, Guo, Linke, Gong, Shimin, Zheng, Bolong
• Format: Article
• Language: English
• Subjects: Accuracy; Algorithms; Big Data; cloud computing; Collaboration; Context; Context modeling; Customization; Datasets; Differential privacy; Distance learning; distributed and scalable model; federated Learning; Machine learning; mobile edge computing; online learning; Prediction algorithms; Privacy; Reagents; Recommender system; Recommender systems; Social networking (online); Social networks
• ISSN: 1041-4347; 1558-2191
• DOI: 10.1109/TKDE.2019.2936565

Nowadays, the booming demand of big data analytics and the constraints of computational ability and network bandwidth have made it difficult for a stand-alone agent/service provider to provide suitable information for every user from the large volume online data within the limited time. To handle this challenge, a recommender system (RS) can call in a group of agents to collaborate to learn users' preference and taste, which is known as a distributed recommender system (DRS). DRSs can improve the accuracy of a traditional RS by requesting agents to share information with each other. However, it is challenging for DRSs to make personalized recommendations for each user due to the large amount of candidates. In addition, information sharing among agents raises a privacy concern. Thus, we propose a privacy-preserving DRS in this paper, and then model each service provider as a distributed online learner with context-awareness. Service providers collaborate to make personalized recommendations by learning users' preferences according to the user context and users' history behaviors. We adopt the federated learning framework to help train a high quality privacy- preserving centralized model over a large number of distributed agents which is probably unreliable with relatively slow network connections. To handle big data scenario, we build an item-cluster tree to deal with online and increasing datasets from top to the bottom . We further consider the structure of social network and present an efficient algorithm to avoid more performance loss adaptively. Theoretical proofs show that our proposed algorithm can achieve sublinear regret and differential privacy protection simultaneously for service providers and users. Numerical results confirm that our novel framework can handle increasing big datasets and strike a trade-off between privacy-preserving level and the prediction accuracy.