Affiliation:
1. University School of Information, Communication and Technology, Guru Gobind Singh (GGS) Indraprastha University, New Delhi 110078, India
Abstract
AbstractInterconnections among real-world entities through explicit or implicit relationships form complex networks, such as social, economic and engineering systems. Recently, the studies based on such complex networks have provided a boost to our understanding of various events and processes ranging from biology to technology. Link prediction algorithms assist in predicting, analysing and deciphering more significant details about the networks and their future structures. In this study, we propose three different link prediction algorithms based on different structural features of the network combined with the information-theoretic analyses. The first two algorithms (variants) are developed for unweighted networks, while the third approach deals with the weighted ones. The proposed methods exhibit better and robust performances in the majority of cases, and at least comparable, if not better in other cases. This work is built upon the previously published mutual information-based approaches for link prediction; however, this study considers structural features of the network to augment mutual information measures and provides insights for finding hidden links in the network.
Publisher
Oxford University Press (OUP)
Subject
Applied Mathematics,Computational Mathematics,Control and Optimization,Management Science and Operations Research,Computer Networks and Communications
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献