scholarly journals A Novel Similarity Measure of Link Prediction in Multi-Layer Social Networks Based on Reliable Paths

Author(s):  
Amin Rezaeipanah

Abstract Online social networks are an integral element of modern societies and significantly influence the formation and consolidation of social relationships. In fact, these networks are multi-layered so that there may be multiple links between a user’ on different social networks. In this paper, the link prediction problem for the same user in a two-layer social network is examined, where we consider Twitter and Foursquare networks. Here, information related to the two-layer communication is used to predict links in the Foursquare network. Link prediction aims to discover spurious links or predict the emergence of future links from the current network structure. There are many algorithms for link prediction in unweighted networks, however only a few have been developed for weighted networks. Based on the extraction of topological features from the network structure and the use of reliable paths between users, we developed a novel similarity measure for link prediction. Reliable paths have been proposed to develop unweight local similarity measures to weighted measures. Using these measures, both the existence of links and their weight can be predicted. Empirical analysis shows that the proposed similarity measure achieves superior performance to existing approaches and can more accurately predict future relationships. In addition, the proposed method has better results compared to single-layer networks. Experiments show that the proposed similarity measure has an advantage precision of 1.8% over the Katz and FriendLink measures.

2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Jun Ge ◽  
Lei-lei Shi ◽  
Lu Liu ◽  
Hongwei Shi ◽  
John Panneerselvam

Link prediction in online social networks intends to predict users who are yet to establish their network of friends, with the motivation of offering friend recommendation based on the current network structure and the attributes of nodes. However, many existing link prediction methods do not consider important information such as community characteristics, text information, and growth mechanism. In this paper, we propose an intelligent data management mechanism based on relationship strength according to the characteristics of social networks for achieving a reliable prediction in online social networks. Secondly, by considering the network structure attributes and interest preference of users as important factors affecting the link prediction process in online social networks, we propose further improvements in the prediction process by designing a friend recommendation model with a novel incorporation of the relationship information and interest preference characteristics of users into the community detection algorithm. Finally, extensive experiments conducted on a Twitter dataset demonstrate the effectiveness of our proposed models in both dynamic community detection and link prediction.


2020 ◽  
Author(s):  
Manoel Horta Ribeiro ◽  
Virgílio A. F. Almeida ◽  
Wagner Meira Jr

The popularization of Online Social Networks has changed the dynamics of content creation and consumption. In this setting, society has witnessed an amplification in phenomena such as misinformation and hate speech. This dissertation studies these issues through the lens of users. In three case studies in social networks, we: (i) provide insight on how the perception of what is misinformation is altered by political opinion; (ii) propose a methodology to study hate speech on a user-level, showing that the network structure of users can improve the detection of the phenomenon; (iii) characterize user radicalization in far-right channels on YouTube through time, showing a growing migration towards the consumption of extreme content in the platform.


Author(s):  
Putra Wanda ◽  
Marselina Endah Hiswati ◽  
Huang J. Jie

Manual analysis for malicious prediction in Online Social Networks (OSN) is time-consuming and costly. With growing users within the environment, it becomes one of the main obstacles. Deep learning is growing algorithm that gains a big success in computer vision problem. Currently, many research communities have proposed deep learning techniques to automate security tasks, including anomalous detection, malicious link prediction, and intrusion detection in OSN. Notably, this article describes how deep learning makes the OSN security technique more intelligent for detecting malicious activity by establishing a classifier model.


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>


IEEE Access ◽  
2017 ◽  
Vol 5 ◽  
pp. 12031-12040 ◽  
Author(s):  
Jiangtao Ma ◽  
Yaqiong Qiao ◽  
Guangwu Hu ◽  
Yongzhong Huang ◽  
Meng Wang ◽  
...  

2016 ◽  
Vol 43 (5) ◽  
pp. 683-695 ◽  
Author(s):  
Chuanming Yu ◽  
Xiaoli Zhao ◽  
Lu An ◽  
Xia Lin

With the rapid development of the Internet, the computational analysis of social networks has grown to be a salient issue. Various research analyses social network topics, and a considerable amount of attention has been devoted to the issue of link prediction. Link prediction aims to predict the interactions that might occur between two entities in the network. To this aim, this study proposed a novel path and node combined approach and constructed a methodology for measuring node similarities. The method was illustrated with five real datasets obtained from different types of social networks. An extensive comparison of the proposed method against existing link prediction algorithms was performed to demonstrate that the path and node combined approach achieved much higher mean average precision (MAP) and area under the curve (AUC) values than those that only consider common nodes (e.g. Common Neighbours and Adamic/Adar) or paths (e.g. Random Walk with Restart and FriendLink). The results imply that two nodes are more likely to establish a link if they have more common neighbours of lower degrees. The weight of the path connecting two nodes is inversely proportional to the product of degrees of nodes on the pathway. The combination of node and topological features can substantially improve the performance of similarity-based link prediction, compared with node-dependent and path-dependent approaches. The experiments also demonstrate that the path-dependent approaches outperform the node-dependent appraoches. This indicates that topological features of networks may contribute more to improving performance than node features.


Sign in / Sign up

Export Citation Format

Share Document