A conceptual framework for privacy preservation of released social network data considering relational dynamic anonymisation

Author(s):  
Preeti Gupta ◽  
Vishal Bhatnagar
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.


Author(s):  
Sanur Sharma ◽  
Vishal Bhatnagar

In recent times, there has been a tremendous increase in the number of social networking sites and their users. With the amount of information posted on the public forums, it becomes essential for the service providers to maintain the privacy of an individual. Anonymization as a technique to secure social network data has gained popularity, but there are challenges in implementing it effectively. In this chapter, the authors have presented a conceptual framework to secure the social network data effectively by using data mining techniques to perform in-depth social network analysis before carrying out the actual anonymization process. The authors’ framework in the first step defines the role of community analysis in social network and its various features and temporal metrics. In the next step, the authors propose the application of those data mining techniques that can deal with the dynamic nature of social network and discover important attributes of the social network. Finally, the authors map their security requirements and their findings of the network properties which provide an appropriate base for selection and application of the anonymization technique to protect privacy of social network data.


Expansion of social network and the publication of its data have directed the risk of disclosure of individuals’ confidential information. Privacy preservation is a must thing before service providers publish the network data. In recent years, privacy in social network data has become the most concerned issue as it has gripped our lives in a dramatic manner. Numerous anonymization methods are there that assists in privacy preservation of social networking and among all, kanonymity is the utmost one that helps in providing the security by developing graph and nodes degree. In this manuscript, the enhancement of K-anonymity has been addressed with major changes in node editing methodology. The clusters are developed with the integration of the same degree in one group and the procedure is iterated till the identification of noisy data. An advanced Cuckoo Search is commenced for minimizing the node miss placement in groups. The results of the Cuckoo Search are integrated with Feed Forward Back Propagation Neural Networks to cross-check the structure and to reduce the node miss placement in groups. Average Path Length (APL) and Information parameters are measured for the evaluation and comparative analysis and the effectiveness of the research has been checked by comparing the results of Aanchal Sharma and P. R. Bhaladhare. There is a diminution of 14.6% while comparing APL with Aanchal Sharma and 8.61% and 10.38% of reduction is shown with Aanchal Sharma and P. R. Bhaladhare for Information loss.


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

2021 ◽  
Vol 7 ◽  
pp. 237802312098525
Author(s):  
Balazs Kovacs ◽  
Nicholas Caplan ◽  
Samuel Grob ◽  
Marissa King

We utilize longitudinal social network data collected pre–COVID-19 in June 2019 and compare them with data collected in the midst of COVID in June 2020. We find significant decreases in network density and global network size following a period of profound social isolation. While there is an overall increase in loneliness during this era, certain social network characteristics of individuals are associated with smaller increases in loneliness. Specifically, we find that people with fewer than five “very close” relationships report increases in loneliness. We further find that face-to-face interactions, as well as the duration and frequency of interactions with very close ties, are associated with smaller increases in loneliness during the pandemic. We also report on factors that do not moderate the effect of social isolation on perceived loneliness, such as gender, age, or overall social network size.


Sign in / Sign up

Export Citation Format

Share Document