Multiple Order Local Information model for link prediction in complex networks

被引:10
|
作者
Yu, Jiating
Wu, Ling-Yun [1 ]
机构
[1] Chinese Acad Sci, Acad Math & Syst Sci, NCMIS, MADIS,IAM, Beijing 100190, Peoples R China
基金
中国国家自然科学基金;
关键词
Link prediction; Common neighbors; Network evolution; Network diffusion; Complex networks; Local information;
D O I
10.1016/j.physa.2022.127522
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Asa classical problem in the field of complex networks, link prediction has attracted much attention from researchers, which is of great significance to help us understand the evolution and dynamic development mechanisms of networks. Although various network type-specific algorithms have been proposed to tackle the link prediction problem, most of them suppose that the network structure is dominated by the Triadic Closure Principle. We still lack an adaptive and comprehensive understanding of network formation patterns for predicting potential links. In addition, it is valuable to investigate how network local information can be better utilized. To this end, we proposed a novel method named Link prediction using Multiple Order Local Information (MOLI) that exploits the local information from the neighbors of different distances, with parameter that can be a prior-driven based on prior knowledge, or data-driven by solving an optimization problem on observed networks. MOLI defined a local network diffusion process via random walks on the graph, resulting in better use of network information. We show that MOLI outperforms the other 12 widely used link prediction methods on 15 different types of simulated and real-world networks. We also conclude that there are different patterns of local information utilization for different networks, including social networks, communication networks, biological networks, etc. In particular, the classical common neighbor-based methods are not as adaptable to all social networks as it is perceived to be; instead, some of the social networks obey the Quadrilateral Closure Principle which preferentially connects paths of length three. (C) 2022 Elsevier B.V. All rights reserved.
引用
收藏
页数:15
相关论文
共 50 条
  • [21] Accurate and Fast Link Prediction in Complex Networks
    Zhang, Weiyu
    Wu, Bin
    Zhang, Weiyu
    2014 10TH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION (ICNC), 2014, : 653 - 657
  • [22] Link prediction based on sampling in complex networks
    Caiyan Dai
    Ling Chen
    Bin Li
    Applied Intelligence, 2017, 47 : 1 - 12
  • [23] Link Prediction on Complex Networks: An Experimental Survey
    Haixia Wu
    Chunyao Song
    Yao Ge
    Tingjian Ge
    Data Science and Engineering, 2022, 7 : 253 - 278
  • [24] Similarity index based on local paths for link prediction of complex networks
    Lue, Linyuan
    Jin, Ci-Hang
    Zhou, Tao
    PHYSICAL REVIEW E, 2009, 80 (04)
  • [25] Effective Model Integration Algorithm for Improving Link and Sign Prediction in Complex Networks
    Liu, Chuang
    Yu, Shimin
    Huang, Ying
    Zhang, Zi-Ke
    IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING, 2021, 8 (03): : 2613 - 2624
  • [26] Link Prediction in Weighted Networks: A Weighted Mutual Information Model
    Zhu, Boyao
    Xia, Yongxiang
    PLOS ONE, 2016, 11 (02):
  • [27] Link prediction using node information on local paths
    Aziz, Furqan
    Gul, Haji
    Muhammad, Ishtiaq
    Uddin, Irfan
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2020, 557 (557)
  • [28] Link prediction using node information on local paths
    Aziz, Furqan
    Gul, Haji
    Muhammad, Ishtiaq
    Uddin, Irfan
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2020, 557
  • [29] Fast approach for link prediction in complex networks based on graph decomposition
    Saifi, Abdelhamid
    Nouioua, Farid
    Akhrouf, Samir
    EVOLVING SYSTEMS, 2024, 15 (02) : 303 - 320
  • [30] Fast approach for link prediction in complex networks based on graph decomposition
    Abdelhamid Saifi
    Farid Nouioua
    Samir Akhrouf
    Evolving Systems, 2024, 15 : 303 - 320