Link prediction of heterogeneous complex networks based on an improved embedding learning algorithm

Abstract

Link prediction in heterogeneous networks is an active research topic in the field of complex network science. Recognizing the limitations of existing methods, which often overlook the varying contributions of different local structures within these networks, this study introduces a novel algorithm named SW-Metapath2vec. This algorithm enhances the embedding learning process by assigning weights to meta-path traces generated through random walks and translates the potential connections between nodes into the cosine similarity of embedded vectors. The study was conducted using multiple real-world and synthetic datasets to validate the proposed algorithm’s performance. The results indicate that SW-Metapath2vec significantly outperforms benchmark algorithms. Notably, the algorithm maintains high predictive performance even when a substantial proportion of network nodes are removed, demonstrating its resilience and potential for practical application in analyzing large-scale heterogeneous networks. These findings contribute to the advancement of link prediction techniques and offer valuable insights and tools for related research areas.