Proceedings Article10.1109/bibm58861.2023.10385255
An Effective Model for Drug-Drug Interactions Prediction in Cold-start Scenario via Counterfactual Data Augmentation
Xueling Yuan,Weizhong Zhao,Xiaowei Xu,Xinhui Tu,Xingpeng Jiang,Tingting He +5 more
- 05 Dec 2023
pp 753-758
TL;DR: A novel data augmentation approach for the prediction of DDIs in cold-start scenarios that leverages counterfactual inference to generate meaningful pseudo samples for drugs with limited prior information and enhances the understanding of drug characteristics through a meta-path-based fusion mechanism.
read more
Abstract: Drug-drug interaction (DDI) pertains to the occurrence where the concomitant use of two or more drugs may lead to interactions in terms of their pharmacokinetic or pharmacodynamic behavior, resulting in unexpected effects. Accurately predicting DDIs holds significant importance in ensuring drug safety. Despite the numerous approaches proposed for DDI prediction, a majority of these methods often overlook the challenge presented by cold-start scenario, consequently limiting their applicability. This paper presents a novel data augmentation approach for the prediction of DDIs in cold-start scenarios. This method leverages counterfactual inference to generate meaningful pseudo samples for drugs with limited prior information. To achieve this, a HIN relevant to DDIs is initially established by amalgamating various associations between drugs and proteins. Subsequently, the identification of drug communities within this HIN is regarded as a form of counterfactual inference treatment, facilitating the generation of counterfactual links for cold-start drugs and thereby augmenting the training dataset. Lastly, we enhance our understanding of drug characteristics through a meta-path-based fusion mechanism, ultimately improving the accuracy of DDIs prediction in cold-start scenarios. We substantiate the effectiveness of our proposed method through an extensive series of experiments.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
References
•Proceedings Article
Adam: A Method for Stochastic Optimization
Diederik P. Kingma,Jimmy Ba +1 more
- 01 Jan 2015
TL;DR: This work introduces Adam, an algorithm for first-order gradient-based optimization of stochastic objective functions, based on adaptive estimates of lower-order moments, and provides a regret bound on the convergence rate that is comparable to the best known results under the online convex optimization framework.
138.5K
•Posted Content
Adam: A Method for Stochastic Optimization
Diederik P. Kingma,Jimmy Ba +1 more
TL;DR: In this article, the adaptive estimates of lower-order moments are used for first-order gradient-based optimization of stochastic objective functions, based on adaptive estimate of lowerorder moments.
82.5K
A tutorial on spectral clustering
TL;DR: In this article, the authors present the most common spectral clustering algorithms, and derive those algorithms from scratch by several different approaches, and discuss the advantages and disadvantages of these algorithms.
•Posted Content
A Tutorial on Spectral Clustering
TL;DR: This tutorial describes different graph Laplacians and their basic properties, present the most common spectral clustering algorithms, and derive those algorithms from scratch by several different approaches.
6.3K
BIRCH: an efficient data clustering method for very large databases
Tian Zhang,Raghu Ramakrishnan,Miron Livny +2 more
- 01 Jun 1996
TL;DR: Balanced Iterative Reducing and Clustering using Hierarchies (BIRCH) as discussed by the authors is a data clustering method that is especially suitable for very large databases.