Identification of drug-target interactions (DTIs) is an important step in drug discovery and drug repositioning. In recent years, graph-based methods have attracted great attention and show advantages on predicting potential DTIs. However, these methods face the problem that the known DTIs are very limited and expensive to obtain, which decreases the generalization ability of the methods. Self-supervised contrastive learning is independent of labeled DTIs, which can mitigate the impact of the problem. Therefore, we propose a framework SHGCL-DTI for predicting DTIs, which supplements the classical semi-supervised DTI prediction task with an auxiliary graph contrastive learning module. Specifically, we generate representations for the nodes through the neighbor view and meta-path view, and define positive and negative pairs to maximize the similarity between positive pairs from different views. Subsequently, SHGCL-DTI reconstructs the original heterogeneous network to predict the potential DTIs. The experiments on the public dataset show that SHGCL-DTI has significant improvement in different scenarios, compared with existing state-of-the-art methods. We also demonstrate that the contrastive learning module improves the prediction performance and generalization ability of SHGCL-DTI through ablation study. In addition, we have found several novel predicted DTIs supported by the biological literature. The data and source code are available at: https://github.com/TOJSSE-iData/SHGCL-DTI.
Instance matching is a key task in knowledge graph fusion, and it is critical to improving the efficiency of instance matching, given the increasing scale of knowledge graphs. Blocking algorithms selecting candidate instance pairs for comparison is one of the effective methods to achieve the goal. In this paper, we propose a novel blocking algorithm named MultiObJ, which constructs indexes for instances based on the Ordered Joint of Multiple Objects’ features to limit the number of candidate instance pairs. Based on MultiObJ, we further propose a distributed framework named Follow-the-Regular-Leader Instance Matching (FTRLIM), which matches instances between large-scale knowledge graphs with approximately linear time complexity. FTRLIM has participated in OAEI 2019 and achieved the best matching quality with significantly efficiency. In this research, we construct three data collections based on a real-world large-scale knowledge graph. Experiment results on the constructed data collections and two real-world datasets indicate that MultiObJ and FTRLIM outperform other state-of-the-art methods.