scholarly journals SSNE: Effective Node Representation for Link Prediction in Sparse Networks

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.


2021 ◽  
Vol 9 (35) ◽  
pp. 183-190
Author(s):  
Mohammad Pouya Salvati ◽  
Sadegh Sulaimany ◽  
Jamshid Bagherzadeh Mohasefi

2017 ◽  
Vol 25 (0) ◽  
pp. 477-485
Author(s):  
Sho Yokoi ◽  
Hiroshi Kajino ◽  
Hisashi Kashima

2013 ◽  
Vol 27 (12) ◽  
pp. 1350052 ◽  
Author(s):  
CHEN-XI SHAO ◽  
HUI-LING DOU ◽  
RONG-XU YANG ◽  
BING-HONG WANG

Zero-degree nodes are an important difficulty in sparse networks' link prediction. Clustering and preferential attachment, as the most important characteristics of complex networks, have been paid little attention in similarity indices. Inspired by the coexistence of clustering and preferential attachment in real networks, this paper proposes a new preferential attachment index and new clustering index, which have here been integrated into a hybrid index that considers the dynamic evolutionary forces of complex networks and can solve the problem of excessive zero-degree nodes in sparse networks and check evolution mechanism. Experiments proved prediction accuracy can be remarkably enhanced.


Author(s):  
Jeffrey L. Adler

For a wide range of transportation network path search problems, the A* heuristic significantly reduces both search effort and running time when compared to basic label-setting algorithms. The motivation for this research was to determine if additional savings could be attained by further experimenting with refinements to the A* approach. We propose a best neighbor heuristic improvement to the A* algorithm that yields additional benefits by significantly reducing the search effort on sparse networks. The level of reduction in running time improves as the average outdegree of the network decreases and the number of paths sought increases.


2019 ◽  
Vol 534 ◽  
pp. 122346 ◽  
Author(s):  
Mei Wu ◽  
Shunyao Wu ◽  
Qi Zhang ◽  
Chuanyu Xue ◽  
Hongsheng Kan ◽  
...  

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Qing Yao ◽  
Bingsheng Chen ◽  
Tim S. Evans ◽  
Kim Christensen

AbstractWe study the evolution of networks through ‘triplets’—three-node graphlets. We develop a method to compute a transition matrix to describe the evolution of triplets in temporal networks. To identify the importance of higher-order interactions in the evolution of networks, we compare both artificial and real-world data to a model based on pairwise interactions only. The significant differences between the computed matrix and the calculated matrix from the fitted parameters demonstrate that non-pairwise interactions exist for various real-world systems in space and time, such as our data sets. Furthermore, this also reveals that different patterns of higher-order interaction are involved in different real-world situations. To test our approach, we then use these transition matrices as the basis of a link prediction algorithm. We investigate our algorithm’s performance on four temporal networks, comparing our approach against ten other link prediction methods. Our results show that higher-order interactions in both space and time play a crucial role in the evolution of networks as we find our method, along with two other methods based on non-local interactions, give the best overall performance. The results also confirm the concept that the higher-order interaction patterns, i.e., triplet dynamics, can help us understand and predict the evolution of different real-world systems.


Sign in / Sign up

Export Citation Format

Share Document