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 ◽  
...  

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.

Information ◽  
2021 ◽  
Vol 12 (5) ◽  
pp. 214
Author(s):  
Pokpong Songmuang ◽  
Chainarong Sirisup ◽  
Aroonwan Suebsriwichai

The current methods for missing link prediction in social networks focus on using data from overlapping users from two social network sources to recommend links between unconnected users. To improve prediction of the missing link, this paper presents the use of information from non-overlapping users as additional features in training a prediction model using a machine-learning approach. The proposed features are designed to use together with the common features as extra features to help in tuning up for a better classification model. The social network data sources used in this paper are Twitter and Facebook where Twitter is a main data for prediction and Facebook is a supporting data. For evaluations, a comparison using different machine-learning techniques, feature settings, and different network-density level of data source is studied. The experimental results can be concluded that the prediction model using a combination of the proposed features and the common features with Random Forest technique gained the best efficiency using percentage amount of recovering missing links and F1 score. The model of combined features yields higher percentage of recovering link by an average of 23.25% and the F1-measure by an average of 19.80% than the baseline of multi-social network source.


Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-13 ◽  
Author(s):  
Yanni Liu ◽  
Dongsheng Liu ◽  
Yuwei Chen

With the rapid development of mobile Internet, the social network has become an important platform for users to receive, release, and disseminate information. In order to get more valuable information and implement effective supervision on public opinions, it is necessary to study the public opinions, sentiment tendency, and the evolution of the hot events in social networks of a smart city. In view of social networks’ characteristics such as short text, rich topics, diverse sentiments, and timeliness, this paper conducts text modeling with words co-occurrence based on the topic model. Besides, the sentiment computing and the time factor are incorporated to construct the dynamic topic-sentiment mixture model (TSTS). Then, four hot events were randomly selected from the microblog as datasets to evaluate the TSTS model in terms of topic feature extraction, sentiment analysis, and time change. The results show that the TSTS model is better than the traditional models in topic extraction and sentiment analysis. Meanwhile, by fitting the time curve of hot events, the change rules of comments in the social network is obtained.


2022 ◽  
Vol 2022 ◽  
pp. 1-9
Author(s):  
Huazhang Liu

With the rapid development of the Internet, social networks have shown an unprecedented development trend among college students. Closer social activities among college students have led to the emergence of college students with new social characteristics. The traditional method of college students’ group classification can no longer meet the current demand. Therefore, this paper proposes a social network link prediction method-combination algorithm, which combines neighbor information and a random block. By mining the social networks of college students’ group relationships, the classification of college students’ groups can be realized. Firstly, on the basis of complex network theory, the essential relationship of college student groups under a complex network is analyzed. Secondly, a new combination algorithm is proposed by using the simplest linear combination method to combine the proximity link prediction based on neighbor information and the likelihood analysis link prediction based on a random block. Finally, the proposed combination algorithm is verified by using the social data of college students’ networks. Experimental results show that, compared with the traditional link prediction algorithm, the proposed combination algorithm can effectively dig out the group characteristics of social networks and improve the accuracy of college students’ association classification.


Author(s):  
Gogulamudi Naga Chandrika ◽  
E. Srinivasa Reddy

<p><span>Social Networks progress over time by the addition of new nodes and links, form associations with one community to the other community. Over a few decades, the fast expansion of Social Networks has attracted many researchers to pay more attention towards complex networks, the collection of social data, understand the social behaviors of complex networks and predict future conflicts. Thus, Link prediction is imperative to do research with social networks and network theory. The objective of this research is to find the hidden patterns and uncovered missing links over complex networks. Here, we developed a new similarity measure to predict missing links over social networks. The new method is computed on common neighbors with node-to-node distance to get better accuracy of missing link prediction. </span><span>We tested the proposed measure on a variety of real-world linked datasets which are formed from various linked social networks. The proposed approach performance is compared with contemporary link prediction methods. Our measure makes very effective and intuitive in predicting disappeared links in linked social networks.</span></p>


Author(s):  
Sovan Samanta ◽  
Madhumangal Pal

Social network is a topic of current research. Relations are broken and new relations are increased. This chapter will discuss the scope or predictions of new links in social networks. Here different approaches for link predictions are described. Among them friend recommendation model is latest. There are some other methods like common neighborhood method which is also analyzed here. The comparison among them to predict links in social networks is described. The significance of this research work is to find strong dense networks in future.


Author(s):  
Iman K. Abbood ◽  
Saad Talib Hasson

<p>Social network users spending a lot of time to post, search, interact and read the news on blogging platforms. In this era, social media is becoming a suitable place for discovering and exchanging new updates. However, Common social media helps the user to share his news online by a one-click. The ease-of-use leads to present novel breaking news to show up first on micro blogs. Twitter is one of the well-known micro blogging platforms with more than 250 million users, in which retweeting is a manageable way to share and sawing news. It is significant to foretell the retweeting and influence in a social relationship. The Correlation Coefficient formula has been used to determine the level of correlation between a user and his retweeters (followers, friends, and strangers) in social networks. Such correlation can be reached by utilizing the collected user information on Twitter with some features which have a main effect on retweet behavior. In this study, the focus is on particular friends, followers, and a retweet to be the promising source of relationships between users of social media. Experimental results based on twitter dataset showed that the Correlation Coefficient formula can be used as a predicting model, and it is a general framework to gain better fulfillment in calculating the correlation between the user, friends, and followers in social networks..  Their influence on the accuracy in predicting a retweet is also accomplished.</p>


Author(s):  
Praveen Kumar Bhanodia ◽  
Kamal Kumar Sethi ◽  
Aditya Khamparia ◽  
Babita Pandey ◽  
Shaligram Prajapat

Link prediction in social network has gained momentum with the inception of machine learning. The social networks are evolving into smart dynamic networks possessing various relevant information about the user. The relationship between users can be approximated by evaluation of similarity between the users. Online social network (OSN) refers to the formulation of association (relationship/links) between users known as nodes. Evolution of OSNs such as Facebook, Twitter, Hi-Fi, LinkedIn has provided a momentum to the growth of such social networks, whereby millions of users are joining it. The online social network evolution has motivated scientists and researchers to analyze the data and information of OSN in order to recommend the future friends. Link prediction is a problem instance of such recommendation systems. Link prediction is basically a phenomenon through which potential links between nodes are identified on a network over the period of time. In this chapter, the authors describe the similarity metrics that further would be instrumental in recognition of future links between nodes.


Sign in / Sign up

Export Citation Format

Share Document