A Unified Link Prediction Framework for Predicting Arbitrary Relations in Heterogeneous Academic Networks

Abstract

Most of the existing link prediction methods for heterogeneous academic networks can only predict one or two specific relation types rather than arbitrary relation types. Although several recently proposed methods have involved multi-relational prediction problems, they do not comprehensively consider the rich semantic or temporal information of heterogeneous academic networks. Considering that researchers may have diverse requirements for different types of academic resources, in this study, we propose a new unified link prediction framework (UniLPF) for arbitrary types of academic relations. First, a weighted and directed heterogeneous academic network containing rich academic objects and relations is constructed. Then, an automatic meta-path searching method is proposed to extract the meta-paths for arbitrary prediction tasks. Two meta-path based object similarity measures combining temporal information and content relevance are also proposed to measure the features of the meta-paths. Finally, a pervasive link prediction model is built, which can be embodied based on an arbitrarily specified prediction task and the corresponding meta-path features. Extensive experiments for predicting various relation types with practical significance are conducted on a large-scale Microsoft Academic dataset. The experimental results demonstrate that our proposed UniLPF framework can predict arbitrary specified academic relations, and outperforms the comparison methods in terms of F-measure, accuracy, AUC and ROC. In addition, the time scalability experiments prove that UniLPF also achieves good performance for predicting the academic relations over time.

Keywords

• Heterogeneous academic networks
• link prediction
• meta-path
• random walk
• similarity measure