Understanding the network formation pattern for better link prediction

Abstract

As a 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 parameters 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 11 widely used link prediction algorithms on 11 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 algorithm is 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.

arXiv comment21 pages, 3 figures, 18 tables, and 29 references

References in corpus (15)

• Emergence of scaling in random networks
• Link Prediction in Complex Networks: A Survey
• Evolution of the social network of scientific collaborations
• Clustering and preferential attachment in growing networks
• Predicting Missing Links via Local Information
• Vertex similarity in networks
• Effective and Efficient Similarity Index for Link Prediction of Complex Networks
• Predicting Dynamic Embedding Trajectory in Temporal Interaction Networks
• Motifs in Temporal Networks
• Progresses and Challenges in Link Prediction
• Common neighbours and the local-community-paradigm for link prediction in bipartite networks
• Link prediction via linear optimization
• A nonuniform popularity-similarity optimization (nPSO) model to efficiently generate realistic complex networks with communities
• Experimental analyses on 2-hop-based and 3-hop-based link prediction algorithms
• Network Refinement: A unified framework for enhancing signal or removing noise of networks