Computational prediction of Drug-Disease association based on Graph-regularized one bit Matrix completion
Abstract Motivation Investigation of existing drugs is an effective alternative to discovery of new drugs for treating diseases. This task of drug re-positioning can be assisted by various kinds of computational methods to predict the best indication for a drug given the open-source biological datasets. Owing to the fact that similar drugs tend to have common pathways and disease indications, the association matrix is assumed to be of low-rank structure. Hence, the problem of drug-disease association prediction can been modelled as a low-rank matrix-completion problem.Results In this work, we propose a novel matrix completion framework which makes use of the sideinformation associated with drugs/diseases for the prediction of drug-disease indications modelled as neighborhood graph: Graph regularized 1-bit matrix compeltion (GR1BMC). The algorithm is specially designed for binary data and uses parallel proximal algorithm to solve the aforesaid minimization problem taking into account all the constraints including the neighborhood graph incorporation and restricting predicted scores within the specified range. The results of the proposed algorithm have been validated on two standard drug-disease association databases (Fdataset and Cdataset) by evaluating the AUC across the 10-fold cross validation splits. The usage of the method is also evaluated through a case study where top 5 indications are predicted for novel drugs and diseases, which then are verified with the CTD database. The results of these experiments demonstrate the practical usage and superiority of the proposed approach over the benchmark methods.Contact <jats:email>aanchalmiiitd.ac.in</jats:email>.
| Medienart: |
|
|---|
Preprint| Erscheinungsjahr: |
2022 |
|---|---|
| Erschienen: |
2022 |
| Enthalten in: |
bioRxiv.org - (2022) vom: 28. Okt. Zur Gesamtaufnahme - year:2022 |
|---|
| Sprache: |
Englisch |
|---|
| Beteiligte Personen: |
Mongia, Aanchal [VerfasserIn] |
|---|
| Links: |
|---|
| Themen: |
|---|
| doi: |
10.1101/2020.04.02.020891 |
|---|
| funding: |
|
|---|---|
| Förderinstitution / Projekttitel: |
|
| PPN (Katalog-ID): |
XBI000843253 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | XBI000843253 | ||
| 003 | DE-627 | ||
| 005 | 20230429095131.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 200406s2022 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1101/2020.04.02.020891 |2 doi | |
| 035 | |a (DE-627)XBI000843253 | ||
| 035 | |a (biorXiv)10.1101/2020.04.02.020891 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 100 | 1 | |a Mongia, Aanchal |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Computational prediction of Drug-Disease association based on Graph-regularized one bit Matrix completion |
| 264 | 1 | |c 2022 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a Computermedien |b c |2 rdamedia | ||
| 338 | |a Online-Ressource |b cr |2 rdacarrier | ||
| 520 | |a Abstract Motivation Investigation of existing drugs is an effective alternative to discovery of new drugs for treating diseases. This task of drug re-positioning can be assisted by various kinds of computational methods to predict the best indication for a drug given the open-source biological datasets. Owing to the fact that similar drugs tend to have common pathways and disease indications, the association matrix is assumed to be of low-rank structure. Hence, the problem of drug-disease association prediction can been modelled as a low-rank matrix-completion problem.Results In this work, we propose a novel matrix completion framework which makes use of the sideinformation associated with drugs/diseases for the prediction of drug-disease indications modelled as neighborhood graph: Graph regularized 1-bit matrix compeltion (GR1BMC). The algorithm is specially designed for binary data and uses parallel proximal algorithm to solve the aforesaid minimization problem taking into account all the constraints including the neighborhood graph incorporation and restricting predicted scores within the specified range. The results of the proposed algorithm have been validated on two standard drug-disease association databases (Fdataset and Cdataset) by evaluating the AUC across the 10-fold cross validation splits. The usage of the method is also evaluated through a case study where top 5 indications are predicted for novel drugs and diseases, which then are verified with the CTD database. The results of these experiments demonstrate the practical usage and superiority of the proposed approach over the benchmark methods.Contact <jats:email>aanchalmiiitd.ac.in</jats:email> | ||
| 650 | 4 | |a Biology |7 (dpeaa)DE-84 | |
| 650 | 4 | |a 570 |7 (dpeaa)DE-84 | |
| 700 | 1 | |a Chouzenoux, Emilie |e verfasserin |4 aut | |
| 700 | 1 | |a Majumdar, Angshul |e verfasserin |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t bioRxiv.org |g (2022) vom: 28. Okt. |
| 773 | 1 | 8 | |g year:2022 |g day:28 |g month:10 |
| 856 | 4 | 0 | |u https://doi.org/10.1109/TCBB.2022.3189879 |z lizenzpflichtig |3 Volltext |
| 856 | 4 | 0 | |u http://dx.doi.org/10.1101/2020.04.02.020891 |z kostenfrei |3 Volltext |
| 912 | |a GBV_XBI | ||
| 912 | |a SSG-OLC-PHA | ||
| 951 | |a AR | ||
| 952 | |j 2022 |b 28 |c 10 | ||