Predicting drug-disease interactions by semi-supervised graph cut algorithm and three-layer data integration

• Published in: BMC medical genomics Vol. 10; no. Suppl 5; pp. 79 - 30
• Main Authors: Wu, Guangsheng, Liu, Juan, Wang, Caihua
• Format: Journal Article
• Language: English
• Published: London BioMed Central 28.12.2017; BioMed Central Ltd; BMC
• Subjects: Analysis; Biomedical and Life Sciences; Biomedicine; Drug interactions; Drug-disease interaction; Gene Expression; Graph cut; Guilt-by-association; Heterogeneous catalysis; Human Genetics; Integration strategy; Microarrays; Similarity; Drug-disease interaction; Integration strategy; Similarity; Graph cut; Guilt-by-association
• ISSN: 1755-8794; 1755-8794
• DOI: 10.1186/s12920-017-0311-0

Background Prediction of drug-disease interactions is promising for either drug repositioning or disease treatment fields. The discovery of novel drug-disease interactions, on one hand can help to find novel indictions for the approved drugs; on the other hand can provide new therapeutic approaches for the diseases. Recently, computational methods for finding drug-disease interactions have attracted lots of attention because of their far more higher efficiency and lower cost than the traditional wet experiment methods. However, they still face several challenges, such as the organization of the heterogeneous data, the performance of the model, and so on. Methods In this work, we present to hierarchically integrate the heterogeneous data into three layers. The drug-drug and disease-disease similarities are first calculated separately in each layer, and then the similarities from three layers are linearly fused into comprehensive drug similarities and disease similarities, which can then be used to measure the similarities between two drug-disease pairs. We construct a novel weighted drug-disease pair network, where a node is a drug-disease pair with known or unknown treatment relation, an edge represents the node-node relation which is weighted with the similarity score between two pairs. Now that similar drug-disease pairs are supposed to show similar treatment patterns, we can find the optimal graph cut of the network. The drug-disease pair with unknown relation can then be considered to have similar treatment relation with that within the same cut. Therefore, we develop a semi-supervised graph cut algorithm, SSGC, to find the optimal graph cut, based on which we can identify the potential drug-disease treatment interactions. Results By comparing with three representative network-based methods, SSGC achieves the highest performances, in terms of both AUC score and the identification rates of true drug-disease pairs. The experiments with different integration strategies also demonstrate that considering several sources of data can improve the performances of the predictors. Further case studies on four diseases, the top-ranked drug-disease associations have been confirmed by KEGG, CTD database and the literature, illustrating the usefulness of SSGC. Conclusions The proposed comprehensive similarity scores from multi-views and multiple layers and the graph-cut based algorithm can greatly improve the prediction performances of drug-disease associations.