Social Network Anonymization via Edge Addition

As social network data contain sensitive information, the need arises for privacy preservation of released social network data for which the most deployed technique is anonymisation. There are a number of anonymisation techniques which have been proposed for privacy preservation in social network data. Not all the anonymisation techniques have been able to provide the desired privacy as they ignore one or more critical parameters. The purpose of this paper is to propose the parameters for anonymisation of released social network data based on the cross-pollination of information related to anonymisation of social network data. Analysing the anonymisation techniques on these parameters would provide a clear understanding in a more realist dimension. These parameters would help the service provider of the social network for choosing the suitable anonymisation technique. These parameters would also help the future researchers to design or improve the anonymisation technique for privacy preservation in social network.

2. INTRODUCTION Since the inception of online social networks, the amount of social data that is being published on a daily basis has been increasing at an unprecedented rate. Smart, GPS-enabled, always-connected personal devices have taken the data generation to a new level by making it tremendously easy to generate and share social content like check-in information, likes, microblogs (e.g., Twitter), multimedia data, and so on. There is an enormous value in reasoning about such streaming data and deriving meaningful insights from it in real-time. Examples of potential applications include advertising, sentiment analysis, detecting natural disasters, social recommendations, personalized trends, spam detection, to name a few. There is thus an increasing need to build scalable systems to support such applications. Complex nature of social networks and their rapid evolution, coupled with the huge volume of streaming social data and the need for real-time processing, raise many computational challenges that have not been addressed in prior work. Social network data comprises of two major components. First, there is a network (linkage) component that captures the underlying interconnection structure among the entities in the social network. Second, there is content data that is typically associated with the nodes and the edges in the social network. The social network data stream contains updates to both these components. The structure of the network may itself change rapidly in many cases, especially when things like webpages and user tags (e.g., Twitter hashtags) are treated as nodes of the network. However, most of the social network data stream consists of updates to the data associated with the nodes and the edges, e.g., status updates and other content uploaded by the users, communication among the users, and so on. There is interest in performing a wide variety of queries and analytics over such data streams in real time. The queries can range from simple publish-subscribe queries, where a user is interested in being notified when something happens in his friend circle, to complex anomaly detection queries, where the goal is to identify anomalous behavior as early as possible. In this paper, we present an introduction to this new research area of stream querying and reasoning over social data. This area combines aspects from several well-studied research areas, chief among them, social network analysis, graph databases, and data streams. We provide a formal definition of the problem, survey the related prior work, and discuss some of the key research challenges that need to be addressed (and some of the solutions that have been proposed). We note that we use the term stream reasoning in this paper to encompass a broad range of tasks including various types of analytics, probabilistic reasoning, statistical inference, and logical reasoning. We contrast our use of this term with the recent work by Valle et al. [104, 105] who define this term more specifically to refer to integration of logical reasoning systems with data streams in the context of the Semantic Web. Given the vast amount of work on this and related topics, it is not our intention to be comprehensive in this brief overview. Rather we aim to cover some of the key ideas and representative work.

Social support networks have been become one of the mostly influential metaphors in many areas around the world, especially in terms of mitigating disaster consequences and revivifying disaster affected livelihoods. More importantly, reciprocal supports ties are more powerful in healing disaster wounds of communities. Especially social capital legacies enrich by reciprocal support networks by the ways in which making may hopes among disaster victims. In this context, the objective of this study is to investigate the social support network behaviors in supporting 16 flood-affected households in the mass flooding event occurred in 2017. Particularly, the study researched social support network behaviors at different flood inundation phases such as before, during, and after. This study collected primary data (mainly social network data) using household survey and filed observations. The study used the Social Network Analysis (SNA) method for the network data analysis. This article shows that flood affected households have received social network supports in different magnitudes at before, during, and after flood inundation phases. More importantly, provision of foods, water and basic needs, sheltering, clearing contaminated households, and emotional supports have mobilized and reciprocated among victims in reviving their livelihoods. The social support network legacies have evolved at different flood inundation phases. This study fills the gabs in the flood disaster discourse on Sri Lankan context.

Graph anonymization is a necessary process before any publication of data from a social network in order to preserve the privacy of individuals, especially when these networks contain sensitive or personally identifiable information, such as social contacts, personal opinions and recordings of private communications. So, this publication can therefore constitute a threat to privacy. Generally, this simple procedure is not sufficient, some inference attacks on the published graph can lead to de-anonymize certain nodes, to learn the existence of a social relation between two nodes or to use the structure of the graph itself to deduce the value of certain sensitive attributes. For this reason, several anonymization techniques were proposed in the literature to combat this problem, they modify the structure of the social graph by adding and/or removing nodes and/or edges, these methods can be classified as Graph Modification, Generalization or Clustering and Differential Privacy Models. In this paper, we present a brief yet systematic review of the existing anonymization techniques for privacy preserving publishing of social network data. We identify the best graph anonymization method that ensure a high confidentiality level after making a clear comparison between them. Finally, we present our perspective or our proposition that still under development which is based on differential privacy method and attacking the graph processing in different ways at the same time, graph structure and node attributes.

SummaryAnonymization is a practical solution for preserving user's identity privacy before data publishing. There are various anonymity techniques can be applied to maintain data utility of micro‐data and social networks, however these methods lead to a high runtime or low anonymous graph utility. In this article, an efficient, utility‐preserving approach has been proposed to reduce anonymization runtime as well as the amount of information loss incurred by graph anonymization. We craft our anonymization algorithm by combining greedy partition‐based aggregating with multi‐dimensional sorting as main heuristic tools. The proposed algorithm generates a partial order of the vertices so that the vertex at top rank and another vertex at bottom rank can never be aggregated in the same group, the runtime is reduced. Greedy partition‐based aggregating is employed to create ‐anonymous clusters which minimizing information loss. Experimental results on real‐world datasets show the proposed method has good performance and is superior to the existing methods.

Recently, as more and more social network data has been published in one way or another, preserving privacy in publishing social network data becomes an important concern. With some local knowledge about individuals in a social network, an adversary may attack the privacy of some victims easily. Unfortunately, most of the previous studies on privacy preservation can deal with relational data only, and cannot be applied to social network data. In this paper, we take an initiative towards preserving privacy in social network data. We identify an essential type of privacy attacks: neighborhood attacks. If an adversary has some knowledge about the neighbors of a target victim and the relationship among the neighbors, the victim may be re-identified from a social network even if the victim's identity is preserved using the conventional anonymization techniques. We show that the problem is challenging, and present a practical solution to battle neighborhood attacks. The empirical study indicates that anonymized social networks generated by our method can still be used to answer aggregate network queries with high accuracy.

Grouping users in social networks is an important process that improves matching and recommendation activities in social networks. The data mining methods of clustering can be used in grouping the users in social networks. However, the existing general purpose clustering algorithms perform poorly on the social network data due to the special nature of users' data in social networks. One main reason is the constraints that need to be considered in grouping users in social networks. Another reason is the need of capturing large amount of information about users which imposes computational complexity to an algorithm. In this paper, we propose a scalable and effective constraint-based clustering algorithm based on a global similarity measure that takes into consideration the users' constraints and their importance in social networks. Each constraint's importance is calculated based on the occurrence of this constraint in the dataset. Performance of the algorithm is demonstrated on a dataset obtained from an online dating website using internal and external evaluation measures. Results show that the proposed algorithm is able to increases the accuracy of matching users in social networks by 10% in comparison to other algorithms.

Klein cordial trees and odd cyclic cordial friendship graphs

Every day, vast amounts of social networking data is being produced and consumed at a constantly increasing rate. A user’s digital footprint coming from social networks or mobile devices, such as comments, check-ins and GPS traces contains valuable information about her behavior under normal as well as emergency conditions. The collection and analysis of mobile and social networking data before, during and after a disaster opens new perspectives in areas such as real-time event detection, crisis management and personalization and provides valuable insights about the extent of the disaster, its impact on the affected population and the rate of disaster recovery. Traditional storage and processing systems are unable to cope with the size of the collected data and the complexity of the applied analysis, thus distributed approaches are usually employed. In this work, we propose an open-source distributed platform that can serve as a backend for applications and services related to crisis detection and management by combining spatio-textual user generated data. The system focuses on scalability and relies on a combination of state-of-the art Big Data frameworks. It currently supports the most popular social networks, being easily extensible to any social platform. The experimental evaluation of our prototype attests its performance and scalability even under heavy load, using different query types over various cluster sizes.

The traditional data query algorithm based on clustering strategy library ignores the association features of social network data, characteristic data acquisition exist a large number of redundant features and frequent relationship among features is low, resulting in the social network data query efficiency and the accuracy is poor, so a fast query algorithm for social network data based on fuzzy degree function based on association features is proposed, it is based on Apriori algorithm for data association feature mining of social network to obtain the maximum frequent association feature set; for association feature preprocessing, it reduce the maximum frequent association feature set by feature dimension reduction and de redundancy algorithm, to obtain better social network maximal frequent associated feature set; when using fuzzy function to query social network data quickly, it uses data of a single gene ambiguity function to build a fast data query diagram, input the best frequent feature set of social network, and output the query results of social network data with the highest priority. The experimental results show that the proposed algorithm has the advantages of high efficiency and high accuracy in social network data query.

Social networks contain sensitive information, and direct press conferences disclose people’s privacy. The published social network data needs privacy protection. The currently released social network data has seriously damaged the network structure due to privacy protection. This paper proposes a social network graph publishing model that preserves the social network structure. This model builds an uncertainty graph based on privacy protection probability to generate social network data for publication. It is proved theoretically that the social network graph publishing model satisfies the definition of differential privacy. This paper uses three real social network datasets to evaluate the effectiveness of the proposed method, showing that the method effectively retains the network structure.

A categorial approach to reaction systems: First steps

Online social networking (SN) data is a context and time rich data stream that has showed potential for predicting suicidal ideation and behaviour. Despite the obvious benefits of this digital media, predictive modelling of acute suicidal ideation (SI) remains underdeveloped at now. In combined with robust machine learning algorithms, social networking data may provide a potential path ahead. Researchers applied a machine learning models to a previously published Instagram dataset of youths. Using predictors that reflect language use and activity inside this social networking, researchers compared the performance of the out-of-sample, cross-validated model to that of earlier efforts and used a model explanation to further investigate relative predictor relevance and subject-level phenomenology. The application of ensemble learning approaches to SN data for the prediction of acute SI may reduce the complications and modelling issues associated with acute SI at these time scales. Future research is required on bigger, more diversified populations to refine digital biomarkers and assess their external validity with more rigor

With the constant increase of social-network data published, the privacy preservation becomes more and more important. Although some literature algorithms apply K-anonymity to the relational data to prevent an adversary from significantly perpetrating privacy breaches, the inappropriate choice of K has a big impact on the quality of privacy protection and data utility. We propose a technique named Relationship Privacy Preservation based on Compressive Sensing (RPPCS) in this paper to anonymize the relationship data of social networks. The network links are randomized from the recovery of the random measurements of the sparse relationship matrix to both preserve the privacy and data utility. Two comprehensive sets of real-world relationship data on social networks are applied to evaluate the performance of our anonymization technique. Our performance evaluations based on Collaboration Network and Gnutella Network demonstrate that our scheme can better preserve the utility of the anonymized data compared to peer schemes. Privacy analysis shows that our scheme can resist the background knowledge attack.

Social communication networks created during the 2018 earthquake sequence in Lombok, Indonesia using social network data from a social media platform, i.e., Facebook, and surveys in local communities were analyzed. The different modes of communication networks used during the disaster event and post-disaster mitigation were examined. Data on social media platform usage were collected from the Facebook page of the Agency for Meteorology, Climatology and Geophysics of Indonesia and the National Board for Disaster Management of Indonesia. The data show large clusters of social relation networks based on dominant issues discussed by the public under several trending hashtags. Meanwhile, the local patterns of social communication networks, particularly the flow of information and communication used by the local communities of the impacted villages in Lombok, differ depending on the culture of communication and time of accessing information. During the 2018 Lombok earthquake sequence, communication was predominantly sought from community leaders, religious leaders, family members, and neighbours. This study highlights the implementation of a decentralization system in Indonesia, which has given the local and regional authorities a significant role in disaster management, response, and emergency command for the local and regional community, instead of relying largely on the response of the central Jakarta government.