A Relation Prediction Method Based on PU Learning

This paper studies relation prediction in heterogeneous information networks under PU learning context. One of the challenges of this problem is the imbalance of data number between the positive set P (the set of node pairs with the target relation) and the unlabeled set U (the set of node pairs without the target relation). We propose a K-means and voting mechanism based technique SemiPUchis to extract the reliable negative set RN from U under a new relation prediction framework PURP. The experimental results show that PURP achieves better performance than comparative methods in DBLP co-authorship network data.