MPGraph: multi‐view penalised graph clustering for predicting drug–target interactions

Identifying drug–target interactions has been a key step for drug repositioning, drug discovery and drug design. Since it is expensive to determine the interactions experimentally, computational methods are needed for predicting interactions. In this work, the authors first propose a single‐view penalised graph (SPGraph) clustering approach to integrate drug structure and protein sequence data in a structural view. The SPGraph model does clustering on drugs and targets simultaneously such that the known drug–target interactions are best preserved in the clustering results. They then apply the SPGraph to a chemical view with drug response data and gene expression data in NCI‐60 cell lines. They further generalise the SPGraph to a multi‐view penalised graph (MPGraph) version, which can integrate the structural view and chemical view of the data. In the authors'' experiments, they compare their approach with some comparison partners, and the results show that the SPGraph could improve the prediction accuracy in a small scale, and the MPGraph can achieve around 10% improvements for the prediction accuracy. They finally give some new targets for 22 Food and Drug Administration approved drugs for drug repositioning, and some can be supported by other references.Inspec keywords: graphs, drug delivery systems, drugs, proteins, molecular biophysics, molecular configurations, optimisation, eigenvalues and eigenfunctions, Laplace equations, cancer, cellular biophysics, gene therapy, medical computingOther keywords: MPGraph, multiview penalised graph clustering, drug‐target interactions, drug repositioning, drug discovery, drug design, computational methods, single‐view penalized graph clustering approach, drug structure, protein sequence data, SPGraph model, optimisation problem, spectral clustering, eigenvalue decomposition, Laplacian model, gene expression data, NCI‐60 cell lines