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 条
  • [41] Link Prediction Based On Local Structure And Node Information Along Local Paths
    Li, Tongfeng
    Zhang, Ruisheng
    Niu, Bojuan
    Yao, Yabing
    Ma, Jun
    Jiang, Jing
    Zhao, Zhili
    COMPUTER JOURNAL, 2022, 67 (01) : 45 - 56
  • [42] Link prediction based on local information considering preferential attachment
    Zeng, Shan
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2016, 443 : 537 - 542
  • [43] Link prediction in complex dynamic networks using multiple interdependent time series
    Basu, Srinka
    Maulik, Ujjwal
    2018 INTERNATIONAL CONFERENCE ON COMPUTING, POWER AND COMMUNICATION TECHNOLOGIES (GUCON), 2018, : 1136 - 1141
  • [44] An extended self-representation model of complex networks for link prediction
    Xiu, Yuxuan
    Liu, Xinglu
    Cao, Kexin
    Chen, Bokui
    Chan, Wai Kin Victor
    INFORMATION SCIENCES, 2024, 662
  • [45] Local neighborhood-based approach of link prediction in networks
    Wang, Chunning
    Jing, Bingyi
    STATISTICS AND ITS INTERFACE, 2022, 15 (03) : 323 - 334
  • [46] Dynamics of Worm Propagation Model in Complex Networks Considering Benign Worm and Link Prediction Approach
    Asadi, Elham
    Hosseini, Soodeh
    ENGINEERING REPORTS, 2025, 7 (02)
  • [47] LinkPred: a high performance library for link prediction in complex networks
    Kerrache S.
    PeerJ Computer Science, 2021, 7 : 1 - 32
  • [48] LinkPred: a high performance library for link prediction in complex networks
    Kerrache, Said
    PEERJ COMPUTER SCIENCE, 2021,
  • [49] Link Prediction in Complex Hyper-Networks Leveraging HyperCentrality
    Nandini, Y. V.
    Jaya Lakshmi, T.
    Krishna Enduri, Murali
    Zairul Mazwan Jilani, Mohd
    IEEE ACCESS, 2025, 13 : 12239 - 12254
  • [50] Link Prediction in Complex Hyper-Networks Leveraging HyperCentrality
    Nandini, Y. V.
    Lakshmi, T. Jaya
    Enduri, Murali Krishna
    Jilani, Mohd Zairul Mazwan
    IEEE ACCESS, 2025, 13 : 12239 - 12254