scholarly journals DP-FT: A Differential Privacy Graph Generation With Field Theory for Social Network Data Release

IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 164304-164319
Author(s):  
Hong Zhu ◽  
Xin Zuo ◽  
Meiyi Xie
2018 ◽  
Vol 33 (2) ◽  
pp. 61-69
Author(s):  
Tianqing Zhu ◽  
Mengmeng Yang ◽  
Ping Xiong ◽  
Yang Xiang ◽  
Wanlei Zhou

Author(s):  
Kamalkumar Macwan ◽  
Sankita Patel

Recently, the social network platforms have gained the attention of people worldwide. People post, share, and update their views freely on such platforms. The huge data contained on social networks are utilized for various purposes like research, market analysis, product popularity, prediction, etc. Although it provides so much useful information, it raises the issue regarding user privacy. This chapter discusses the various privacy preservation methods applied to the original social network dataset to preserve privacy against attacks. The two areas for privacy preservation approaches addressed in this chapter are anonymization in social network data publication and differential privacy in node degree publishing.


2021 ◽  
Vol 2021 ◽  
pp. 1-16
Author(s):  
Tianzi Lv ◽  
Huanzhou Li ◽  
Zhangguo Tang ◽  
Fangzhou Fu ◽  
Jian Cao ◽  
...  

The continuous expansion of the number and scale of social networking sites has led to an explosive growth of social network data. Mining and analyzing social network data can bring huge economic value and social benefits, but it will result in privacy leakage and other issues. The research focus of social network data publishing is to publish available data while ensuring privacy. Aiming at the problem of low data availability of social network node triangle counting publishing under differential privacy, this paper proposes a privacy protection method of edge triangle counting. First, an edge-removal projection algorithm TSER based on edge triangle count sorting is proposed to obtain the upper bound of sensitivity. Then, two edge triangle count histogram publishing methods satisfying edge difference privacy are given based on the TSER algorithm. Finally, experimental results show that compared with the existing algorithms, the TSER algorithm can retain more triangles in the original graph, reduce the error between the published data and the original data, and improve the published data availability.


2015 ◽  
Vol 21 ◽  
pp. 301
Author(s):  
Armand Krikorian ◽  
Lily Peng ◽  
Zubair Ilyas ◽  
Joumana Chaiban

Methodology ◽  
2006 ◽  
Vol 2 (1) ◽  
pp. 42-47 ◽  
Author(s):  
Bonne J. H. Zijlstra ◽  
Marijtje A. J. van Duijn ◽  
Tom A. B. Snijders

The p 2 model is a random effects model with covariates for the analysis of binary directed social network data coming from a single observation of a social network. Here, a multilevel variant of the p 2 model is proposed for the case of multiple observations of social networks, for example, in a sample of schools. The multilevel p 2 model defines an identical p 2 model for each independent observation of the social network, where parameters are allowed to vary across the multiple networks. The multilevel p 2 model is estimated with a Bayesian Markov Chain Monte Carlo (MCMC) algorithm that was implemented in free software for the statistical analysis of complete social network data, called StOCNET. The new model is illustrated with a study on the received practical support by Dutch high school pupils of different ethnic backgrounds.


Data in Brief ◽  
2021 ◽  
Vol 35 ◽  
pp. 106898
Author(s):  
Cordelia Sophie Kreft ◽  
Mario Angst ◽  
Robert Huber ◽  
Robert Finger

Sign in / Sign up

Export Citation Format

Share Document