Path extension similarity link prediction method based on matrix algebra in directed networks

• Published in: Computer communications Vol. 187; pp. 83 - 92
• Main Authors: Guo, Feipeng, Zhou, Wei, Lu, Qibei, Zhang, Chen
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 01.04.2022
• Subjects: Communication network; Directed network; Link prediction; Matrix algebra; Path extension; Link prediction; Path extension; Directed network; Matrix algebra; Communication network
• ISSN: 0140-3664
• DOI: 10.1016/j.comcom.2022.02.002

Traditional link prediction methods are generally only calculated for the neighbor information of nodes, and the network path between nodes has not been fully utilized. Therefore, this paper proposes a directed network link prediction method based on path extension similarity to improve the prediction accuracy of potential edges of network nodes. Firstly, the mathematical definition of each local index is expressed in matrix form through matrix algebra; secondly, according to the algorithm principle of global and quasi-local indices, the extension form of local indices is clarified; and the path extension of each local index is carried out respectively; finally, multiple real data sets are used to analyze the benchmark indices and extended indices. The results of the AUC and Precision evaluation metrics show that the path extension similarity proposed in this paper has higher accuracy and stronger robustness than the benchmark indices. •The utilization of reciprocity coefficient greatly improves the prediction accuracy of directed network.•The mathematical definition formula of each local similarity index is expressed in matrix form through matrix algebra.•The path extension of network node related links can improve the utilization of node information.•The proposed prediction algorithm can be applied to future wireless network.