# Virtual Screening of Drug Proteins Based on Imbalance Data Mining

Authors: Peng Li; Lili Yin; Bo Zhao; Yuezhongyi Sun
Journal: Mathematical Problems in Engineering
 (2021)

---

## Abstract

To address the imbalanced data problem in molecular docking-based virtual screening methods, this paper proposes a virtual screening method for drug proteins based on imbalanced data mining, which introduces machine learning technology into the virtual screening technology for drug proteins to deal with the imbalanced data problem in the virtual screening process and improve the accuracy of the virtual screening. First, to address the data imbalance problem caused by the large difference between the number of active compounds and the number of inactive compounds in the docking conformation generated by the actual virtual screening process, this paper proposes a way to improve the data imbalance problem using SMOTE combined with genetic algorithm to synthesize new active compounds artificially by upsampling active compounds. Then, in order to improve the accuracy in the virtual screening process of drug proteins, the idea of integrated learning is introduced, and the random forest (RF) extended from Bagging integrated learning technique is combined with the support vector machine (SVM) technique, and the virtual screening of molecular docking conformations using RF-SVM technique is proposed to improve the prediction accuracy of active compounds in docking conformations. To verify the effectiveness of the proposed technique, first, HIV-1 protease and SRC kinase were used as test data for the experiments, and then, CA II was used to validate the model of the test data. The virtual screening of drug proteins using the proposed method in this paper showed an improvement in both enrichment factor (EF) and AUC compared with the use of the traditional virtual screening, for the test dataset. Therefore, it can be shown that the proposed method can effectively improve the accuracy of drug virtual screening.


---

## Body

## 1. Introduction

In recent years, the continuous discovery of natural and synthetic compounds and other small molecules has provided a large amount of data validation resources for the drug development process, but since the traditional validation process in drug development is still mainly by means of clinical trials, nothing can be done in the face of the large number of clinical trial datasets nowadays [1]. This has led to the phenomenon that although a very large amount of money is invested in the drug development process each year, very few drugs are actually produced [2]. In the drug development process, the type of lead compound and the quality of the compound have a direct impact on the ease and duration of drug development; for example, the better the quality of the lead compound, the lower the elimination rate of the drug in the drug development process, and vice versa [3]. Since the 1980s, computer technology has been widely used in the drug development process due to the efficient computing power of computers [4]. The use of computer technology in drug development not only saves time and money but also, and most importantly, greatly improves the accuracy of the drug development process. One of the typical representatives of computer-aided drug design can be called virtual screening technology [5].Virtual screening technology is actually a simulation of the drug development process on a computer, which makes it an efficient drug development aid due to the efficient performance of computers, and it can also improve the accuracy of drug development [6]. In experimental datasets, imbalance between inactive and active compound datasets can make the experimental data biased and seriously affect the experimental results of virtual screening [7]. Therefore, the virtual screening process of drugs can be viewed as an imbalanced data classification problem. Traditional virtual screening techniques usually use two schemes, similarity search and sampling scoring, for the screening of lead compounds [8]. However, both schemes do not deal well with the problem of data imbalance caused by the disparity in the number of active and inactive compounds among the candidate compounds. In this paper, we introduce the problem of processed imbalanced data into the process of virtual screening of drug proteins, an idea that is still rare in the field of drug development. In the actual drug development process, we should focus more on the data of active compounds with less data volume in the dataset. Therefore, a detailed study of this imbalanced data prediction problem is carried out in this paper, and its study is applied to the drug virtual screening process, and a complete drug virtual screening scheme is established.In the process of drug development, virtual screening of drug proteins using computer-aided drug design can improve the efficiency of drug development to a great extent [9]. To address the problem of imbalanced data arising from the large difference between the number of active and inactive compounds during the virtual screening approach, this paper proposes a genetic algorithm based on SMOTE to perform preprocessing on the imbalanced dataset as a way to reduce the imbalance ratio of the categorical data, by increasing the number of positive examples of data from a few classes, not only to ensure the integrity of the data but also reduce the imbalance ratio. In response to the problem that the traditional virtual screening technique is not effective in classification, this paper introduces the idea of integrated learning and proposes a more effective classification of the binding conformation of molecules based on RF-SVM classification algorithm, from which effective active compounds can be screened, and this method can not only improve the screening accuracy of lead compounds but also accelerate the drug development process and shorten the drug development cycle [10].


## 2. Genetic Algorithm Upsampling Technique Based on SMOTE

Data scarcity is evident during virtual screening experiments, where out-of-balance data are often required. This is because the crystal structures of many proteins have not yet been resolved. For example, the crystal structure of the resolved SRC kinase is only about 90, and if SRC is used as a target protein for virtual screening, it is easy to have a serious imbalance in the number of positive and negative example data samples in the dataset. The imbalance data problem in the classification problem is mainly manifested in the imbalance of the positive and negative data, often appearing in the classification process to the side of the majority of the negative data, and some may even cause the phenomenon of “data flooding.” To address the imbalance problem, this paper combines the advantages of SMOTE algorithm and genetic algorithm and proposes a genetic algorithm upsampling technique based on SMOTE.The SMOTE algorithm mainly aims to reduce the imbalance ratio by adding the number of data elements of the positive sample, but there is a certain blindness in generating new data. There are many uncertainties and errors in the process of actual use; for example, the data information around the positive sample is not considered in the process of sample synthesis, so the phenomenon of data confusion is easy to occur.The genetic algorithm synthesizes new data samples by selecting the determined sample data by crossover variation, where the selection operator can be used to select the samples of the dataset to be manipulated and to control the number of new data to be synthesized in the end, the crossover operator of the genetic algorithm can keep the newly generated samples similar to the original sample data, and the diversity of the new samples can be maintained by the variation operator. By studying the advantages and disadvantages of these two algorithms in synthesizing new datasets, a new algorithm (GA-SMOTE) is proposed, which incorporates the ideas of the SMOTE algorithm into the genetic algorithm.The specific steps of the new algorithm are as follows.(1)
The degree of influence of positive and negative examples in the training dataset is coded according to the eigenvalues of the sample dataset(2)
Two samples are selected from the sample data according to the fitness function(3)
The selected two samples are crossed or mutated to produce a new sample datasetThe flow of the new algorithm is as follows.(1)
Set the input original training sample TrainData; set the output path DataSet. Set the number of feature values in the sample dataset ton, the number of large class samples in the dataset to N, and the number of small class samples to T.(2)
Set the number of samples NUM, that is, the number of minority class samples that need to be synthesized in order to balance the minority class samples and the majority class samples.(3)
Coding of eigenvalues.①
A sample is randomly selected from a small number of classesTi②
Thek minority class sample sets T1,T2,T3,…,Tk around Ti and the k majority class sample datasets N1,N2,N3,…,Nk are selected by the Euclidean distance approach in the SMOTE algorithm, while the k sample data around Ti are selected, and if more than half of the k sample data are majority class samples, this data is assumed to be at the boundary position and no cross-variance operation is performed on it③
Calculate the average valueLt of the distance from Ti to T1,T2,T3,…,Tk and the average value Ln of the distance from Ti toN1,N2,N3,…,Nk, and calculate Lt/Ln=L1④
Remove a random eigenvalue from the sample, and then, calculate the average valueLt′of the distance from Ti to T1,T2,T3,…,Tk and the average value Ln′ of the distance from Ti to N1,N2,N3,…,Nk, respectively, after removing this eigenvalue. Lt′/Ln′=L2 is calculated⑤
IfL1>L2, then this eigenvalue can be characterized as majority class; otherwise, this eigenvalue can be characterized as minority class, and then use 0 to characterize the majority class eigenvalue and 1 to characterize the minority class eigenvalue⑥
Repeat the previously mentioned steps until alln eigenvalues are encoded and finishedThe pseudocode is as follows (see Algorithm1).(4)
The minority class is ranked according to the fitness function of the minority class sample, and the top 50% is taken out, and then two samples of data are randomly selected from them, and the crossover variation is performed. If it is the majority class eigenvalue, the variation is performed by SMOTE algorithm, and if it is the minority class sample, the crossover is performed The schematic diagram is shown in Figure1, where x represents a random variable between 0 and 1.(5)
Loop through the fourth step until the new sample data generated reaches NUM.The flowchart of the improved genetic algorithm is shown in Figure2.Algorithm 1: GA_SMOTE (T, n, k, x).
Input: number of minority class samplesT; number of attributes n; K nearest nearby dataOutput: attributes coding(1)
whilex < n(2)
Randomize the minority class samplesTi(3)
k = Number of nearest Nearby(4)
T1,T2,T3,…,Tk: k minority classes around Ti(5)
N1,N2,N3,…,Nk: k majority classes around Ti(6)
Classes aroundTi(7)
if majority classes > minority classes(8)
continue(9)
End(10)
Lt = Average distance from Ti to T1,T2,T3,…,Tk(11)
Ln = Average distance from Ti to N1,N2,N3,…,Nk(12)
Lt/Ln=L1(13)
Randomize delete an attributes(14)
Lt′ = Average distance from Ti to T1,T2,T3,…,Tk(15)
Ln′ = Average distance from Ti toN1,N2,N3,…,Nk(16)
Lt′/Ln′=L2(17)
ifL1>L2(18)
Then the attribute representative the majority classes(19)
End(20)
The attribute representative the majority classes(21)
EndFigure 1
Eigenvalue cross-variation graph.Figure 2
Improved genetic algorithm flowchart.


### 2.1. Introduction of RF-SVM-Based Classification Algorithm

Currently, support vector machines (SVM) have been able to solve most of the data classification problems with relatively small amount of data, distinct eigenvalue identification, and relatively balanced data distribution [11]. However, for the classification problem of imbalanced datasets, the effectiveness of SVM decreases significantly. It is mainly because of the uneven distribution of the training dataset, which leads to a serious imbalance in the ratio of positive and negative example sample data, and the majority class of negative example data samples dominates, making the final classification hyperplane tilted towards the negative example data. Experimental studies have shown that SVM is more effective in dealing with classification of imbalanced data compared to other classification models. The flow of SVM in dealing with classification problems is as follows.The given sample dataset is denoted asL=x1,y1,x2,y2,x3,y3,…,xn,yn, where xi∈Rd,yi∈−1,1,i=1,2,3,…,n. yi denotes the class of sample xi, d denotes the number of bits of sample data, and n denotes the number of sample data for training. The representation of the hyperplane is as follows:(1)w⋅x+b=0,where w is the normal vector, representing the direction of the hyperplane, and b is the offset, representing the distance between the hyperplane and the origin. Therefore, a hyperplane can be represented by w,b. The distance of any individual x in the sample space to the hyperplane can be expressed as r:(2)r=wx+bw.The SVM algorithm learning problem can be formulated as a constrained optimality problem, as shown in the following equation:(3)minw22,and w2/2 denotes the maximization decision edge, which has the following constraints:(4)yi∗w⋅x+b≥1,i=1,2,3,…,n.This is a convex optimization problem, which can be solved by introducing the standard form of Lagrange multipliers with a modification of the objective function, as shown in the following equation:(5)Lp=w22−∑i=1nλiyi∗w⋅x+b−1,where λi denotes the introduced Lagrange multiplier. In order to minimize λi, w and b can be made equal to zero, and then, the derivative can be obtained as follows:(6)∂Lp∂w=0⟹w=∑i=1nλiyixi,∂Lp∂b=0⟹∑i=1nλiyi=0.The problem can be transformed into the pairwise function formula shown in the following equation:(7)LD=∑i=1nλi−12∑i,jλiλiyiyixixi.The decision boundary can also be expressed as shown in the following equation:(8)∑i=1nλiyixi⋅x+b=0.After determining the parameters of the decision boundary, the final classifier formula is obtained as shown in the following equation:(9)fz=signw⋅x+b=sign∑i=1nλiyixi⋅z+b,where sign denotes the symbolic function and z denotes the instance data to be detected.To address the shortcomings of SVM in dealing with imbalanced data problems, this paper introduces the idea of integrated learning. Since the Bagging classifier does not target a specific instance data in the training set, each sample is selected with equal probability. Bagging has a better fitting performance, and the independence between individual classifiers of Bagging is higher. Therefore, the classifiers can run in parallel with each other, and the speed is faster, almost the same as the speed of individual classifiers. The random forest algorithm is an extension of Bagging, which not only retains all the advantages of Bagging and adds automatic feature selection but is also simpler to implement than the Boosting family of algorithms. SVM shows good performance for processing small sample data, which is in line with the realistic data situation in the virtual screening process, and can also solve the high-dimensional data classification problem, so this paper chooses the combination of RF and SVM to build a classification model for the data of drug proteins.The algorithmic idea is as follows: random forest is actually a combined classifier, combining individual classifiers together using the voting method to get the final classifier, because RF is not sensitive to the noise data in the dataset; therefore, the noise data in the data are first filtered by the SVM algorithm, that is, the misclassified data or the data that are not easily distinguished are extracted and selected, and then the data are learned and trained by the RF algorithm.Input data are as follows: the training sample datasetL=x1,y1,x2,y2,x3,y3,…,xn,yn, xi∈Rd,yi∈−1,1,i=1,2,3,…,n and the number of input iterations N.Phase I:(1)
First, a portion of the data inL is selected for training, and then, the remaining data is iteratively added(2)
Classify the data through the hyperplane and remove the assumed noisy dataset according to a certain strategy(3)
Repeat the above stepsN timesPhase II: training sample datasetN; number of base classifiers of RF X(4)
The training sample dataN is randomly divided into X points, and the subdata samples are assumed to be Ti,i=1,2,3,…,X(5)
Train the base classifier by base classifier CART decision tree(6)
Repeat the previously mentioned stepsX times(7)
The final strong classifier is selected based on the voting methodIt is demonstrated experimentally that the best training effect of RF is achieved whenX is taken as 100, and the sampling ratio of training data can be taken as 0.63. The value of N not only affects the accuracy of SVM algorithm and the speed of SVM but also affects the judgment of noisy data. Therefore, the final classification result is optimal when the value of N is about 40 through the experimental constant tuning test.


## 2.1. Introduction of RF-SVM-Based Classification Algorithm

Currently, support vector machines (SVM) have been able to solve most of the data classification problems with relatively small amount of data, distinct eigenvalue identification, and relatively balanced data distribution [11]. However, for the classification problem of imbalanced datasets, the effectiveness of SVM decreases significantly. It is mainly because of the uneven distribution of the training dataset, which leads to a serious imbalance in the ratio of positive and negative example sample data, and the majority class of negative example data samples dominates, making the final classification hyperplane tilted towards the negative example data. Experimental studies have shown that SVM is more effective in dealing with classification of imbalanced data compared to other classification models. The flow of SVM in dealing with classification problems is as follows.The given sample dataset is denoted asL=x1,y1,x2,y2,x3,y3,…,xn,yn, where xi∈Rd,yi∈−1,1,i=1,2,3,…,n. yi denotes the class of sample xi, d denotes the number of bits of sample data, and n denotes the number of sample data for training. The representation of the hyperplane is as follows:(1)w⋅x+b=0,where w is the normal vector, representing the direction of the hyperplane, and b is the offset, representing the distance between the hyperplane and the origin. Therefore, a hyperplane can be represented by w,b. The distance of any individual x in the sample space to the hyperplane can be expressed as r:(2)r=wx+bw.The SVM algorithm learning problem can be formulated as a constrained optimality problem, as shown in the following equation:(3)minw22,and w2/2 denotes the maximization decision edge, which has the following constraints:(4)yi∗w⋅x+b≥1,i=1,2,3,…,n.This is a convex optimization problem, which can be solved by introducing the standard form of Lagrange multipliers with a modification of the objective function, as shown in the following equation:(5)Lp=w22−∑i=1nλiyi∗w⋅x+b−1,where λi denotes the introduced Lagrange multiplier. In order to minimize λi, w and b can be made equal to zero, and then, the derivative can be obtained as follows:(6)∂Lp∂w=0⟹w=∑i=1nλiyixi,∂Lp∂b=0⟹∑i=1nλiyi=0.The problem can be transformed into the pairwise function formula shown in the following equation:(7)LD=∑i=1nλi−12∑i,jλiλiyiyixixi.The decision boundary can also be expressed as shown in the following equation:(8)∑i=1nλiyixi⋅x+b=0.After determining the parameters of the decision boundary, the final classifier formula is obtained as shown in the following equation:(9)fz=signw⋅x+b=sign∑i=1nλiyixi⋅z+b,where sign denotes the symbolic function and z denotes the instance data to be detected.To address the shortcomings of SVM in dealing with imbalanced data problems, this paper introduces the idea of integrated learning. Since the Bagging classifier does not target a specific instance data in the training set, each sample is selected with equal probability. Bagging has a better fitting performance, and the independence between individual classifiers of Bagging is higher. Therefore, the classifiers can run in parallel with each other, and the speed is faster, almost the same as the speed of individual classifiers. The random forest algorithm is an extension of Bagging, which not only retains all the advantages of Bagging and adds automatic feature selection but is also simpler to implement than the Boosting family of algorithms. SVM shows good performance for processing small sample data, which is in line with the realistic data situation in the virtual screening process, and can also solve the high-dimensional data classification problem, so this paper chooses the combination of RF and SVM to build a classification model for the data of drug proteins.The algorithmic idea is as follows: random forest is actually a combined classifier, combining individual classifiers together using the voting method to get the final classifier, because RF is not sensitive to the noise data in the dataset; therefore, the noise data in the data are first filtered by the SVM algorithm, that is, the misclassified data or the data that are not easily distinguished are extracted and selected, and then the data are learned and trained by the RF algorithm.Input data are as follows: the training sample datasetL=x1,y1,x2,y2,x3,y3,…,xn,yn, xi∈Rd,yi∈−1,1,i=1,2,3,…,n and the number of input iterations N.Phase I:(1)
First, a portion of the data inL is selected for training, and then, the remaining data is iteratively added(2)
Classify the data through the hyperplane and remove the assumed noisy dataset according to a certain strategy(3)
Repeat the above stepsN timesPhase II: training sample datasetN; number of base classifiers of RF X(4)
The training sample dataN is randomly divided into X points, and the subdata samples are assumed to be Ti,i=1,2,3,…,X(5)
Train the base classifier by base classifier CART decision tree(6)
Repeat the previously mentioned stepsX times(7)
The final strong classifier is selected based on the voting methodIt is demonstrated experimentally that the best training effect of RF is achieved whenX is taken as 100, and the sampling ratio of training data can be taken as 0.63. The value of N not only affects the accuracy of SVM algorithm and the speed of SVM but also affects the judgment of noisy data. Therefore, the final classification result is optimal when the value of N is about 40 through the experimental constant tuning test.


## 3. Experimental Verification and Analysis

### 3.1. Evaluation Criteria

In this paper, we chose the enrichment factor (EF) as one of the evaluation indexes. EF is an important criterion for evaluating the effectiveness of virtual screening, and it is also the most general criterion for evaluating virtual screening techniques. In the case of relatively small sample data, a larger value of the enrichment factor indicates a greater number of active compounds, which can be detected [10]. The formula for calculating EF is as follows:(10)EF=Hitssampledx%Nsampledx%⋅NtotalHitstotal,where Hitssamplex% denotes the number of active compounds in x% of the test set database, Nsampledx% denotes the number of inactive decoys in x% of the test set database, Ntotal denotes the number of compounds in the entire test set, and Hitstotal denotes the number of active compounds in the entire test set.In the actual drug screening process, only a small fraction of the compounds are screened by computer means. In this paper, EF is selected as the evaluation criteria for virtual screening, and ROC curve and AUC area are also introduced in the evaluation criteria of this paper. The ROC curve, also known as the “subject operating characteristic curve,” is a visual graphical evaluation criterion that graphically represents the correlation between sensitivity and specificity. The false positive rate is used as the horizontal coordinate and the true positive rate as the vertical coordinate. The AUC area represents the area of the graph enclosed by the ROC curve and thex-coordinate axis, allowing a more visual analysis of the model [12]. The formula for the AUC area is as follows:(11)AUCf=∑t=1n12yi−1+yi⋅xi−xi−1.The value of AUC area ranges from 0 to 1, but it is usually between 0.5 and 1. When the value of AUC reaches 1, it means that the classification effect of the classifier reaches the optimal situation, and the larger the value of AUC area is, the better the prediction effect of this model classifier is.


### 3.2. Experimental Data Acquisition

The two specific techniques proposed in this paper, “SMOTE-based genetic algorithm” and “RF-SVM-based classification algorithm,” were validated using HIV-1 protease and SRC kinase as experimental data. HIV-1 protease is one of the more critical proteases for the treatment of human immunodeficiency syndrome, and HIV-1 protease has two identical peptide chains, a homodimer composed of two polypeptides [13]. SRC kinase is widely present in tissue cells and can react with important molecules in signal transduction pathways, participating in cellular metabolic processes and regulating cell growth, development, and differentiation. This kinase has been implicated in the development of several cancers [14]. Activation of the SRC pathway has been detected in approximately more than 50% of various cancers, so the treatment of cancer can be achieved by inhibiting the activity of SRC [12]. The crystal structures of HIV-1 protease and SRC kinase can be obtained directly from the PDB database. The HIV-1 protease has a PID of 1PRO with a resolution of 1.80 Å [15] and the structure is shown in Figure 3. The SRC kinase has a PID of 2H8H with a resolution of 2.20 Å and the structure is shown in Figure 4.Figure 3
PID is 1RPO HIV-1 protease complex binding crystal.Figure 4
PID is 2H8H SRC kinase complex binding crystal.In this paper, the experiments are divided into four cases, in which the two proteins are compared before and after processing by the “SMOTE-based genetic algorithm” and the comparison experiments using the two methods of SVM and RF-SVM. The data structures before and after sampling are shown in Tables1 and 2.Table 1
HIV-1 data classification results.
AlgorithmProtein nameEFAUCBefore samplingSVMHIV-15.930.729Before samplingRF-SVMHIV-16.510.785After samplingSVMHIV-16.580.795After samplingRF-SVMHIV-17.160.839Table 2
SRC data classification results.
AlgorithmProtein nameEFAUCBefore samplingSVMSRC5.870.722Before samplingRF-SVMSRC6.430.769After samplingSVMSRC6.250.741After samplingRF-SVMSRC6.960.828For both datasets, HIV-1 and SRC, the ROCs of the previously mentioned two datasets for the comparison experiments are shown in Figure5.Figure 5
Graph of ROC comparison of two experimental datasets.
(a)(b)(c)(d)In order to prove the validity of the experiments, two sets of representative data were used as experimental data for model reliability comparison experiments, which were conducted before and after sampling preprocessing, SVM algorithm and RF-SVM algorithm, respectively. The differences in ROC curve, AUC area, enrichment factor (EF), and accuracy were obtained by the experimental results, which showed that the RF-SVM algorithm proposed in this paper was improved for the virtual screening experimental results of drug proteins.The data of HIV-1 protease and SRC kinase were observed: when HIV-1 protease was used as the target protein, the area of AUC increased from 0.795 to 0.839, the enrichment factor increased from 6.58 to 7.16, and the accuracy increased from 0.651 to 0.746, indicating that the results of the virtual screening of drug proteins by RF-SVM were improved after the sampling preprocessing. When the virtual screening simulations were performed by the basic SVM algorithm and RF-SVM algorithm before the sampling preprocessing, the area of the AUC increased from 0.729 to 0.785, the enrichment factor increased from 5.93 to 6.51, and accuracy increased from 0.547 to 0.647, indicating that the results of RF-SVM for virtual screening of drug proteins were improved when the sampling preprocessing was performed. When the virtual screening simulation experiments were performed using the basic SVM algorithm and the RF-SVM algorithm with SRC kinase as the target protein, the area of AUC increased from 0.741 to 0.828, the enrichment factor also increased from 6.25 to 6.96, and the accuracy also increased from 0.674 to 0.754 after sampling pretreatment. This indicates that, after sampling, the area of AUC increased from 0.722 to 0.769, the enrichment factor increased from 5.87 to 6.43, and accuracy increased from 0.544 to 0.679 when the basic SVM algorithm and RF-SVM algorithm were used for virtual screening simulation experiments before sampling pretreatment. The experimental results show that after pretreatment by sampling, the results of RF-SVM for virtual screening of drug proteins have been improved.


### 3.3. Experimental Verification

In order to verify the validity of the method proposed in this paper, the experimental results were verified using carbonic anhydrase II (CA II), a zinc-containing metalloenzyme that reversibly mediates the hydration of carbon dioxide, which maintains acid-base balance in blood and other tissues and helps tissues in the body to eliminate carbon dioxide. CA II has a PID of 1Z9Y and a resolution value of 1.66 Å. Its structure is shown in Figure6.Figure 6
CA II with PID of 1Z9Y.The experimental results are summarized in Table3.Table 3
CA II data classification results.
AlgorithmProtein nameEFAUCBefore samplingSVMCA II5.830.717After samplingRF-SVMCA II6.360.775The comparative results of the experiment are shown in Figure7.Figure 7
Comparative results of experimental data.The stacking of ROC curves and AUC areas in the experimental results can be obtained: the virtual screening results have improved after sampling by sampling, which can verify the effectiveness of the method proposed in this paper. The AUC increased from 0.717 to 0.775, the enrichment factor increased from 5.83 to 6.36, and the accuracy increased from 0.675 to 0.710 when SVM and RF-SVM were used for classification, indicating that the results of RF-SVM for virtual screening of drug proteins were improved.


## 3.1. Evaluation Criteria

In this paper, we chose the enrichment factor (EF) as one of the evaluation indexes. EF is an important criterion for evaluating the effectiveness of virtual screening, and it is also the most general criterion for evaluating virtual screening techniques. In the case of relatively small sample data, a larger value of the enrichment factor indicates a greater number of active compounds, which can be detected [10]. The formula for calculating EF is as follows:(10)EF=Hitssampledx%Nsampledx%⋅NtotalHitstotal,where Hitssamplex% denotes the number of active compounds in x% of the test set database, Nsampledx% denotes the number of inactive decoys in x% of the test set database, Ntotal denotes the number of compounds in the entire test set, and Hitstotal denotes the number of active compounds in the entire test set.In the actual drug screening process, only a small fraction of the compounds are screened by computer means. In this paper, EF is selected as the evaluation criteria for virtual screening, and ROC curve and AUC area are also introduced in the evaluation criteria of this paper. The ROC curve, also known as the “subject operating characteristic curve,” is a visual graphical evaluation criterion that graphically represents the correlation between sensitivity and specificity. The false positive rate is used as the horizontal coordinate and the true positive rate as the vertical coordinate. The AUC area represents the area of the graph enclosed by the ROC curve and thex-coordinate axis, allowing a more visual analysis of the model [12]. The formula for the AUC area is as follows:(11)AUCf=∑t=1n12yi−1+yi⋅xi−xi−1.The value of AUC area ranges from 0 to 1, but it is usually between 0.5 and 1. When the value of AUC reaches 1, it means that the classification effect of the classifier reaches the optimal situation, and the larger the value of AUC area is, the better the prediction effect of this model classifier is.


## 3.2. Experimental Data Acquisition

The two specific techniques proposed in this paper, “SMOTE-based genetic algorithm” and “RF-SVM-based classification algorithm,” were validated using HIV-1 protease and SRC kinase as experimental data. HIV-1 protease is one of the more critical proteases for the treatment of human immunodeficiency syndrome, and HIV-1 protease has two identical peptide chains, a homodimer composed of two polypeptides [13]. SRC kinase is widely present in tissue cells and can react with important molecules in signal transduction pathways, participating in cellular metabolic processes and regulating cell growth, development, and differentiation. This kinase has been implicated in the development of several cancers [14]. Activation of the SRC pathway has been detected in approximately more than 50% of various cancers, so the treatment of cancer can be achieved by inhibiting the activity of SRC [12]. The crystal structures of HIV-1 protease and SRC kinase can be obtained directly from the PDB database. The HIV-1 protease has a PID of 1PRO with a resolution of 1.80 Å [15] and the structure is shown in Figure 3. The SRC kinase has a PID of 2H8H with a resolution of 2.20 Å and the structure is shown in Figure 4.Figure 3
PID is 1RPO HIV-1 protease complex binding crystal.Figure 4
PID is 2H8H SRC kinase complex binding crystal.In this paper, the experiments are divided into four cases, in which the two proteins are compared before and after processing by the “SMOTE-based genetic algorithm” and the comparison experiments using the two methods of SVM and RF-SVM. The data structures before and after sampling are shown in Tables1 and 2.Table 1
HIV-1 data classification results.
AlgorithmProtein nameEFAUCBefore samplingSVMHIV-15.930.729Before samplingRF-SVMHIV-16.510.785After samplingSVMHIV-16.580.795After samplingRF-SVMHIV-17.160.839Table 2
SRC data classification results.
AlgorithmProtein nameEFAUCBefore samplingSVMSRC5.870.722Before samplingRF-SVMSRC6.430.769After samplingSVMSRC6.250.741After samplingRF-SVMSRC6.960.828For both datasets, HIV-1 and SRC, the ROCs of the previously mentioned two datasets for the comparison experiments are shown in Figure5.Figure 5
Graph of ROC comparison of two experimental datasets.
(a)(b)(c)(d)In order to prove the validity of the experiments, two sets of representative data were used as experimental data for model reliability comparison experiments, which were conducted before and after sampling preprocessing, SVM algorithm and RF-SVM algorithm, respectively. The differences in ROC curve, AUC area, enrichment factor (EF), and accuracy were obtained by the experimental results, which showed that the RF-SVM algorithm proposed in this paper was improved for the virtual screening experimental results of drug proteins.The data of HIV-1 protease and SRC kinase were observed: when HIV-1 protease was used as the target protein, the area of AUC increased from 0.795 to 0.839, the enrichment factor increased from 6.58 to 7.16, and the accuracy increased from 0.651 to 0.746, indicating that the results of the virtual screening of drug proteins by RF-SVM were improved after the sampling preprocessing. When the virtual screening simulations were performed by the basic SVM algorithm and RF-SVM algorithm before the sampling preprocessing, the area of the AUC increased from 0.729 to 0.785, the enrichment factor increased from 5.93 to 6.51, and accuracy increased from 0.547 to 0.647, indicating that the results of RF-SVM for virtual screening of drug proteins were improved when the sampling preprocessing was performed. When the virtual screening simulation experiments were performed using the basic SVM algorithm and the RF-SVM algorithm with SRC kinase as the target protein, the area of AUC increased from 0.741 to 0.828, the enrichment factor also increased from 6.25 to 6.96, and the accuracy also increased from 0.674 to 0.754 after sampling pretreatment. This indicates that, after sampling, the area of AUC increased from 0.722 to 0.769, the enrichment factor increased from 5.87 to 6.43, and accuracy increased from 0.544 to 0.679 when the basic SVM algorithm and RF-SVM algorithm were used for virtual screening simulation experiments before sampling pretreatment. The experimental results show that after pretreatment by sampling, the results of RF-SVM for virtual screening of drug proteins have been improved.


## 3.3. Experimental Verification

In order to verify the validity of the method proposed in this paper, the experimental results were verified using carbonic anhydrase II (CA II), a zinc-containing metalloenzyme that reversibly mediates the hydration of carbon dioxide, which maintains acid-base balance in blood and other tissues and helps tissues in the body to eliminate carbon dioxide. CA II has a PID of 1Z9Y and a resolution value of 1.66 Å. Its structure is shown in Figure6.Figure 6
CA II with PID of 1Z9Y.The experimental results are summarized in Table3.Table 3
CA II data classification results.
AlgorithmProtein nameEFAUCBefore samplingSVMCA II5.830.717After samplingRF-SVMCA II6.360.775The comparative results of the experiment are shown in Figure7.Figure 7
Comparative results of experimental data.The stacking of ROC curves and AUC areas in the experimental results can be obtained: the virtual screening results have improved after sampling by sampling, which can verify the effectiveness of the method proposed in this paper. The AUC increased from 0.717 to 0.775, the enrichment factor increased from 5.83 to 6.36, and the accuracy increased from 0.675 to 0.710 when SVM and RF-SVM were used for classification, indicating that the results of RF-SVM for virtual screening of drug proteins were improved.


## 4. Conclusion

In this paper, we studied the traditional molecular docking-based virtual screening technology and pointed out some problems of the present virtual screening methods, such as the accuracy of the scoring function and the data imbalance between inactive compounds and active compounds in docked conformations. In order to further improve the screening quality of the lead compounds from the virtual screening, this paper incorporates machine learning methods into the traditional virtual screening process. In order to solve the problem of imbalanced data in realistic virtual screening process, this paper proposes the preprocessing of active compounds by combining genetic algorithm with SMOTE. The solutions proposed in this paper provide new ideas for the study of actual virtual screening techniques. The main findings of this paper include the following.First, for the situation that the number of active compounds is much less than the number of inactive compounds that occurs in the actual virtual screening process, this paper proposes a preprocessing method to deal with the imbalanced data problem by using a combination of SMOTE algorithm and genetic algorithm to upsample the data of minority class samples to balance the imbalanced dataset by increasing the number of minority class samples. This approach was chosen because the actual number of active compounds in the virtual screening process is very small, and this upsampling approach not only preserves the valid information of the data but also solves the data imbalance problem and avoids overfitting to some extent.Second, in order to improve the quality of the lead compounds in the virtual screening process, this paper introduces the idea of integrated learning into the virtual screening process of drug proteins and proposes the RF-SVM method. The dataset is optimally selected by support vector machine, and then, the selected dataset is used as the data input of random forest. By this way, the insensitivity of random forest to noise can be effectively avoided, thus improving the generalization ability of the classification algorithm. The simulation experiments of virtual screening were performed by two more important target proteins, HIV-1 protease and SRC kinase, and then, the models were validated by CA II, which showed that the EF of these three datasets improved, on average, by about 0.95, all of which can show that the proposed method in this paper is effective for improving the virtual screening method.



---

*Source: 5585990-2021-05-24.xml*