Communicative Subgraph Representation Learning for Multi-Relational Inductive Drug-Gene Interaction Prediction
Illuminating the interconnections between drugs and genes is an important topic in drug development and precision medicine. Currently, computational predictions of drug-gene interactions mainly focus on the binding interactions without considering other relation types like agonist, antagonist, etc. In addition, existing methods either heavily rely on high-quality domain features or are intrinsically transductive, which limits the capacity of models to generalize to drugs/genes that lack external information or are unseen during the training process. To address these problems, we propose a novel Communicative Subgraph representation learning for Multi-relational Inductive drug-Gene interactions prediction (CoSMIG), where the predictions of drug-gene relations are made through subgraph patterns, and thus are naturally inductive for unseen drugs/genes without retraining or utilizing external domain features. Moreover, the model strengthened the relations on the drug-gene graph through a communicative message passing mechanism. To evaluate our method, we compiled two new benchmark datasets from DrugBank and DGIdb. The comprehensive experiments on the two datasets showed that our method outperformed state-of-the-art baselines in the transductive scenarios and achieved superior performance in the inductive ones. Further experimental analysis including LINCS experimental validation and literature verification also demonstrated the value of our model.
Code (1)
Tasks
Gene Interaction PredictionRepresentation LearningSimilar Papers 제목 키워드 기반
Inductive Link Prediction on N-ary Relational Facts via Semantic Hypergraph Reasoning
N-ary relational facts represent semantic correlations among more than two entities. While recent studies have developed link prediction (LP) methods to infer missing relations for knowledge graphs (KGs) containing n-ary…
Inductive Link PredictionKnowledge GraphsLink PredictionCommunicative Message Passing for Inductive Relation Reasoning
Relation prediction for knowledge graphs aims at predicting missing relationships between entities. Despite the importance of inductive relation prediction, most previous works are limited to a transductive setting and c…
Inductive BiasInductive Relation PredictionKnowledge GraphsRelation+2Learning First-Order Rules with Relational Path Contrast for Inductive Relation Reasoning
Relation reasoning in knowledge graphs (KGs) aims at predicting missing relations in incomplete triples, whereas the dominant paradigm is learning the embeddings of relations and entities, which is limited to a transduct…
Knowledge GraphsRelationSubgraph Neighboring Relations Infomax for Inductive Link Prediction on Knowledge Graphs
Inductive link prediction for knowledge graph aims at predicting missing links between unseen entities, those not shown in training stage. Most previous works learn entity-specific embeddings of entities, which cannot ha…
Inductive Link PredictionKnowledge GraphsLink PredictionRelational Message Passing for Fully Inductive Knowledge Graph Completion
In knowledge graph completion (KGC), predicting triples involving emerging entities and/or relations, which are unseen when the KG embeddings are learned, has become a critical challenge. Subgraph reasoning with message …
Inductive knowledge graph completionKnowledge Graph CompletionRelation