CNJC: A cumulative similarity measure for Link Prediction in social networks

Author(s):  
V. Jagadishwari ◽  
I. V. Accamma
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>


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


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.


Sign in / Sign up

Export Citation Format

Share Document