Hyperlink prediction via local random walks and Jensen-Shannon divergence

Abstract

Many real-world systems involving higher-order interactions can be modeled by hypergraphs, where vertices represent the systemic units and hyperedges describe the interactions among them. In this paper, we focus on the problem of hyperlink prediction which aims at inferring missing hyperlinks based on observed hyperlinks. We propose three similarity indices for hyperlink prediction based on local random walks and Jensen-Shannon divergence. Numerical experiments show that the proposed indices outperform the state-of-the-art methods on a broad range of datasets.

arXiv commentIoP Latex, 15 pages, 1 figures

References in corpus (8)

• Link Prediction in Complex Networks: A Survey
• Clustering and preferential attachment in growing networks
• Networks beyond pairwise interactions: structure and dynamics
• Contact patterns in a high school: a comparison between data collected using wearable sensors, contact diaries and friendship surveys
• Link Prediction Based on Local Random Walk
• Random walks on hypergraphs
• Assessing the relevance of node features for network structure
• A Survey on Hyperlink Prediction