A Survey on Hyperlink Prediction
arXiv:2207.02911 · doi:10.1109/TNNLS.2023.3286280
Abstract
As a natural extension of link prediction on graphs, hyperlink prediction aims for the inference of missing hyperlinks in hypergraphs, where a hyperlink can connect more than two nodes. Hyperlink prediction has applications in a wide range of systems, from chemical reaction networks, social communication networks, to protein-protein interaction networks. In this paper, we provide a systematic and comprehensive survey on hyperlink prediction. We propose a new taxonomy to classify existing hyperlink prediction methods into four categories: similarity-based, probability-based, matrix optimization-based, and deep learning-based methods. To compare the performance of methods from different categories, we perform a benchmark study on various hypergraph applications using representative methods from each category. Notably, deep learning-based methods prevail over other methods in hyperlink prediction.
15 pages, 4 figures, 6 tables
References in corpus (1)
Cited by in corpus (4)
- Hyperlink prediction via local random walks and Jensen-Shannon divergence
- Uncovering multi-technology convergence patterns with hypergraphs: Evolution and prediction using patent data
- A Survey on GNN-based Link Prediction: Techniques, Applications, and Challenges
- Domain matters: Towards domain-informed evaluation for link prediction