Differentially private graph-link analysis based social recommendation-Reference-Cited by-同舟云学术

Differentially private graph-link analysis based social recommendation

Published:2018-10 Issue: Volume:463-464 Page:214-226
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Guo Taolin^ORCID,Luo Junzhou,Dong Kai,Yang Ming

Funder

the National Natural Science Foundation of China

Jiangsu Provincial Natural Science Foundation

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software

Reference55 articles.

1. On k-anonymity and the curse of dimensionality;Aggarwal,2005

2. Personalized recommendation of stories for commenting in forum-based social media;Bach;Inf. Sci.,2016

3. The cost of privacy: destruction of data-mining utility in anonymized data publishing;Brickell,2008

4. Class-based graph anonymization for social network data;Cormode,2009

5. Anonymizing bipartite graph data using safe groupings;Cormode;VLDB J.,2010

Cited by 17 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Community-based social recommendation under local differential privacy protection;Information Sciences;2023-08

2. Differentially Private Friends Recommendation;Foundations and Practice of Security;2023

3. Privacy-aware network embedding-based ensemble for social recommendation;The Journal of Supercomputing;2022-12-27

4. Dual SVD++ Recommendation Model Based on Attention Convolutional Neural Network;2022 IEEE 4th International Conference on Civil Aviation Safety and Information Technology (ICCASIT);2022-10-12

5. Efficient publication of distributed and overlapping graph data under differential privacy;Tsinghua Science and Technology;2022-04