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

被引:70
作者
Zhou, Pan [1 ]
Wang, Kehao [2 ]
Guo, Linke [3 ]
Gong, Shimin [4 ]
Zheng, Bolong [5 ]
机构
[1] Huazhong Univ Sci & Technol, Sch Elect Informat & Commun, Wuhan 430074, Peoples R China
[2] Wuhan Univ Technol, Hubei Key Lab Broadband Wireless Commun & Sensor, Wuhan 430070, Peoples R China
[3] Clemson Univ, Dept Elect & Comp Engn, Clemson, SC 29634 USA
[4] Sun Yat Sen Univ, Sch Intelligent Syst Engn, Guangzhou 510275, Peoples R China
[5] Huazhong Univ Sci & Technol, Sch Comp Sci & Technol, Wuhan 430074, Peoples R China
关键词
Big Data; Privacy; Recommender systems; Social networking (online); Context modeling; Prediction algorithms; Differential privacy; Recommender system; differential privacy; online learning; federated Learning; big data; distributed and scalable model; cloud computing; mobile edge computing; IMPLICIT; EXPLICIT; TRUST;
D O I
10.1109/TKDE.2019.2936565
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:824 / 838
页数:15
相关论文
共 54 条
[1]   Mobile Edge Computing: A Survey [J].
Abbas, Nasir ;
Zhang, Yan ;
Taherkordi, Amir ;
Skeie, Tor .
IEEE INTERNET OF THINGS JOURNAL, 2018, 5 (01) :450-465
[2]   Incorporating contextual information in recommender systems using a multidimensional approach [J].
Adomavicius, G ;
Sankaranarayanan, R ;
Sen, S ;
Tuzhilin, A .
ACM TRANSACTIONS ON INFORMATION SYSTEMS, 2005, 23 (01) :103-145
[3]  
Adomavicius G, 2011, RECOMMENDER SYSTEMS HANDBOOK, P217, DOI 10.1007/978-0-387-85820-3_7
[4]  
Aggarwal Charu C., 2005, P 31 INT C VER LARG, P901, DOI DOI 10.5555/1083592.1083696
[5]  
[Anonymous], 2012, NW J TECHNOLOGY INTE
[6]  
[Anonymous], 2013, International Journal of Engineering Trends and Technology
[7]  
[Anonymous], 2011, ACM T INFORM SYSTEM
[8]  
[Anonymous], 2012, QUANTA MAG
[9]  
[Anonymous], 2008, P 14 ACM SIGKDD INT, DOI DOI 10.1145/1401890.1401904
[10]   Finite-time analysis of the multiarmed bandit problem [J].
Auer, P ;
Cesa-Bianchi, N ;
Fischer, P .
MACHINE LEARNING, 2002, 47 (2-3) :235-256