Link prediction grounded upon complex networks based model, based on MJMI-RW

Abstract

Link prediction is the process of predicting the connection probability between two nodes based on observable network data, such as network structural topology and node properties. Despite the fact that traditional similarity-based methods are basic and effective, their generalisation performance varies greatly across networks. In this paper, we propose a novel link prediction approach, MJMI-RW, based on the Maxwell Jüttner distribution endowed by the Mutual Information, which recovers the probability of a node's connection by applying node characteristics to a system with less computation. Initially, the method investigates a comprehensive node feature representation by combining diverse structural topology information with node importance properties through feature construction and selection. The selected node features are then fed into a supervised learning task that solves the features matrix using the node features as input. The enhancements of MJMI-RW in terms of the average area under the curve and the precision of state-of-the-art algorithms compared to the finest baseline networks when compared to baseline methods. The limitation of MJMI-RW is its minimal computational complexity feature construction and substitution of complex features with semantic node attributes. Moreover, since inductive matrix completion is a supervised learning task in which the underlying low-rank matrix can be solved by representative nodes instead of all their nodes, it offers a potential link prediction solution for large-scale networks.