scholarly journals Overcoming the Link Prediction Limitation in Sparse Networks using Community Detection

2021 ◽  
Vol 9 (35) ◽  
pp. 183-190
Author(s):  
Mohammad Pouya Salvati ◽  
Sadegh Sulaimany ◽  
Jamshid Bagherzadeh Mohasefi
2017 ◽  
Vol 95 (4) ◽  
Author(s):  
Caterina De Bacco ◽  
Eleanor A. Power ◽  
Daniel B. Larremore ◽  
Cristopher Moore

2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
Saeed Reza Shahriary ◽  
Mohsen Shahriari ◽  
Rafidah MD Noor

In signed social networks, relationships among nodes are of the types positive (friendship) and negative (hostility). One absorbing issue in signed social networks is predicting sign of edges among people who are members of these networks. Other than edge sign prediction, one can define importance of people or nodes in networks via ranking algorithms. There exist few ranking algorithms for signed graphs; also few studies have shown role of ranking in link prediction problem. Hence, we were motivated to investigate ranking algorithms availed for signed graphs and their effect on sign prediction problem. This paper makes the contribution of using community detection approach for ranking algorithms in signed graphs. Therefore, community detection which is another active area of research in social networks is also investigated in this paper. Community detection algorithms try to find groups of nodes in which they share common properties like similarity. We were able to devise three community-based ranking algorithms which are suitable for signed graphs, and also we evaluated these ranking algorithms via sign prediction problem. These ranking algorithms were tested on three large-scale datasets: Epinions, Slashdot, and Wikipedia. We indicated that, in some cases, these ranking algorithms outperform previous works because their prediction accuracies are better.


2013 ◽  
Vol 41 (4) ◽  
pp. 2097-2122 ◽  
Author(s):  
Arash A. Amini ◽  
Aiyou Chen ◽  
Peter J. Bickel ◽  
Elizaveta Levina

IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
Ming-Ren Chen ◽  
Ping Huang ◽  
Yu Lin ◽  
Shi-Min Cai

2021 ◽  
Vol 2021 ◽  
pp. 1-7
Author(s):  
Chen Jicheng ◽  
Chen Hongchang ◽  
Li Hanchao

Link prediction is a concept of network theory that intends to find a link between two separate network entities. In the present world of social media, this concept has taken root, and its application is seen through numerous social networks. A typical example is 2004, 4 February “TheFeacebook,” currently known as just Facebook. It uses this concept to recommend friends by checking their links using various algorithms. The same goes for shopping and e-commerce sites. Notwithstanding all the merits link prediction presents, they are only enjoyed by large networks. For sparse networks, there is a wide disparity between the links that are likely to form and the ones that include. A barrage of literature has been written to approach this problem; however, they mostly come from the angle of unsupervised learning (UL). While it may seem appropriate based on a dataset’s nature, it does not provide accurate information for sparse networks. Supervised learning could seem reasonable in such cases. This research is aimed at finding the most appropriate link-based link prediction methods in the context of big data based on supervised learning. There is a tone of books written on the same; nonetheless, they are core issues that are not always addressed in these studies, which are critical in understanding the concept of link prediction. This research explicitly looks at the new problems and uses the supervised approach in analyzing them to devise a full-fledge holistic link-based link prediction method. Specifically, the network issues that we will be delving into the lack of specificity in the existing techniques, observational periods, variance reduction, sampling approaches, and topological causes of imbalances. In the subsequent sections of the paper, we explain the theory prediction algorithms, precisely the flow-based process. We specifically address the problems on sparse networks that are never discussed with other prediction methods. The resolutions made by addressing the above techniques place our framework above the previous literature’s unsupervised approaches.


Sign in / Sign up

Export Citation Format

Share Document