2019
DOI: 10.1371/journal.pone.0219796
|View full text |Cite
|
Sign up to set email alerts
|

Detecting drug-drug interactions using artificial neural networks and classic graph similarity measures

Abstract: Drug-drug interactions are preventable causes of medical injuries and often result in doctor and emergency room visits. Computational techniques can be used to predict potential drug-drug interactions. We approach the drug-drug interaction prediction problem as a link prediction problem and present two novel methods for drug-drug interaction prediction based on artificial neural networks and factor propagation over graph nodes: adjacency matrix factorization (AMF) and adjacency matrix factorization with propag… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
56
0
1

Year Published

2019
2019
2024
2024

Publication Types

Select...
4
1
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 73 publications
(58 citation statements)
references
References 26 publications
1
56
0
1
Order By: Relevance
“…Authors in [18] present KMR, a procedure for similarity computation based on chemical structure and side effects. On the other hand, Shtar et al [19] employ adjacency matrix factorization to embed the drugs based on their interactivity as derived by DrugBank. Finally, authors in [6] also construct a biomedical Knowledge Graph from structured data (i.e.…”
Section: Related Workmentioning
confidence: 99%
“…Authors in [18] present KMR, a procedure for similarity computation based on chemical structure and side effects. On the other hand, Shtar et al [19] employ adjacency matrix factorization to embed the drugs based on their interactivity as derived by DrugBank. Finally, authors in [6] also construct a biomedical Knowledge Graph from structured data (i.e.…”
Section: Related Workmentioning
confidence: 99%
“…Since DDIs form a complex network in which nodes refer to drugs and links refer to potential interactions, we approach the DDIs prediction task as a link prediction problem similar to Shtar et al [38]. Given a directed DDI KG as G = (V , E) in which each edge e = (u, v) ∈ E represents an interaction between drugs u and v. Let N denotes the number of drugs, we can define the DDIs matrix Y ∈ {0, 1} N x N as follows:…”
Section: Problem Formulationmentioning
confidence: 99%
“…In eq. (1), a value of 1 for y u,v indicates an existing interaction between drugs u and v. However, a value of 0 does not mean that an interaction does not exist in the KG, but it could be that the interaction has not yet been discovered [38]. Next, we proceed to DDIs extraction to be followed by KG construction.…”
Section: Problem Formulationmentioning
confidence: 99%
See 1 more Smart Citation
“…Various machine learning methods have been proved as a promising method to provide a preliminary screening of DDIs for further experimental validation with the advantages of both high efficiency and low costs. Generally, the machine learning-based methods [4][5][6][7][8][9][10][11][12][13][14][15] use the approved DDIs training the predictive models to infer the potential DDIs among massive unlabeled drug pairs by extracting the drug features from diverse drug property source, such as chemical structure [4,[6][7][8][9], targets [4][5][6][7], anatomical taxonomy [5,8,10] and phenotypic observation [5,7,9,10], or extracting the drug similarity features [5,6,9,10,[16][17][18], or training the deep learning models to extract better features from raw features [19][20][21]. However, most of these existing methods focus on whether a drug interacts with another or not.…”
Section: Introductionmentioning
confidence: 99%