 Research article
 Open Access
 Published:
The assessment of efficient representation of drug features using deep learning for drug repositioning
BMC Bioinformatics volume 20, Article number: 577 (2019)
Abstract
Background
De novo drug discovery is a timeconsuming and expensive process. Nowadays, drug repositioning is utilized as a common strategy to discover a new drug indication for existing drugs. This strategy is mostly used in cases with a limited number of candidate pairs of drugs and diseases. In other words, they are not scalable to a large number of drugs and diseases. Most of the insilico methods mainly focus on linear approaches while nonlinear models are still scarce for new indication predictions. Therefore, applying nonlinear computational approaches can offer an opportunity to predict possible drug repositioning candidates.
Results
In this study, we present a nonlinear method for drug repositioning. We extract four drug features and two disease features to find the semantic relations between drugs and diseases. We utilize deep learning to extract an efficient representation for each feature. These representations reduce the dimension and heterogeneity of biological data. Then, we assess the performance of different combinations of drug features to introduce a pipeline for drug repositioning. In the available database, there are different numbers of known drugdisease associations corresponding to each combination of drug features. Our assessment shows that as the numbers of drug features increase, the numbers of available drugs decrease. Thus, the proposed method with large numbers of drug features is as accurate as small numbers.
Conclusion
Our pipeline predicts new indications for existing drugs systematically, in a more costeffective way and shorter timeline. We assess the pipeline to discover the potential drugdisease associations based on crossvalidation experiments and some clinical trial studies.
Background
De novo drug discovery procedure is timeconsuming and expensive. More than 90% of drugs fail during the development stages due to inefficacy or high toxicity [1, 2]. To overcome these challenges, researchers are interested in finding a method to discover new drugdisease associations based on known drugs. The process of identifying new indications for existing drugs is known as drug repositioning (repurposing) [3,4,5]. In the last decade, several efforts have been made to find an efficient computational solution for drug repositioning [2, 6].
In biological experimental drug repositioning methods, it is hard to find new drug indications based on a large number of existing drugs due to low knowledge of biological mechanisms [7]. These methods are utilizable in most cases with the limited number of existing drugs and diseases pairs. In other words, they are not scalable to a large number of drugs and diseases. While computational approaches use the highlevel integration of available drug and disease data to discover new drugs for human diseases [8]. By optimizing these strategies into efficient drug repositioning pipeline, repurposed drugs can be found systematically, in a much more costeffective way and shorter timeline.
According to [2, 7, 9] there are five common categories for computational drug repositioning approaches named signaturebased, networkbased, text mining, semantic and machine learning algorithms.
One signaturebased approach called ‘signature reversion’ [10, 11] looks for inverse drugdisease relationships by comparing diseasegene expression profiles and druggene expression profiles using CMAP [12], LINCS [13], and GEO [14] datasets. Another approach is defined based on ‘guiltbyassociation’ principle which is applied to identify new targets for already approved drugs using DvD [15], DAVID [16] and GSEA repositories [10, 17, 18].
Zhang et al. [19] proposed a networkbased approach using a unified framework for integrating multiple aspects of drug similarity and disease similarity. In this regards, they integrated genome (e.g., drug target protein, disease gene), phenome (e.g., disease phenotype, drug side effect), and drug chemical structure to extract the drug similarity network and the disease similarity network. Finally, a drugdisease network was constructed to explore novel drug indications. Yang et al. [20] utilized a causal inferenceprobabilistic matrix factorization approach to infer drugdisease associations. They integrated systematic multilevel relations to construct causal networks connecting drug–target–pathway–gene–disease. Lee et al. [21] constructed a directed network using protein interaction and gene regulation data obtained from various public databases providing diverse biological pathways for obtaining associations between drug and disease genes. They have employed interaction on the binary proteinprotein interaction network with consideration to the characteristics of the interactions.
Extracting novel and valuable biological entity relations from the literature is challenging. Text mining techniques are widely used to solve it and identify connections between biological concepts or biological entities [22].
Semanticbased approach has been applied to drug repositioning in three main steps as follows: extracting and integrating public resources, constructing a semantic network by integrating multisource data and mining semantic links [7]. Mullen et al. [23] used a Bayesian statistics approach to rank drugdisease relationships according to prior knowledge. Then, they integrated ranked relationships with other biological entity associations to construct a semantical drug discovery network. To infer drugdisease relationships, the author applied an algorithm for detecting semantic subgraphs. Furthermore, Zhu et al. [24] proposed an automatic reasoning approach for heterogeneous semantics networks. Biological entities (such as drugs) are converted to labels in a semantic network. Then, diseasedrug relationships are obtained from automatic reasoning techniques.
Predicting novel associations between drugs and diseases using the assorted data resources manually may not be efficient. Therefore, several machine learning methods have been proposed to solve this problem by extracting various features. Napolitano et al. [25] used drugrelated features including drug chemical structure, drug molecular targets, and druginduced gene expression signatures. These features were used to compute drug dissimilarity matrices merged into a single dissimilarity matrix as a kernel for support vector machine classification. Wang et al. [26] introduced an integrated model named ‘PreDR’ that trained an SVM model by incorporating drug chemical structure, side effect, and molecular activity.
In the first largescale prediction of drug indications, Gottlieb et al. [5] utilized various diseaserelated and drugrelated features. They constructed diseasedisease similarity matrices by computing diseasedisease similarity measures based on diseaserelated features called genetic and phenotypic signatures [27]. Furthermore, they studied many drugrelated features like chemical structure, side effects, drug targets (sequence based), proteinprotein interaction, and gene ontology [28]. Then, drugdrug similarity matrices were computed by the drugdrug similarity measures for each feature. Afterward, they trained a logistic regression classifier using known drugdisease associations. Finally, this classifier was used for new drugdisease association prediction [29]. Furthermore, Zhang et al. [30] proposed a similarity constrained matrix factorization method based on the biological context of the drugdisease association prediction (SCMFDD). In order to uncover latent features for drugs and diseases, SCMFDD projects the drugdisease associations into two lowrank spaces. Moreover, drug featurebased similarity and disease semantic similarity were introduced as constraints for drugs and diseases in the lowrank spaces. Xuan et al. [31] introduced a nonnegative matrix factorization model called DisDrugPred for integrating drug similarity and disease similarity to predict drug–disease associations.
Most of the insilico methods such as SCMFDD [30] and PREDICT [5] mainly focus on linear approaches while nonlinear approaches are still scarce for new indication predictions [32]. Therefore, applying nonlinear computational approaches can offer an opportunity to predict the possible drug repositioning candidates. For example, Donner et al. [33] trained a large data set of cellular perturbations using deep embedding of gene expression profiles. In addition, Zhao et al. [4] applied various stateoftheart machine learning approaches for prediction, including deep neural networks, support vector machines, elastic net, random forest and gradient boosted machines for schizophrenia, depression and anxiety disorders.
Furthermore, the amount of biomedical data in freely available repositories is swiftly increasing. The nature of this data is heterogeneous, highdimensional and noisy [34]. Consequently, designing an effective nonlinear method like neural network for analyzing this data becomes more and more difficult [35, 36]. As a result, there is an urgent need for a more efficient representation of this data for integrative analysis. According to the key role of data representation, there is a large volume of studies describing the role of efficient representations for biological data [37]. We use some of these efficient representations derived by nonlinear methods in order to reduce the dimension and heterogeneity of our biological features for the downstream analysis.
In this study, we present a pipeline to assess efficient representations of drug and disease features for drug indication prediction. In this regards, we introduce two similarity matrices to show the similarity between drugdrug and diseasedisease pairs. Afterward, we train a classifier based on the similarity matrices to score each drugdisease pair. To construct the similarity matrices for the drugdrug and diseasedisease pairs, we extract some biological features including chemical structures, protein sequences of drug target, drugrelated enzyme sequences, and gene expression profiles for drugs, and also genotype and phenotype for diseases. To find an appropriate and continuous representation for chemical structures and sequences of proteins and enzymes, we utilize deep neural networks designed by GómezBombarelli et al. [38] and Asgari et al. [39], respectively. Also, we design an autoencoder to reduce the dimensionality of the gene expression profiles for better representation. We use principal component analysis (PCA) to reduce the dimensions of disease features (phenotype and genotype) represented by onehotencoder.
This paper demonstrates that the appropriate representation derived by deep learning leads to reasonable performance in drug repurposing. To assess the efficiency of feature representation, we employ and compare each subset of drug features (SDF) for drug repositioning. To make the drugdrug similarity matrix for each SDF, we extract a list of drugs from database where all features in the SDF are available. In other words, a small size of SDF leads to the selection of a large number of drugs and vice versa. These matrices are named drugdrug similarity intersection (DDSI) matrices. The results show that each SDF can find semantic relations between drugs and disease. Therefore, the proposed method is dependent on drug features representation and the number of drugs. Also, we construct the diseasedisease similarity (DiDiS) matrix based on phenotype and genotype. Finally, drugdisease association (DDA) matrices are constructed based on DDSI, DiDiS matrices and known drugdisease associations set which are already clinically approved by regulatory agencies such as the US Food and Drug Administration.
A crossvalidation scheme is used to find the best subset of drug features for drug repositioning. Our method achieves an area under the ROC curve 0.944. In addition, we assess each subset of drug features to find out: which drugs are effective for a specific disease and which diseases are treatable by a particular drug. Meanwhile, we compare our pipeline to Yang & Agarwa1 [40] and Lee [21] models on some specific diseases. In the following, we apply fivefold crossvalidation to compare our method to PREDICT [5], SCMFDD [30] and DisDrugPred [31]. Finally, we suggest some new drug indications. We believe that our study is a step toward understanding the effect of drug feature representation on drug repositioning and inferring how each subset of drug features influences on drug indication for a specific disease.
Methods
In this section, we follow the five steps (see Fig. 1) to find new indications for existing drugs (drug repositioning):
 1.
Representing four drug features using deep neural network.
 2.
Transforming two disease features represented by onehotencoder using PCA.
 3.
Using drug features to construct the drugdrug similarity matrices.
 4.
Using disease features to construct the diseasedisease similarity matrices.
 5.
Using drugdrug similarity and diseasedisease similarity to construct drugdisease association matrices.
Representing four drug features using deep neural network
In this subsection, we extract four drug features, chemical structures, protein sequences of drug targets, drugrelated enzyme sequences and gene expression profiles. Also, the appropriate representation of features, derived by deep neural networks, is introduced.
Chemical structures
Numerous studies have attempted to explain the importance of chemical structures [8]. For instance, SMILES simplifies the chemical structure and encodes molecular graphs compactly as a humanreadable string and describes molecules with an alphabet of characters as a formal grammar [41]. We download the SMILES strings from the DrugBank [42] and PubChem [43] database during the 2017–2018 academic year.
We use the variational autoencoder (VAE) [38] to convert the discrete representation of molecules (SMILES string) into a continuous 192dimensional vector. The SMILES string of drug i is preprocessed by the following steps to make appropriate inputs for VAE model:
A subset of 35 different characters is used for SMILESbased text encoding.
The strings are encoded up to a maximum length of 120 characters. Some spaces are added to shorter strings in order for all strings to be the same length.
Finally, the preprocessed SMILES string of drug i is given as an input to VAE model and vector \( {\overrightarrow{s}}_i \) is generated as an appropriate representation named SMILES vector. The “Keras” [44] and “Theano” packages [45] are utilized to apply this neural net.
Protein sequences of drug target
Each drug addresses one or multiple drug targets, which is a molecule associated with a particular disease process, to produce a desired therapeutic effect [46]. Drug targets are mostly proteins with active sites which can be ducked to the drugs. Each drug has one or multiple target proteins, and each protein can be the potential target of multiple drugs.
We retrieve drug target protein sequences from DrugBank during the 2017–2018 academic year [42]. We download the drug target section that includes proteins and genes. In this database, there is a list of drugs for each protein. Thus, we list the sequences of the target proteins for each drug.
We apply a deep neural network model named ProtVec [39] to convert the protein sequence into three continuous 100dimensional vectors. In other words, each protein sequence is represented as three sequences of 3gram. In ngram modelling of protein informatics, usually, an overlapping window of 3 to 6 residues is used. ProtVec [39], instead of taking overlapping windows, generates three vectors of shifted nonoverlapping words. Each 3gram is presented as a vector of size 100.
For each drug i, we perform the following steps to generate a set of 300dimensional vectors called ℙ_{i} to represent the sequences of target proteins:
The sequences of target proteins are listed as a set named Φ_{i} where Φ_{i} shows the number of targeted proteins by the drug i.
Each protein sequence σ ∈ Φ_{i} is given as an input to ProtVec. Three 100dimensional vectors named \( \overrightarrow{{v_1}^{\sigma }} \), \( \overrightarrow{{v_2}^{\sigma }} \) and \( \overrightarrow{{v_3}^{\sigma }} \) are generated as outputs.
For protein sequence σ, the concatenation of these 3 vectors is computed as \( \overrightarrow{\ {v}^{\sigma }}=\overrightarrow{{v_1}^{\sigma }}.\overrightarrow{{v_2}^{\sigma }}.\overrightarrow{{v_3}^{\sigma }} \).
Drug i is represented by the associated proteins of set Φ_{i} as \( \kern0.50em {\mathbb{P}}_i=\left\{\overrightarrow{v^{\sigma }}\sigma \in {\Phi}_i\right\} \).
Drugrelated enzyme sequences
Drugrelated enzyme sequences include all the enzymes involved in the activation and metabolism of a drug. We extract these sequence from DrugBank during the 2017–2018 academic year [42]. For each drug i, we execute the same process explained in section "Protein sequences of drug target" for enzyme sequences to generate a continuous 300dimensional vectors based on drugrelated enzymes called \( {\mathbbm{E}}_i \).
Gene expression profiles
We obtain raw data of gene expression profiles (GEPs) of CMAP dataset [12], and normalize them using R/Bioconductor “affy” package. These samples contain GEPs of five cell lines, either untreated or treated with any of 1309 different drugs. Differential gene expression profile (dGEP) of each cell line in presence vs. absence of a drug is computed by subtracting log2scaled GEPs after merging biological replicated samples via mean function. A subset of 729 drugs are annotated and approved in Drug Bank [42] and PubChem [43] databases.
We use a specific architecture of stacked autoencoders in a number of previous researches [47, 48]. It was shown, this architecture can retrieve important biological features of the data, such as gene coexpression patterns, pathways and biological processes [47], and exploit them to reduce the dimensionality of GEPs into a footprint sized vector called cell identity code (CIC) that contains important features of the data [48]. Importantly, CICs are resistant to noise and missing data [48] and can prevent overfitting by reducing the number of parameters of a deep neural network, when they are used as the input rather than the original GEPs.
For these reasons, we design a stacked autoencoder of five layers, after observing that increasing the number of layers did not impact on decreasing the loss function. For each layer, different options for the number of neurons and the activation functions are listed, as potential values for hyperparameters. Then we use a Bayesian approach for hyperparameter optimization using “hyperopt” package [49]. Different options for activation function are rectified linear unit (ReLU), Linear, SoftPlus, and ELU. The optimal value for batch size is also selected through hyperparameter optimization. Different options for each hyperparameter are specified in Fig. 2. The learning rate is 0.001. We use mean square error (MSE) as the regression lossfunction. “nadam” algorithm is used for both hyperparameter optimization and final training.
We partition the data into training (60%), validation (15%) and test (25%) datasets. The stacked autoencoder is trained and the appropriate weights and bias values are found. The validation dataset is used for hyperparameter optimization. The test dataset is utilized for final evaluation of the model.
We perform 100 iterations of hyperparameter optimization. The final hyperparameters that were selected by the optimization process are highlighted in Fig. 2. After performing 300 epochs iteration, the optimal candidate network has the meansquared error of 0.076.
Subsequently, the output of the bottleneck layer for available differential expression profiles has been extracted with the meansquared error of about 0.0047 as loss and mean absolute error of around 0.0495. The output of this autoencoder is a 20dimensional vector representing dGEP (\( \overrightarrow{g_i} \)).
Transforming two disease features represented by onehotencoder using PCA
In order to find diseasedisease similarity, we employ two sets of measures, namely the phenotypes (characteristics of a disease) and genotypes (genes involved in a disease). We download 10,881 human diseases with 8662 phenotypes and 7217 human diseases with 10,764 genotypes from Monarch [50]. In their intersection, there are 5955 diseases with both phenotypes and genotypes. For disease i, two onehotencoders, namely 8662dimensional and 10,764dimensional vectors, are constructed for phenotype and genotype, respectively.
For disease i, a phenotype onehotencoder is a zero vector with length 10,881. If a phenotype belongs to the disease, then the corresponding component of the vector is substituted 1. Also, we make genotype onehotencoder similar to phenotype onehotencoder.
These two onehotencoders are too sparse, specifically the one regarding genotype. To overcome this issue, we generate two vectors called \( \overrightarrow{{\mathrm{a}}_{\mathrm{i}}} \) and \( \overrightarrow{{\mathrm{d}}_{\mathrm{i}}} \) for phenotype and genotype using PCA, respectively. By test and trial, we find out appropriate numbers of components for PCA that identify the length of vectors \( \overrightarrow{{\mathrm{a}}_{\mathrm{i}}} \) and \( \overrightarrow{{\mathrm{d}}_{\mathrm{i}}} \) with 30 and 20, respectively.
Using drug features to construct the drugdrug similarity matrices
In this subsection, we generate a similarity matrix for each drug feature. We assume that there are n drugs. For each drug i, there are two vectors called \( \overrightarrow{{\mathrm{s}}_{\mathrm{i}}\ } \), \( \overrightarrow{{\mathrm{g}}_{\mathrm{i}}} \) and two sets named ℙ_{i}, \( {\mathbbm{E}}_{\mathrm{i}} \) to show the representation of chemical structures (s), gene expression profiles (g), protein sequences of drug target (p) and drugrelated enzyme sequences (e), respectively.
We make a similarity matrix for each feature x ∈ {s, g } named \( {M}_{n\times n}^x \), the value of n shows the number of drugs, as follows:
where the feature x is available for drug i in the database. The similarity between drugs i and j based on feature x is computed by sim function using Cosine measures which is more compatible with our data [51]. In order to compute sim function, we use the “proxy” package in R [52].
In addition, we make a similarity matrix \( {\mathrm{M}}_{\mathrm{n}\times \mathrm{n}}^{\mathrm{p}} \) for protein sequences of drug targets as follows:
 1.
ℙ_{i} and ℙ_{j} are made as it was mentioned in section "Protein sequences of drug target".
If ℙ_{i} ≤ ∣ ℙ_{j} ∣ ,
\( \forall \overrightarrow{\uprho_{\mathrm{i}}}\in {\mathbb{P}}_{\mathrm{i}},\kern1em {\mathrm{R}}_{\overrightarrow{\uprho_{\mathrm{i}}}}=\underset{\ \overrightarrow{\uprho_{\mathrm{j}}}\in {\mathbb{P}}_{\mathrm{j}}}{\max}\mathrm{sim}\left(\ \overrightarrow{\uprho_{\mathrm{i}}},\overrightarrow{\uprho_{\mathrm{j}}}\right),{\mathrm{M}}^{\mathrm{p}}\left[\mathrm{i},\mathrm{j}\right]={\sum}_{\overrightarrow{\uprho_{\mathrm{i}}}\in {\mathbb{P}}_{\mathrm{i}}}{\mathrm{R}}_{\overrightarrow{\uprho_{\mathrm{i}}}} \) .
If ℙ_{i} > ∣ ℙ_{j} ∣ ,
\( \forall \overrightarrow{\uprho_{\mathrm{j}}}\in {\mathbb{P}}_{\mathrm{j}},\kern1em {\mathrm{R}}_{\overrightarrow{\uprho_{\mathrm{j}}}}=\underset{\ \overrightarrow{\uprho_{\mathrm{i}}}\in {\mathbb{P}}_{\mathrm{i}}}{\max}\mathrm{sim}\left(\ \overrightarrow{\uprho_{\mathrm{i}}},\overrightarrow{\uprho_{\mathrm{j}}}\right),{\mathrm{M}}^{\mathrm{p}}\left[\mathrm{i},\mathrm{j}\right]={\sum}_{\overrightarrow{\uprho_{\mathrm{j}}}\in {\mathbb{P}}_{\mathrm{j}}}{\mathrm{R}}_{\overrightarrow{\uprho_{\mathrm{j}}}} \) .
According to the set of drugrelated enzyme sequences, the similarity matrix between drugs i and j, M^{e}[i, j], is constructed like the protein sequences of drug targets.
In the following, drugdrug similarity intersection (DDSI) matrix called \( {I}_{n\times n}^E \) is constructed on the subset E ⊆ {s, p, e, g}. The number of drugs (n) shows that all features of the set E is available in the database:
where
and
Using disease features to construct the diseasedisease similarity matrices
We assume that there are m diseases. For each disease i, there are two vectors called \( \overrightarrow{a_i} \) and \( \overrightarrow{d_i} \) to show the representation of phenotype (a) and genotype (d) respectively. We display the length of these vectors below:
We make a similarity matrix for each feature x ∈ {a, d } named \( {M}_{m\times m}^x \) as follows:
where sim function shows the similarity between diseases i and j based on feature x using Cosine measure [51]. In order to compute the sim function, we use the “proxy” package in R [52]. Finally, the diseasedisease similarity (DiDiS) matrix called D_{m × m} is constructed as follows:
where
and
Using drugdrug similarity and diseasedisease similarity to construct drugdisease association matrices
In this subsection, we define the drugdisease association (DDA) matrix \( {A}_{n\times m}^E \) where E is a subset of drug features. To do this, we apply DDSI matrix \( {I}_{n\times n}^E \) and DiDiS matrix D_{m × m} to generate \( {A}_{n\times m}^E \) as follows [29]:
where each pair (i^{′}, j′) is selected from the previously known drugdisease associations set \( \mathcal{A} \).
To make the drugdisease association matrices (A^{E}), we assemble the known drugdisease associations (set \( \mathcal{A} \)) from repoDB [53] and Zhang et al. [30] Datasets.
Results
In this section, we find the best subset of drug features for drug repositioning. Then our method is compared with some computational methods.
Table 1 illustrates the details of the data set where the first and second columns show each subset of drug features and the number of drugs which these features are available in the database, respectively. The third column indicates the number of drugdisease associations where the features are available in the database and the fourth one identifies the number of unknown drugdisease associations corresponding to each combination of drug features.
Drug features assessment
A crossvalidation scheme called leaveoneout is used to find the best subset of drug features for drug repositioning. We predict the association of drug i and disease j based on known associations (see eq. 1). In other words, we hide the known association of drug i and disease j, then use the other known associations to score this pair.
We compute the area under the curve (AUC) for the following test data to evaluate our method. The positive and negative sets of the test data are defined based on 10% of predicted known and unknown drugdisease association pairs obtained from the matrix \( {A}_{n\times m}^E \), respectively. This process is repeated for twenty times to make the test set. The average AUC is shown in the fifth column of Table 1.
To show that the size of the negative set has a negligible effect on the AUC score, we make a test set from all predicted known and unknown drugdisease association pairs obtained from the matrix \( {A}_{n\times m}^E \). The number of positive and negative data of these test sets can be seen in the third and fourth columns of Table 1. The AUC value is in the sixth column, and close to the fifth one. The results show that all drug features are profitable for drug indication prediction (see Table 1). The table shows that {s}, {p}, {e}, {g, s}, {s, p} and {e, p} subsets are more informative than the other subsets of drug features; however, we cannot ignore the positive impact of the number of associations related to each subset.
For further discussion, we assess each subset of drug features to find out which drugs are effective for a specific disease and which diseases are treatable by a particular drug.
We extract 585 diseases which are in the known drugdisease associations (set \( \mathcal{A} \)) related to 146 drugs, including all features. For each subset of drug features, the AUC value of each disease is calculated, and then the average of AUCs is shown in the second column in Table 2. The second column of Table 2 shows {s}, {g, s}, and {s, p} subsets are appropriate to find which drugs are effective for a specific disease. Chemical structure ( SMILES) feature is common among these subsets. This is why so many pharmaceutical companies [8] have been using this feature to find new indications.
The intersection of known drugdisease association (set \( \mathcal{A} \)) with the list of drugs, including all features is 137 drugs. AUC value of each drug is calculated for each subset of drug features and then the average of AUCs is shown in the third column of Table 2. The third column shows {e}, {p} and {e, p} subsets are proper to identify which diseases are treatable with a specific drug.
Drugrelated enzyme sequences (e) are informative, including all the enzymes involved in the activation and metabolism of a drug. Metabolism of drugs in the body is a complex process where drugs are structurally modified to different molecules (metabolites) by various metabolizing enzymes. Studies on drug metabolism are key processes to safety profiles of drug candidates in drug discovery and development [54]. Meanwhile, protein sequences of drug target (p) are known as an essential feature for drug repositioning due to similar binding sites may bind to similar drugs as an assumption [55].
Comparison with some computational methods
We compare our pipeline with three different stateoftheart methods using fivefold crossvalidation [5, 30, 31]. To further analysis, we extract some specific diseases to comparison with two networkbased methods [21, 40].
Comparison with two networkbased approaches on some specific diseases
We compared our pipeline with two networkbased approaches [21, 40]. We extract 21 common diseases of Yang & Agarwa1 [40] and Lee [21] to evaluate our pipeline. We perform our pipeline based on appropriate subsets of drug features ({s}, {g, s}, and {s, p}) to find which drugs are effective for a specific disease (see section "Drug features assessment"). The third to sixth columns of Table 3 show the AUC values of Yang & Agarwa1 and Lee approaches. The last three columns represent the AUC values of each disease obtained by our pipeline. The average AUCs of Yang & Agarwa1 network, Random forest, NNet and three different versions of our pipeline are 0.66, 0.76, 0.68, 0.89 and 0.87, respectively in Table 3.
Comparison with some stateoftheart methods
A fivefold crossvalidation scheme is used to evaluate the accuracy of our pipeline based on the chemical structure of a drug. The AUC value of our model is 0.935 and it is comparable with PREDICT (AUC = 0.902) [5], SCMFDD (AUC = 0.920) [30] and DisDrugPred (AUC = 0.922) [31].
The prediction part of our method acts like PREDICT. Here, we describe the differences between PREDICT and our pipeline. First, we use deep neural networks to reduce the dimensionality of data [56] for extracting drug features and PCA for disease features to find an efficient representation. Second, we collect broader drugdisease associations set than PREDICT. Finally, this pipeline is scalable, and we observe the semantic relations between drugs and diseases, even using only one of the drug features.
Discussion
In this section, we investigate clinical trial studies for several predicted drugdisease pairs showing high probabilities among our prediction [57]. In other words, to evaluate our efficiency and performance, we assess our results to discover the potential drug disease associations with some clinical trial studies that have been published before by database records [57]. The top repositioning candidates from our pipeline analysis are listed in Table 4.
Conclusions
In this article, we presented a pipeline for drug repositioning based on a nonlinear computational approach. We consider four different drug features named the chemical structure of drugs, protein sequences of drug target, drugrelated enzyme sequences, and gene expression profiles. In addition, two features, called phenotype and genotype, are considered for diseases. Efficient representation of data enables integrative analysis and reduces the dimension and heterogeneity of drug and disease features. To find appropriate representation, we use deep learning model to generate some continuous vectors for drug and disease features. Based on these vectors, we make a drugdisease similarity matrix to predict new drug indications. The result showed that our method predicts new drugdisease associations systematically in a more costeffective way and shorter timeline.
This pipeline can see the semantic relations between drugs and diseases using only one drug feature, which means every single one of drug features is informative. This pipeline is scalable and acts as a viable strategy for merely identifying and developing new therapeutic uses for existing or abandoned pharmacotherapies.
Availability of data and materials
All DDA matrices are available in http://bioinformatics.aut.ac.ir/drugdisc/.
Abbreviations
 AUC:

The area under the receiver operating characteristic curve
 CIC:

Cell identity code
 CMAP:

The connectivity map
 DDA:

Drugdisease association matrix
 DDSI:

Drugdrug similarity intersection matrix
 dGEP:

Differential gene expression profile
 DiDiS:

Diseasedisease similarity matrix
 ELU:

Exponential linear unit
 GEPs:

Gene expression profiles
 MSE:

Mean square error
 PCA:

Principal component analysis
 ReLU:

Rectified linear unit
 SDF:

Subset of drug features
 SMILES:

Simplified molecularinput lineentry system
 VAE:

Variational autoencoder
References
 1.
Scannell JW, Blanckley A, Boldon H, Warrington B. Diagnosing the decline in pharmaceutical R&D efficiency. Nat Rev Drug Discov. 2012;11(3):191–200.
 2.
Yella JK, Yaddanapudi S, Wang Y, Jegga AG. Changing trends in computational drug repositioning. Pharmaceuticals. 2018;11(2):57.
 3.
Plenge RM, Scolnick EM, Altshuler D. Validating therapeutic targets through human genetics. Nat Rev Drug Discov. 2013;12:581.
 4.
Zhao K, So H. Drug repositioning for schizophrenia and depression/anxiety disorders: a machine learning approach leveraging expression data. IEEE J Biomed Heal Informatics. 2019;23(3):1304–15.
 5.
Gottlieb A, Stein GY, Ruppin E, Sharan R. PREDICT: a method for inferring novel drug indications with application to personalized medicine. Mol Syst Biol. 2011;7:496.
 6.
Ashburn TT, Thor KB. Drug repositioning: identifying and developing new uses for existing drugs. Nat Rev Drug Discov. 2004;3(8):673–83.
 7.
Xue H, Li J, Xie H, Wang Y. Review of drug repositioning approaches and resources. Int J Biol Sci. 2018;14(10):1232–44.
 8.
Jin G, Wong STC. Toward better drug repositioning: prioritizing and integrating existing methods into efficient pipelines. Drug Discov Today. 2014;19(5):637–44.
 9.
Talevi A. Drug repositioning: current approaches and their implications in the precision medicine era. Expert Rev Precis Med Drug Dev. 2018;3(1):1–13.
 10.
Li J, Zheng S, Chen B, Butte AJ, Swamidass SJ, Lu Z. A survey of current trends in computational drug repositioning. Brief Bioinform. 2016;17(1):2–12.
 11.
Dudley JT, et al. Computational repositioning of the anticonvulsant topiramate for inflammatory bowel disease. Sci Transl Med. 2011;3(96):96ra76.
 12.
Lamb J, et al. The connectivity map: using geneexpression signatures to connect small molecules, genes, and disease. Science. 2006;313(5795):1929–35.
 13.
Vidovic D, Koleti A, Schurer SC. Largescale integration of small moleculeinduced genomewide transcriptional responses, Kinomewide binding affinities and cellgrowth inhibition profiles reveal global trends characterizing systemslevel drug action. Front Genet. 2014;5:342.
 14.
Barrett T, et al. NCBI GEO: mining millions of expression profiles—database and tools. Nucleic Acids Res. 2005;33(Database Issue):D562–6.
 15.
Pacini C, et al. DvD: an R/Cytoscape pipeline for drug repurposing using public repositories of gene expression data. Bioinformatics. 2013;29(1):132–4.
 16.
Dennis GJ, et al. DAVID: database for annotation, visualization, and integrated discovery. Genome Biol. 2003;4(5):P3.
 17.
Subramanian A, et al. Gene set enrichment analysis: a knowledgebased approach for interpreting genomewide expression profiles. Proc Natl Acad Sci U S A. 2005;102(43):15545–50.
 18.
Iorio F, Rittman T, Ge H, Menden M, SaezRodriguez J. Transcriptional data: a new gateway to drug repositioning? Drug Discov Today. 2013;18(7–8):350–7.
 19.
Zhang P, Wang F, Hu J. Towards drug repositioning: a unified computational framework for integrating multiple aspects of drug similarity and disease similarity. AMIA Annu Symp proceedings AMIA Symp. 2014;2014:1258–67.
 20.
Yang J, Li Z, Fan X, Cheng Y. Drugdisease association and drugrepositioning predictions in complex diseases using causal inferenceprobabilistic matrix factorization. J Chem Inf Model. 2014;54:2562–9.
 21.
Lee T, Yoon Y. Drug repositioning using drugdisease vectors based on an integrated network. BMC Bioinformatics. 2018;19(1):446.
 22.
Papanikolaou N, Pavlopoulos GA, Theodosiou T, Vizirianakis IS, Iliopoulos I. DrugQuest  a text mining workflow for drug association discovery. BMC Bioinformatics. 2016;17(Suppl 5):182.
 23.
Mullen J, Cockell SJ, Woollard P, Wipat A. An integrated data driven approach to drug repositioning using genedisease associations. PLoS One. 2016;11(5):e0155811.
 24.
Zhu Q, Tao C, Shen F, Chute CG. Exploring the pharmacogenomics knowledge base (PharmGKB) for repositioning breast cancer drugs by leveraging web ontology language (OWL) and cheminformatics approaches. Pac Symp Biocomput. 2014:172–82.
 25.
Napolitano F, et al. Drug repositioning: a machinelearning approach through data integration. J Chem. 2013;5(1):30.
 26.
Wang Y, Chen S, Deng N, Wang Y. Drug repositioning by kernelbased integration of molecular structure, molecular activity, and phenotype data. PLoS One. 2013;8(11):e78518.
 27.
van Driel MA, Bruggeman J, Vriend G, Brunner HG, Leunissen JAM. A textmining analysis of the human phenome. Eur J Hum Genet. 2006;14(5):535–42.
 28.
Ashburner M, et al. Gene ontology: tool for the unification of biology. The gene ontology consortium. Nat Genet. 2000;25(1):25–9.
 29.
Perlman L, Gottlieb A, Atias N, Ruppin E, Sharan R. Combining drug and gene similarity Measures for drugtarget elucidation. J Comput Biol. 2011;18:133–45.
 30.
Zhang W, et al. Predicting drugdisease associations by using similarity constrained matrix factorization. BMC Bioinformatics. 2018;19(1):233.
 31.
Xuan P, Cao Y, Zhang T, Wang X, Pan S, Shen T. Drug repositioning through integration of prior knowledge and projections of drugs and diseases. Bioinformatics. 2019;35:4108–19.
 32.
Aliper A, Plis S, Artemov A, Ulloa A, Mamoshina P, Zhavoronkov A. Deep learning applications for predicting pharmacological properties of drugs and drug repurposing using transcriptomic data. Mol Pharm. 2016;13(7):2524–30.
 33.
Donner Y, Kazmierczak S, Fortney K. Drug repurposing using deep Embeddings of gene expression profiles. Mol Pharm. 2018;15(10):4314–25.
 34.
Lasko TA, Denny JC, Levy MA. Computational phenotype discovery using unsupervised feature learning over noisy, sparse, and irregular clinical data. PLoS One. 2013;8(6):e66341.
 35.
Greene CS, Troyanskaya OG. Chapter 2: datadriven view of disease biology. PLoS Comput Biol. 2012;8(12):e1002816.
 36.
LeCun Y, Bengio Y, Hinton G. Deep learning. Nature. 2015;521:436.
 37.
Mikolov T, Sutskever I, Chen K, Corrado G, Dean J. Distributed representations of words and phrases and their compositionality. CoRR. 2013;abs/1310.4:31119.
 38.
GómezBombarelli R, et al. Automatic chemical design using a datadriven continuous representation of molecules. CoRR. 2016;abs/1610.0:26876.
 39.
Asgari E, Mofrad MRK. Continuous distributed representation of biological sequences for deep proteomics and genomics. PLoS One. 2015;10(11):e0141287.
 40.
Yang L. Systematic drug repositioning based on clinical sideeffects. 2011;6(12):e28025.
 41.
Weininger D. SMILES, a chemical language and information system: 1: Introduction to methodology and encoding rules. J Chem Inf Comput Sci. 1988;28(1):31–6.
 42.
Wishart DS, et al. DrugBank 5.0: a major update to the DrugBank database for 2018. Nucleic Acids Res. 2018;46(D1):D1074–82.
 43.
Kim S, et al. PubChem substance and compound databases. Nucleic Acids Res. 2016;44(D1):D1202–13.
 44.
Chollet F, et al. Keras; 2015.
 45.
AlRfou R, et al. Theano: {a} python framework for fast computation of mathematical expressions. CoRR. 2016. vol. abs/1605.0. arXiv:1605.02688.
 46.
Scheife RT. Protein binding: what does it mean? DICP. 1989;23(7–8 Suppl):S27–31.
 47.
Azarkhalili B, Saberi A, Chitsaz H, SharifiZarchi A. ِDeePathology: Deep MultiTask learning for Inferring molecular pathology from Cancer Transcriptome. CoRR. 2018. vol. abs/arXiv:1808.02237.
 48.
Abdolhosseini F, et al. Cell identity codes: understanding cell identity from gene expression profiles using deep neural networks. CoRR. 2018;abs/1806.0:2342
 49.
Bergstra J, Komer B, Eliasmith C, Yamins D, Cox DD. Hyperopt: a python library for model selection and hyperparameter optimization. Comput Sci Discov. 2015;8(1):14008.
 50.
Mungall CJ, et al. The monarch initiative: an integrative data and analytic platform connecting phenotypes to genotypes across species. Nucleic Acids Res. 2017;45(Database issue):D712–22.
 51.
Strehl A. Relationshipbased clustering and cluster ensembles for highdimensional data mining: Framework; 2002.
 52.
Package T, Distance T, Measures S. Package ‘ proxy; 2017.
 53.
Brown AS, Patel CJ. A standard database for drug repositioning. Sci Data. 2017;4:170029.
 54.
Zhang Z, Tang W. Drug metabolism in drug discovery and development. Acta Pharm Sin B. 2018;8(5):721–32.
 55.
Ab Ghani NS, Ramlan EI, FirdausRaih M. Drug ReposER: a web server for predicting similar amino acid arrangements to known drug binding interfaces for potential drug repositioning. Nucleic Acids Res. 2019;47(W1):W350–6.
 56.
Hinton GE, Salakhutdinov RR. Reducing the dimensionality of data with neural networks. Science (80 ). 2006;313(5786):504–7.
 57.
“clinicaltrials.gov.” [Online]. Available: https://clinicaltrials.gov/.
Acknowledgments
ASZ and MG would like to acknowledge Roghayeh Naserkhaki. MM and FZM thank Bita Pourmohsenin and Behnoosh Ashrafi for fruitful comments in editing the manuscript and Bahram Mohammadpour for insightful discussions.
Funding
No funding was obtained for this study.
Author information
Affiliations
Contributions
Initial idea of the research was from MM and FZM. MM prepared and preprocessed the chemical structure, protein sequences of drug target and drugrelated enzyme sequences. MG and ASZ preprocessed and implemented the gene expression profiles. MM and MG prepared the DiDiS matrix. MM and MG assembled the drugdisease association set. MM designed and implemented the method and tested on different subsets. MM and FZM carried out the repositioning analyses and constructed the DDA matrix. MM prepared the initial draft of this article. MM, FZM and ASZ edited and reviewed the manuscript. All authors approved the final manuscript.
Corresponding author
Correspondence to Fatemeh ZareMirakabad.
Ethics declarations
Ethics approval and consent to participate
Not applicable.
Consent for publication
Not applicable.
Competing interests
The authors declared that they have no competing interests exist.
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The Creative Commons Public Domain Dedication waiver (http://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated.
About this article
Cite this article
Moridi, M., Ghadirinia, M., SharifiZarchi, A. et al. The assessment of efficient representation of drug features using deep learning for drug repositioning. BMC Bioinformatics 20, 577 (2019). https://doi.org/10.1186/s128590193165y
Received:
Accepted:
Published:
Keywords
 Drug indication prediction
 Drug repurposing
 Deep neural network