scholarly journals A Novel Graph-modification Technique for User Privacy-preserving on Social Networks

2019 ◽  
Vol 3 ◽  
pp. 27-38 ◽  
Author(s):  
Seyedeh Hamideh Erfani ◽  
Reza Mortazavi
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Challenging Problem ◽  
User Privacy ◽  
Network Graph ◽  
Related Data ◽  
Minimum Number ◽  
Modification Technique ◽  
Utility Metrics ◽  
Edge Addition

The growing popularity of social networks and the increasing need for publishing related data mean that protection of privacy becomes an important and challenging problem in social networks. This paper describes the (k,l k,l k,l)-anonymity model used for social network graph anonymization. The method is based on edge addition and is utility-aware, i.e. it is designed to generate a graph that is similar to the original one. Different strategies are evaluated to this end and the results are compared based on common utility metrics. The outputs confirm that the na¨ıve idea of adding some random or even minimum number of possible edges does not always produce useful anonymized social network graphs, thus creating some interesting alternatives for graph anonymization techniques.

Prediction of Social Influence for Provenance of Misinformation in Online Social Network Using Big Data Approach

2020 ◽  
Author(s):  
Kumaran P ◽  
Rajeswari Sridhar
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Law Enforcement ◽  
Online Social Networks ◽  
Large Scale ◽  
Online Social Network ◽  
Root Cause ◽  
Minimum Number ◽  
Targeted Marketing ◽  
Implicit And Explicit

Abstract Online social networks (OSNs) is a platform that plays an essential role in identifying misinformation like false rumors, insults, pranks, hoaxes, spear phishing and computational propaganda in a better way. Detection of misinformation finds its applications in areas such as law enforcement to pinpoint culprits who spread rumors to harm the society, targeted marketing in e-commerce to identify the user who originates dissatisfaction messages about products or services that harm an organizations reputation. The process of identifying and detecting misinformation is very crucial in complex social networks. As misinformation in social network is identified by designing and placing the monitors, computing the minimum number of monitors for detecting misinformation is a very trivial work in the complex social network. The proposed approach determines the top suspected sources of misinformation using a tweet polarity-based ranking system in tandem with sarcasm detection (both implicit and explicit sarcasm) with optimization approaches on large-scale incomplete network. The algorithm subsequently uses this determined feature to place the minimum set of monitors in the network for detecting misinformation. The proposed work focuses on the timely detection of misinformation by limiting the distance between the suspected sources and the monitors. The proposed work also determines the root cause of misinformation (provenance) by using a combination of network-based and content-based approaches. The proposed work is compared with the state-of-art work and has observed that the proposed algorithm produces better results than existing methods.

scholarly journals Election Control in Social Networks via Edge Addition or Removal

2020 ◽  
Vol 34 (02) ◽  
pp. 1878-1885
Author(s):  
Matteo Castiglioni ◽  
Diodato Ferraioli ◽  
Nicola Gatti
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Positive Result ◽  
Optimization Problem ◽  
Optimal Solution ◽  
The Social ◽  
Wide Range ◽  
Local Modification ◽  
Edge Addition ◽  
Over Time

We focus on the scenario in which messages pro and/or against one or multiple candidates are spread through a social network in order to affect the votes of the receivers. Several results are known in the literature when the manipulator can make seeding by buying influencers. In this paper, instead, we assume the set of influencers and their messages to be given, and we ask whether a manipulator (e.g., the platform) can alter the outcome of the election by adding or removing edges in the social network. We study a wide range of cases distinguishing for the number of candidates or for the kind of messages spread over the network. We provide a positive result, showing that, except for trivial cases, manipulation is not affordable, the optimization problem being hard even if the manipulator has an unlimited budget (i.e., he can add or remove as many edges as desired). Furthermore, we prove that our hardness results still hold in a reoptimization variant, where the manipulator already knows an optimal solution to the problem and needs to compute a new solution once a local modification occurs (e.g., in bandit scenarios where estimations related to random variables change over time).

scholarly journals A METHOD TO IMPROVE THE TIME OF COMPUTING BETWEENNESS CENTRALITY IN SOCIAL NETWORK GRAPH

2019 ◽  
Vol 57 (3) ◽  
pp. 344
Author(s):  
Dung Xuan Nguyen ◽  
Ban Van Doan ◽  
Ngoc Thi Bich Do
Keyword(s):  
Social Networks ◽  
Graph Theory ◽  
Social Network ◽  
Execution Time ◽  
Betweenness Centrality ◽  
Computing Time ◽  
Network Graph ◽  
The Social

The Betweenness centrality is an important metric in the graph theory and can be applied in the analyzing social network. The main researches about Betweenness centrality often focus on reducing the complexity. Nowadays, the number of users in the social networks is huge. Thus, improving the computing time of Betweenness centrality to apply in the social network is neccessary. In this paper, we propose the algorithm of computing Betweenness centrality by reduce the similar nodes in the graph in order to reducing computing time. Our experiments with graph networks result shows that the computing time of the proposed algorithm is less than Brandes algorithm. The proposed algorithm is compared with the Brandes algorithm [3] in term of execution time.

scholarly journals An efficient method to detect communities in social networks

2021 ◽  
Author(s):  
MEHJABIN KHATOON ◽  
W AISHA BANU
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Social Interactions ◽  
Community Detection ◽  
Average Degree ◽  
Data Sets ◽  
Time Data ◽  
Network Graph ◽  
The Social ◽  
Metric Functions

Abstract Social networks represent the social structure, which is composed of individuals having social interactions among them. The interactions between the units in a social network represent the relations of the various social contacts and aim at finding different individuals in that network, with similar interests. It is a challenging problem to detect the social interactions between individuals with comparable considerations and desires from a large social network, which can be termed as community detection. Detection of the communities from social networks has been done by other authors previously, and many community identification algorithms were also proposed, but those communities' identification has been achieved on the online available data sets. The proposed algorithm in this paper has been named as Average Degree Newman Girvan (ADNG) algorithm, which can easily identify the communities from the real-time data sets, collected from the social network websites. The approach presented here is based on first determining the average degree of the network graph and then identifying the communities using the Newman Girvan algorithm. The proposed algorithm has been compared with four community detection algorithms, i.e., Leading eigenvector (LEC) algorithm, Fastgreedy (FG) algorithm, Leiden algorithm and Kernighan-Lin (KL) algorithm based on a few metric functions. This algorithm helps to detect communities for different domains, like for any proposed government policy, online shopping products, newly launched products in a market, etc.

Design of a Data Model for Social Networks Applications

2009 ◽  
pp. 360-385
Author(s):  
Susanta Mitra ◽  
Aditya Bagchi ◽  
A. K. Bandyopadhyay
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Data Model ◽  
Generic Model ◽  
Social Community ◽  
Graph Data ◽  
Related Data ◽  
Network Applications ◽  
Object Relational ◽  
The Common

A social network defines the structure of a social community like an organization or institution, covering its members and their inter-relationships. Social relationships among the members of a community can be of different types like friendship, kinship, professional, academic etc. Traditionally, a social network is represented by a directed graph. Analysis of graph structure representing a social network is done by the sociologists to study a community. Hardly any effort has been made to design a data model to store and retrieve a social network related data. In this paper, an object-relational graph data model has been proposed for modeling a social network. The objective is to illustrate the power of this generic model to represent the common structural and node-based properties of different social network applications. A novel multi-paradigm architecture has been proposed to efficiently manage the system. New structural operators have been defined in the paper and the application of these operators has been illustrated through query examples. The completeness and the minimality of the operators have also been shown.

scholarly journals Trust-Based Missing Link Prediction in Signed Social Networks with Privacy Preservation

2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
Huaizhen Kou ◽  
Fan Wang ◽  
Chao Lv ◽  
Zhaoan Dong ◽  
Wanli Huang ◽  
...  
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Privacy Protection ◽  
Link Prediction ◽  
Social Relationship ◽  
Hamming Distance ◽  
Mobile Internet ◽  
User Privacy ◽  
Missing Link ◽  
Signed Social Networks

With the development of mobile Internet, more and more individuals and institutions tend to express their views on certain things (such as software and music) on social platforms. In some online social network services, users are allowed to label users with similar interests as “trust” to get the information they want and use “distrust” to label users with opposite interests to avoid browsing content they do not want to see. The networks containing such trust relationships and distrust relationships are named signed social networks (SSNs), and some real-world complex systems can be also modeled with signed networks. However, the sparse social relationships seriously hinder the expansion of users’ social circle in social networks. In order to solve this problem, researchers have done a lot of research on link prediction. Although these studies have been proved to be effective in the unsigned social network, the prediction of trust and distrust in SSN has not achieved good results. In addition, the existing link prediction research does not consider the needs of user privacy protection, so most of them do not add privacy protection measures. To solve these problems, we propose a trust-based missing link prediction method (TMLP). First, we use the simhash method to create a hash index for each user. Then, we calculate the Hamming distance between the two users to determine whether they can establish a new social relationship. Finally, we use the fuzzy computing model to determine the type of their new social relationship (e.g., trust or distrust). In the paper, we gradually explain our method through a case study and prove our method’s feasibility.

scholarly journals Privacy-Preserving Assessment of Social Network Data Trustworthiness

2014 ◽  
Vol 23 (02) ◽  
pp. 1441004 ◽  
Author(s):  
Chenyun Dai ◽  
Fang-Yu Rao ◽  
Traian Marius Truta ◽  
Elisa Bertino
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Online Social Networks ◽  
Network Data ◽  
Challenging Problem ◽  
Privacy Concerns ◽  
Useful Knowledge ◽  
Social Network Data ◽  
Series Of Experiments ◽  
Data Trustworthiness

Extracting useful knowledge from social network datasets is a challenging problem. While large online social networks such as Facebook and LinkedIn are well known and gather millions of users, small social networks are today becoming increasingly common. Many corporations already use existing social networks to connect to their customers. Seeing the increasing usage of small social networks, such companies will likely start to create in-house online social networks where they will own the data shared by customers. The trustworthiness of these online social networks is essentially important for decision making of those companies. In this paper, our goal is to assess the trustworthiness of local social network data by referencing external social networks. To add to the difficulty of this problem, privacy concerns that exist for many social network datasets have restricted the ability to analyze these networks and consequently to maximize the knowledge that can be extracted from them. This paper addresses this issue by introducing the problem of data trustworthiness in social networks when repositories of anonymized social networks exist that can be used to assess such trustworthiness. Three trust score computation models (absolute, relative, and weighted) that can be instantiated for specific anonymization models are defined and algorithms to calculate these trust scores are developed. Using both real and synthetic social networks, the usefulness of the trust score computation is validated through a series of experiments.

scholarly journals An Efficient Method to Detect Communities in Social Networks

2020 ◽  
Author(s):  
MEHJABIN KHATOON ◽  
W. Aisha Banu
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Social Interactions ◽  
Community Detection ◽  
Average Degree ◽  
Data Sets ◽  
Time Data ◽  
Network Graph ◽  
The Social ◽  
Metric Functions

Abstract Social networks represent the social structure, which is composed of individuals having social interactions among them. The interactions between the units in a social network represent the relations of the various social contacts and aim at finding different individuals in that network, with similar interests. It is a challenging problem to detect the social interactions between individuals with comparable considerations and desires from a large social network, which can be termed as community detection. Detection of the communities from social networks has been done by other authors previously, and many community identification algorithms were also proposed, but those communities' identification has been achieved on the online available data sets. The proposed algorithm in this paper has been named as Average Degree Newman Girvan (ADNG) algorithm, which can easily identify the communities from the real-time data sets, collected from the social network websites. The approach presented here is based on first determining the average degree of the network graph and then identifying the communities using the Newman Girvan algorithm. The proposed algorithm has been compared with three community detection algorithms, i.e., Leading eigenvector (LEC) algorithm, Fastgreedy (FG) algorithm, and Kernighan-Lin (KL) algorithm based on a few metric functions. This algorithm helps to detect communities for different domains, like for any proposed government policy, online shopping products, newly launched products in a market, etc.

scholarly journals A Label Propagation Based User Locations Prediction Algorithm in Social Network

2020 ◽  
pp. 165-174
Author(s):  
Huan Ma ◽  
Wei Wang
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Community Detection ◽  
Label Propagation ◽  
Prediction Algorithm ◽  
Location Prediction ◽  
Network Graph ◽  
Propagation Algorithm ◽  
Node Location ◽  
User Location

AbstractNetwork community detection is an important service provided by social networks, and social network user location can greatly improve the quality of community detection. Label propagation is one of the main methods to realize the user location prediction. The traditional label propagation algorithm has the problems including “location label countercurrent” and the update randomness of node location label, which seriously affects the accuracy of user location prediction. In this paper, a new location prediction algorithm for social networks based on improved label propagation algorithm is proposed. By computing the K-hop public neighbor of any two point in the social network graph, the nodes with the maximal similarity and their K-hopping neighbors are merged to constitute the initial label propagation set. The degree of nodes not in the initial set are calculated. The node location labels are updated asynchronously is adopted during the iterative process, and the node with the largest degree is selected to update the location label. The improvement proposed solves the “location label countercurrent” and reduces location label updating randomness. The experimental results show that the proposed algorithm improves the accuracy of position prediction and reduces the time cost compared with the traditional algorithms.

Sign in / Sign up

Export Citation Format

Share Document