# Prediction of Protein-Protein Interactions with Local Weight-Sharing Mechanism in Deep Learning

Authors: Lei Yang; Yukun Han; Huixue Zhang; Wenlong Li; Yu Dai
Journal: BioMed Research International
 (2020)

---

## Abstract

Protein-protein interactions (PPIs) are important for almost all cellular processes, including metabolic cycles, DNA transcription and replication, and signaling cascades. The experimental methods for identifying PPIs are always time-consuming and expensive. Therefore, it is important to develop computational approaches for predicting PPIs. In this paper, an improved model is proposed to use a machine learning method in the study of protein-protein interactions. With the consideration of the factors affecting the prediction of the PPIs, a method of feature extraction and fusion is proposed to improve the variety of the features to be considered in the prediction. Besides, with the consideration of the effect affected by the different input order of the two proteins, we propose a “Y-type” Bi-RNN model and train the network by using a method which both needs backward and forward training. In order to insure the training time caused on the extra training either a backward one or a forward one, this paper proposes a weight-sharing policy to minimize the parameters in the training. The experimental results show that the proposed method can achieve an accuracy of 99.57%, recall of 99.36%, sensitivity of 99.76%, precision of 99.74%, MCC of 99.14%, and AUC of 99.56% under the benchmark dataset.


---

## Body

## 1. Introduction

Protein plays an important role in the regulation of cell life activities, such as transcriptional regulation and signaling. At present, proteomics research with protein-protein interactions (PPIs) as the main research content is widely used in the field of medical drug target discovery. It is of great significance to promote the development of the biomedical industry.Currently, PPI prediction research mainly uses the following two techniques: (1) experimental methods, including yeast two-hybrid [1, 2], protein chips [3, 4], coimmunoprecipitation [5], and Surface Plasmon Resonance (SPR) [6, 7]; (2) protein information-based computational methods, including protein primary sequence information [8] and spatial structure information of protein secondary structure [9–11]. Compared with the experimental method, the computational method has the advantages of fast verification speed and strong repeatability. Currently, with the development of the machine learning, some methods based on machine learning have been proposed. Currently, when using the machine learning to predict the PPIs, the methods always combine the two sequences of the protein together as the input [12, 13]. However, this may double the length of the feature vector and is prone to an overfitting problem. Besides, either a forward or a backward training method may sometimes overlook the long- and short-term effect which may result in the low prediction accuracy. In addition, the current methods always just consider 7 amino acids which may result in the low diversity of the features and the low accurate prediction performance.In order to improve the prediction accuracy, the protein feature extraction and fusion method based on the combination of discrete wavelet transform and continuous wavelet transform is used to describe the protein amino acid sequence according to eight physicochemical properties of amino acid to improve the variety of the features to be considered in the prediction. Besides, with the consideration of the effect affected by the different input order of the two proteins, we propose a “Y-type” Bi-RNN model and use both the backward and forward training methods to train the model. In addition, in order to insure the training time caused on the extra training either a backward one or a forward one, this paper proposes a weight-sharing policy to minimize the parameters in the training. The experimental results verify that the method can effectively improve the accuracy and precision of the prediction results.The following of the paper is organized as the follows: Section2 introduces the related works of PPIs, Section 3 introduces the data and methods used in experiments, Section 4 introduces the experimental results and comparison with other methods in performance, and Section 5 introduces the conclusion of this paper and future work.


## 2. Related Work

Predicting PPIs using traditional experiments is often expensive and time-consuming, so many computational methods are used to infer PPIs from different sources of information, including phylogenetic profiles, tertiary structures, protein domains, and secondary structures [14, 15]. However, these approaches cannot be employed when prior knowledge about a protein of interest is not available.With the rapid growth of protein sequence data, protein sequence-based prediction methods are becoming the most widely used PPI prediction tool. Therefore, many protein sequence-based methods have been developed to predict PPIs. Bock and Gough [16] used support vector machines (SVM) in conjunction with physicochemical descriptors to predict PPIs, proving that only protein sequence information is valid for predicting PPIs. Shen et al. [17] proposed a method for PPI prediction using only the amino acid sequence information of proteins. The method combines the kernel function and the combined ternary feature to describe the amino acid and obtains an accuracy of 83.90%. In 2010, Yu et al. [18] also used the primary structure of protein alone to deal with protein-protein interactions in unbalanced data. In 2013, You et al. [14] used amino acid sequence information and proposed ensemble extreme learning machines and principal component analysis methods to predict PPIs.However, there are widespread problems of false-positive rate and false-negative rate in the above various experimental methods. In order to solve this problem, the researchers are more committed to the following two aspects to improve the accuracy of the prediction results. On the one hand, the robustness of feature extraction is improved to make the classification model effectively distinguish between positive and negative samples, thereby reducing the false-positive rate and false-negative rate. Thus, the dipeptide composition method [19, 20], the composition transformation distribution description method [21], the quasi-sequence-order descriptor (QSOD) [22], the wavelet transform [23], and other protein feature extraction methods are used in combination, such as the methods proposed by Du et al. [12], An et al. [24], and Huang et al. [25]. On the other hand, researchers hope to increase the complexity of the training model to increase the prediction results. For example, You et al. [26] use a random forest method. Xu et al. [27] used ensemble learning methods to predict PPIs. Li et al. [28] proposed a deep learning method DNN-PPI for CNN and LSTM. Although the above method has achieved certain effects, the training model takes too long, the model is too complicated, and the problem of overfitting the training model is also generated. Ref. [29] is to use the feature extraction and coding. The main work of us is to solve the problem of feature extraction and ensemble to get more appropriate features in order to ensure the accuracy. Besides, our work is to solve the problem of the effect caused by different input orders of the proteins. The extraction and coding method mentioned in the first reference can be used as our future work to improve the efficiency. The work of Ref. [30] takes the sequence of the two proteins as the input of the neural networks and uses a sLSTM to train the model. The work is similar to Li’s work which is also referred in our manuscript. Such works’ problem is that they do not consider the problem caused by the order of the two protein sequences. Ref. [31] adopts a Res2Vec to express the biological sequence and uses DNN to train the model, which also does not consider the relationship between the effect of the prediction and the order of the two protein sequences. But in the future work, we can use the proposed Res2Vec method to express the sequence also in order to avoid the overfitting problem. Ref. [32] is to use the RCNN to automatically select the features while the method does not consider the features in our work. Among the existing models, Wang et al. [13] proposed a method with a better comprehensive performance. They used discrete wavelet transform and continuous wavelet combination to extract protein features and obtained the accuracy of 97.38% under the yeast dataset. However, there are two shortcomings in this method. On the one hand, the method only considers the hydrophobicity of amino acids and regards hydrophobicity as the only property affecting protein interaction, ignoring other properties of amino acids. On the other hand, when using continuous wavelet transform to extract protein features, the time-frequency matrix is treated as an image, and the image is forcibly compressed to 60×60 pixels and then subjected to singular value extraction, thus forcing the compression of the image, which loses some of the information of the time-frequency matrix.In order to improve the prediction accuracy, this paper proposes a feature extraction and fusion method. Besides, with the consideration of the effect affected by the different input order of the two proteins, a “Y-type” Bi-RNN model is proposed which uses both the backward and forward training methods to train the model. In addition, in order to insure the training time, this paper uses a weight-sharing policy to minimize the parameters in the training.


## 3. Materials and Methods

### 3.1. Datasets

#### 3.1.1. Benchmark Dataset

We got the original baseline data from the PPI dataset of PAN: http://http://www.csbio.sjtu.edu.cn/bioinf/LR_PPI/Data.htm[48]. The dataset contains 36,630 pairs of positive samples and 36,480 pairs of negative samples. Positive samples were obtained from the Human Protein Reference Database (HPRD) (2007 version). Negative samples (noninteraction pairs) are produced by paired proteins found at different subcellular locations. After eliminating the protein pairs of more than 1200 residue sequences, the benchmark dataset contains 29071 positive samples and 31496 negative samples. We randomly selected 6000 samples as the retention test set for model validation and the remaining samples as the training set. See Table 1 for details.Table 1
Benchmark dataset.
DatasetPositive samplesNegative samplesTotalBenchmark set290713149660567Training set261282843954567Hold-out test set294330576000


#### 3.1.2. Species Dataset

This paper selects five PPI datasets in the open source DIP database, the Human dataset, theSaccharomyces cerevisiae (S. Cerevisiae) dataset, the Escherichia coli (E. coli) dataset, the Helicobacter pylori (H. pylori) dataset, the Caenorhabditis elegans (C. elegans) dataset, and the Mus musculus (M. musculus) dataset.Human dataset: in this work, the proposed method was verified with a high confidence PPI dataset. We collected this dataset from publicly available database of interacting proteins (DIP https://dip.doe-mbi.ucla.edu/), version 20170205. There are 37027 interactive pairs (positive sets) and 37027 noninteractive pairs (negative sets). The interacting pairs in this dataset were measured by the yeast two-hybrid assay in the DIP database. For the negative dataset, we followed the previous work [13, 27] and assumed that the proteins in different subcellular compartments do not interact with each other [33]. Specifically, the negative dataset was randomly generated from the Swiss-Prot database by excluding protein sequences which met the following conditions: (i) protein sequences without a certain subcellular location, (ii) protein sequences annotated with more than one subcellular location or “fragment” term, and (iii) protein sequences of less than 64 amino acids.The interacting proteins ofS. cerevisiae, E. coli, H. pylori, C. elegans, and M. musculus interacting proteins are derived from the DIP database. Among them, except for the dataset of M. musculus, the negative set generation method is the same as the Human dataset. The M. musculus dataset contains only positive samples for testing. The specific numbers are shown in Table 2.Table 2
Species dataset.
Species datasetPositive samplesNegative samplesTotalHumanOriginal set370273702774054Training set296222962259244Testing set7405740514810S. cerevisiaeOriginal set5943594311886Training set475447549508Testing set118911892378E. coliOriginal set6954695413908Training set5023502310046Testing set193119313862C. elegansOriginal set403040308060Training set322432246448Testing set8068061612H. pyloriOriginal set145814582916Training set111611162332Testing set342342684M. musculusOriginal set22683—22683


### 3.2. Feature Extraction

Traditional feature extraction methods include dipeptide composition methods, composition conversion distribution description methods, and quasi-sequence-order descriptors (QSOD), among which the most commonly used amino acid physicochemical. The properties are hydrophobicH1, hydrophilic H2, side chain residue size V, polarity P1, polarizability P2, solvent accessible surface area SASA, and amino acid side chain net charge number NCI. Many previous studies have proved that it can effectively express protein characteristics. Xu et al. [27] selected the isoelectric point (PI) properties of amino acids for analysis, and the experimental results show that this physicochemical property has an important influence on the polypeptide chain. At the same time, Yu et al. [34] found that the amino acid’s isoelectric point (PI) and ionization equilibrium constant (pKa) properties of the two amino acids can effectively express protein characteristics. Therefore, based on the physicochemical properties of the seven amino acids used in the conventional method, the isoelectric point (PI) and ionization equilibrium constant (pKa) of the amino acid were introduced for characterization. Considering the correlation between PI value and pKa value, this paper combines PI value and pKa value to obtain P value that can comprehensively measure amino acid and further extract protein sequence information according to P value. The specific calculation formula is as formula (1) and (2):
(1)P=PI+u∙pKa,(2)u=∑n−120PIn∑n−120pKan.In summary, the physical and chemical properties of the 20 amino acids are shown in Table3.Table 3
Physicochemical properties of 20 amino acids.
CodeH1H2VP1P2SASANCIPA0.62-0.527.58.10.0461.1810.00718712.772C0.29-144.65.50.1281.461-0.0366110.4312D-0.9340130.1051.587-0.023828.4134E-0.7436212.30.1511.8620.0068029.1455F1.19-2.5115.55.20.292.2280.03755211.6877G0.4800900.8810.17905212.742H-0.4-0.57910.40.232.025-0.0106912.669I1.38-1.893.55.20.1861.810.02163112.5099K-1.5310011.30.2192.2580.01770815.9477L1.06-1.893.54.90.1861.9310.05167212.4699M0.64-1.394.15.70.2212.0340.00268311.6655N-0.78258.711.60.1341.6550.00539211.3355P0.12041.980.1311.4680.23953111.9434Q-0.850.280.710.50.181.9320.04921111.8677R-2.53310510.50.2912.560.04358715.839S-0.180.329.39.20.0621.2980.00462711.8877T-0.05-0.451.38.60.1081.5250.00335212.0855V1.08-1.571.55.90.141.6450.05700412.1677W0.81-3.4145.55.40.4092.6630.03797712.662Y0.26-2.3117.36.20.2982.3680.02359911.8677Next, standardize the above 8 physical and chemical properties according to formula (3):
(3)Pi,j=Pi,j−PjSj,wherein Pi,j represents the jth physicochemical property of the ith amino acid, Pj represents the mean of the jth physicochemical property of 20 amino acids, and Sj represents the standard deviation of the jth physicochemical property of 20 amino acids. Each protein amino acid sequence passes with hydrophobic H1, hydrophilic H2, side chain residue size V, polarity P1, polarizability P2, solvent accessible surface area SASA, amino acid side chain net charge number NCI, and P. The values of these eight attributes are converted into a sequence of numbers.Wang et al. [15] proposed using wavelet to describe protein features and experimentally proved the feasibility of using wavelet transform for protein feature extraction. Discrete wavelet transform (DWT) is an implementation of the wavelet transform that uses discrete wavelet scale sets and translations and decomposes the input signal into mutually orthogonal wavelet sets. In this paper, the Dmeyer wavelet function is used in the discrete wavelet transform part, and Dmeyer is the discrete Meyer wavelet, which is used for the calculation of fast discrete wavelet transform.This paper converts each amino acid sequence into a digital sequence by eight amino acid properties. By applying the DWT on any of these 8 digital sequences of a protein, each sequence-order vector is considered as a discrete time series and will put into one half-band high-pass filter and one half-band low-pass filter; then, the output sequence of the low-pass filter is then iterated four times to finally obtain 5 subsequences. In each subsequence, three kinds of data are extracted to reflect the internal information of the subsequence, which are (1) the average of the wavelet coefficients in each subsequence, (2) the standard deviation of the wavelet coefficients in each subsequence, and (3) the first four values with the largest absolute value in each subsequence and their relative positions; the relative position is calculated as(4)location=mn,where n is the length of the current subsequence and m is the position in the sequence in which the current value is located.In addition, this paper uses a 25-scale mexh continuous wavelet transform to transform each amino acid sequence. The Mexican hat “mexh” wavelet function is the second derivative of the Gauss function, with good regularity, large vanishing moment, and decomposition signal energy concentration. It has localized properties in the time domain and frequency domain. A matrix ofL×25 (L represents the length of the amino acid sequence) can be extracted by the mexh continuous wavelet transform, and the vector features of the 25 dimensions are extracted according to the decomposition of the singular value matrix. Eventually, each protein sequence is converted into a feature vector of 600 dimensions.


### 3.3. Deep Neural Network with Local Weight Sharing

Currently, some works have been proposed to predicting PPIs based on neural networks, such as Du et al. [12] and Li et al. [28]. When using a neural network model to predict protein interactions, you can reduce the impact of protein input order on the prediction result by entering two protein features and training separately. This method of inputting proteins can coordinate protein features and protein interactions. The relationship between the feature characteristics improves the overall prediction result. However, neural network models often require too many training parameters, resulting in redundant training time. In this paper, considering the influence of protein input order on prediction results, a deep neural network with local weight sharing is proposed. The network model adopts a “Y-type” neural network model, including a weight-sharing Bi-RNN layer, a buffer layer, and a dense layer, wherein the weight-sharing Bi-RNN layer can reduce the influence of the protein on the predicted input order and accelerate the training. The weight-sharing Bi-RNN to the same parameter that needs to be learned on the Bi-RNN layer on both sides, that is, the parameter values that need to be learned in the corresponding positions on both sides of the layer, are the same, thereby improving the accuracy of the model prediction result and the model training speed.The neural network model of local weight sharing is shown as Figure1. The input layer is divided into two parts containing 1200 neurons, half of which is for the 600 features of protein A and the other half of which is for the 600 features of protein B. The layer of BI-RNN is also divided into 2 parts, respectively, for proteins a and b. Each part has 2 layers. Each of the layer contains 512 neurons. Then, the total number of neurons in the BI-RNN layer is 512∗2∗2=2048. The next layer is buffer layer whose function is to connect the parts of a and b into the dense layer for training. In the buffer layer, there will be totally 256 neurons for the proteins a and b which means there will be 256 features to be used. The last layer is the dense layer which contains 3 layers with 32, 8, and 2 neurons in each layer, respectively. The layer with 2 neurons is the last layer in the dense layer which is used to output the classification result. Here, the output (1,0) means there exists interaction, and (0,1) otherwise.Figure 1
“Y-type” Bi-RNN model diagram of local weight sharing.This paper uses the ReLU activation function. Since the ReLU activation function will make the output of a part of neurons zero, the network has a certain sparsity, which reduces the interdependence of parameters to a certain extent, and thus effectively avoids overfitting. The ReLU activation function is used in the model, and the ReLU activation function expression is as(5)ReLUx=0,x≤0,x,x>0.RNN can be regarded as a neural network for information transmission in time series. The depth of the model corresponds to the length of the sequence. The gradient disappearance problem that often occurs in the neural network appears correspondingly in the time dimension of the RNN. In order to solve the gradient dispersion problem of RNN in the time dimension, the researchers proposed the long and short memory unit LSTM, which proved that LSTM is very effective in solving long sequence dependence problems. However, since the use of RNN will cause the gradient to disappear, in order to solve this problem, this paper uses Long Short-Term Memory (LSTM) [35, 36]; the neurons are as Figure 2.Figure 2
Schematic diagram of LSTM neurons.LSTM is a variant model of RNN. The parameters of an LSTM neuron include input gate, forgetting gate, output gate, and unit and unit input activation vectors, which are represented byit, ft, ot, and Ct, respectively. The specific expression is as shown in formula (6)–(11), where ht−1 is the output of the previous cell and xt is the input of the current cell. σ represents the sigmoid function.
(6)ft=σWf∙ht−1,xt+bf,(7)it=σWi∙ht−1,xt+bi,(8)C~=tanhWC∙ht−1,xt+bC,(9)Ct=ft×Ct−1+it×Ct~,(10)ot=σWoht−1,xt+bo,(11)ht=ot×tanhCt.


### 3.4. Forward and Backward Model Training

In the construction of protein sequences, the traditional method uses the way of bindingPA=a1,a2,⋯an and PB=b1,b2,⋯bn sequentially to construct PPI characteristics (n represents the number of features described by the protein), as
(12)PPPI=PA⊕PB=a1,a2,⋯an,b1,b2,⋯bn.In view of the problem that the classification model is easy to overfitting and the order of protein feature binding affects the results, this paper proposes a combination of forward and backward protein feature sequences. The improvement based on the training method is based on the use of the above formula to construct the PPI characteristics. On the basis of the training model in the sequential combination, the PPI feature A in the training set is reinversely combined into B and added to the training set, so that the number of training sets of the training sample reconstruction is doubled and the number of test sets remains the same, as shown in Figure3.Figure 3
Schematic diagram of forward and backward model training process.Every protein interaction data record can be expressed asa1,a2,⋯a600,b1,b2,⋯b600l1,l2, where a represents the features of protein A, b represents the features of protein B, and (l1,l2) represents the label. The data of the labels are (1,0) and (0,1). (1,0) indicates that there exists an interaction relationship, and (0,1) means not. In the environment of python3.5, TensorFlow1.12.0 can be used to build a neural network according to the method in the paper. The batch_size is set to 128, learning_rate is set to 0.05, and trains are set for 200 rounds.


## 3.1. Datasets

### 3.1.1. Benchmark Dataset

We got the original baseline data from the PPI dataset of PAN: http://http://www.csbio.sjtu.edu.cn/bioinf/LR_PPI/Data.htm[48]. The dataset contains 36,630 pairs of positive samples and 36,480 pairs of negative samples. Positive samples were obtained from the Human Protein Reference Database (HPRD) (2007 version). Negative samples (noninteraction pairs) are produced by paired proteins found at different subcellular locations. After eliminating the protein pairs of more than 1200 residue sequences, the benchmark dataset contains 29071 positive samples and 31496 negative samples. We randomly selected 6000 samples as the retention test set for model validation and the remaining samples as the training set. See Table 1 for details.Table 1
Benchmark dataset.
DatasetPositive samplesNegative samplesTotalBenchmark set290713149660567Training set261282843954567Hold-out test set294330576000


### 3.1.2. Species Dataset

This paper selects five PPI datasets in the open source DIP database, the Human dataset, theSaccharomyces cerevisiae (S. Cerevisiae) dataset, the Escherichia coli (E. coli) dataset, the Helicobacter pylori (H. pylori) dataset, the Caenorhabditis elegans (C. elegans) dataset, and the Mus musculus (M. musculus) dataset.Human dataset: in this work, the proposed method was verified with a high confidence PPI dataset. We collected this dataset from publicly available database of interacting proteins (DIP https://dip.doe-mbi.ucla.edu/), version 20170205. There are 37027 interactive pairs (positive sets) and 37027 noninteractive pairs (negative sets). The interacting pairs in this dataset were measured by the yeast two-hybrid assay in the DIP database. For the negative dataset, we followed the previous work [13, 27] and assumed that the proteins in different subcellular compartments do not interact with each other [33]. Specifically, the negative dataset was randomly generated from the Swiss-Prot database by excluding protein sequences which met the following conditions: (i) protein sequences without a certain subcellular location, (ii) protein sequences annotated with more than one subcellular location or “fragment” term, and (iii) protein sequences of less than 64 amino acids.The interacting proteins ofS. cerevisiae, E. coli, H. pylori, C. elegans, and M. musculus interacting proteins are derived from the DIP database. Among them, except for the dataset of M. musculus, the negative set generation method is the same as the Human dataset. The M. musculus dataset contains only positive samples for testing. The specific numbers are shown in Table 2.Table 2
Species dataset.
Species datasetPositive samplesNegative samplesTotalHumanOriginal set370273702774054Training set296222962259244Testing set7405740514810S. cerevisiaeOriginal set5943594311886Training set475447549508Testing set118911892378E. coliOriginal set6954695413908Training set5023502310046Testing set193119313862C. elegansOriginal set403040308060Training set322432246448Testing set8068061612H. pyloriOriginal set145814582916Training set111611162332Testing set342342684M. musculusOriginal set22683—22683


## 3.1.1. Benchmark Dataset

We got the original baseline data from the PPI dataset of PAN: http://http://www.csbio.sjtu.edu.cn/bioinf/LR_PPI/Data.htm[48]. The dataset contains 36,630 pairs of positive samples and 36,480 pairs of negative samples. Positive samples were obtained from the Human Protein Reference Database (HPRD) (2007 version). Negative samples (noninteraction pairs) are produced by paired proteins found at different subcellular locations. After eliminating the protein pairs of more than 1200 residue sequences, the benchmark dataset contains 29071 positive samples and 31496 negative samples. We randomly selected 6000 samples as the retention test set for model validation and the remaining samples as the training set. See Table 1 for details.Table 1
Benchmark dataset.
DatasetPositive samplesNegative samplesTotalBenchmark set290713149660567Training set261282843954567Hold-out test set294330576000


## 3.1.2. Species Dataset

This paper selects five PPI datasets in the open source DIP database, the Human dataset, theSaccharomyces cerevisiae (S. Cerevisiae) dataset, the Escherichia coli (E. coli) dataset, the Helicobacter pylori (H. pylori) dataset, the Caenorhabditis elegans (C. elegans) dataset, and the Mus musculus (M. musculus) dataset.Human dataset: in this work, the proposed method was verified with a high confidence PPI dataset. We collected this dataset from publicly available database of interacting proteins (DIP https://dip.doe-mbi.ucla.edu/), version 20170205. There are 37027 interactive pairs (positive sets) and 37027 noninteractive pairs (negative sets). The interacting pairs in this dataset were measured by the yeast two-hybrid assay in the DIP database. For the negative dataset, we followed the previous work [13, 27] and assumed that the proteins in different subcellular compartments do not interact with each other [33]. Specifically, the negative dataset was randomly generated from the Swiss-Prot database by excluding protein sequences which met the following conditions: (i) protein sequences without a certain subcellular location, (ii) protein sequences annotated with more than one subcellular location or “fragment” term, and (iii) protein sequences of less than 64 amino acids.The interacting proteins ofS. cerevisiae, E. coli, H. pylori, C. elegans, and M. musculus interacting proteins are derived from the DIP database. Among them, except for the dataset of M. musculus, the negative set generation method is the same as the Human dataset. The M. musculus dataset contains only positive samples for testing. The specific numbers are shown in Table 2.Table 2
Species dataset.
Species datasetPositive samplesNegative samplesTotalHumanOriginal set370273702774054Training set296222962259244Testing set7405740514810S. cerevisiaeOriginal set5943594311886Training set475447549508Testing set118911892378E. coliOriginal set6954695413908Training set5023502310046Testing set193119313862C. elegansOriginal set403040308060Training set322432246448Testing set8068061612H. pyloriOriginal set145814582916Training set111611162332Testing set342342684M. musculusOriginal set22683—22683


## 3.2. Feature Extraction

Traditional feature extraction methods include dipeptide composition methods, composition conversion distribution description methods, and quasi-sequence-order descriptors (QSOD), among which the most commonly used amino acid physicochemical. The properties are hydrophobicH1, hydrophilic H2, side chain residue size V, polarity P1, polarizability P2, solvent accessible surface area SASA, and amino acid side chain net charge number NCI. Many previous studies have proved that it can effectively express protein characteristics. Xu et al. [27] selected the isoelectric point (PI) properties of amino acids for analysis, and the experimental results show that this physicochemical property has an important influence on the polypeptide chain. At the same time, Yu et al. [34] found that the amino acid’s isoelectric point (PI) and ionization equilibrium constant (pKa) properties of the two amino acids can effectively express protein characteristics. Therefore, based on the physicochemical properties of the seven amino acids used in the conventional method, the isoelectric point (PI) and ionization equilibrium constant (pKa) of the amino acid were introduced for characterization. Considering the correlation between PI value and pKa value, this paper combines PI value and pKa value to obtain P value that can comprehensively measure amino acid and further extract protein sequence information according to P value. The specific calculation formula is as formula (1) and (2):
(1)P=PI+u∙pKa,(2)u=∑n−120PIn∑n−120pKan.In summary, the physical and chemical properties of the 20 amino acids are shown in Table3.Table 3
Physicochemical properties of 20 amino acids.
CodeH1H2VP1P2SASANCIPA0.62-0.527.58.10.0461.1810.00718712.772C0.29-144.65.50.1281.461-0.0366110.4312D-0.9340130.1051.587-0.023828.4134E-0.7436212.30.1511.8620.0068029.1455F1.19-2.5115.55.20.292.2280.03755211.6877G0.4800900.8810.17905212.742H-0.4-0.57910.40.232.025-0.0106912.669I1.38-1.893.55.20.1861.810.02163112.5099K-1.5310011.30.2192.2580.01770815.9477L1.06-1.893.54.90.1861.9310.05167212.4699M0.64-1.394.15.70.2212.0340.00268311.6655N-0.78258.711.60.1341.6550.00539211.3355P0.12041.980.1311.4680.23953111.9434Q-0.850.280.710.50.181.9320.04921111.8677R-2.53310510.50.2912.560.04358715.839S-0.180.329.39.20.0621.2980.00462711.8877T-0.05-0.451.38.60.1081.5250.00335212.0855V1.08-1.571.55.90.141.6450.05700412.1677W0.81-3.4145.55.40.4092.6630.03797712.662Y0.26-2.3117.36.20.2982.3680.02359911.8677Next, standardize the above 8 physical and chemical properties according to formula (3):
(3)Pi,j=Pi,j−PjSj,wherein Pi,j represents the jth physicochemical property of the ith amino acid, Pj represents the mean of the jth physicochemical property of 20 amino acids, and Sj represents the standard deviation of the jth physicochemical property of 20 amino acids. Each protein amino acid sequence passes with hydrophobic H1, hydrophilic H2, side chain residue size V, polarity P1, polarizability P2, solvent accessible surface area SASA, amino acid side chain net charge number NCI, and P. The values of these eight attributes are converted into a sequence of numbers.Wang et al. [15] proposed using wavelet to describe protein features and experimentally proved the feasibility of using wavelet transform for protein feature extraction. Discrete wavelet transform (DWT) is an implementation of the wavelet transform that uses discrete wavelet scale sets and translations and decomposes the input signal into mutually orthogonal wavelet sets. In this paper, the Dmeyer wavelet function is used in the discrete wavelet transform part, and Dmeyer is the discrete Meyer wavelet, which is used for the calculation of fast discrete wavelet transform.This paper converts each amino acid sequence into a digital sequence by eight amino acid properties. By applying the DWT on any of these 8 digital sequences of a protein, each sequence-order vector is considered as a discrete time series and will put into one half-band high-pass filter and one half-band low-pass filter; then, the output sequence of the low-pass filter is then iterated four times to finally obtain 5 subsequences. In each subsequence, three kinds of data are extracted to reflect the internal information of the subsequence, which are (1) the average of the wavelet coefficients in each subsequence, (2) the standard deviation of the wavelet coefficients in each subsequence, and (3) the first four values with the largest absolute value in each subsequence and their relative positions; the relative position is calculated as(4)location=mn,where n is the length of the current subsequence and m is the position in the sequence in which the current value is located.In addition, this paper uses a 25-scale mexh continuous wavelet transform to transform each amino acid sequence. The Mexican hat “mexh” wavelet function is the second derivative of the Gauss function, with good regularity, large vanishing moment, and decomposition signal energy concentration. It has localized properties in the time domain and frequency domain. A matrix ofL×25 (L represents the length of the amino acid sequence) can be extracted by the mexh continuous wavelet transform, and the vector features of the 25 dimensions are extracted according to the decomposition of the singular value matrix. Eventually, each protein sequence is converted into a feature vector of 600 dimensions.


## 3.3. Deep Neural Network with Local Weight Sharing

Currently, some works have been proposed to predicting PPIs based on neural networks, such as Du et al. [12] and Li et al. [28]. When using a neural network model to predict protein interactions, you can reduce the impact of protein input order on the prediction result by entering two protein features and training separately. This method of inputting proteins can coordinate protein features and protein interactions. The relationship between the feature characteristics improves the overall prediction result. However, neural network models often require too many training parameters, resulting in redundant training time. In this paper, considering the influence of protein input order on prediction results, a deep neural network with local weight sharing is proposed. The network model adopts a “Y-type” neural network model, including a weight-sharing Bi-RNN layer, a buffer layer, and a dense layer, wherein the weight-sharing Bi-RNN layer can reduce the influence of the protein on the predicted input order and accelerate the training. The weight-sharing Bi-RNN to the same parameter that needs to be learned on the Bi-RNN layer on both sides, that is, the parameter values that need to be learned in the corresponding positions on both sides of the layer, are the same, thereby improving the accuracy of the model prediction result and the model training speed.The neural network model of local weight sharing is shown as Figure1. The input layer is divided into two parts containing 1200 neurons, half of which is for the 600 features of protein A and the other half of which is for the 600 features of protein B. The layer of BI-RNN is also divided into 2 parts, respectively, for proteins a and b. Each part has 2 layers. Each of the layer contains 512 neurons. Then, the total number of neurons in the BI-RNN layer is 512∗2∗2=2048. The next layer is buffer layer whose function is to connect the parts of a and b into the dense layer for training. In the buffer layer, there will be totally 256 neurons for the proteins a and b which means there will be 256 features to be used. The last layer is the dense layer which contains 3 layers with 32, 8, and 2 neurons in each layer, respectively. The layer with 2 neurons is the last layer in the dense layer which is used to output the classification result. Here, the output (1,0) means there exists interaction, and (0,1) otherwise.Figure 1
“Y-type” Bi-RNN model diagram of local weight sharing.This paper uses the ReLU activation function. Since the ReLU activation function will make the output of a part of neurons zero, the network has a certain sparsity, which reduces the interdependence of parameters to a certain extent, and thus effectively avoids overfitting. The ReLU activation function is used in the model, and the ReLU activation function expression is as(5)ReLUx=0,x≤0,x,x>0.RNN can be regarded as a neural network for information transmission in time series. The depth of the model corresponds to the length of the sequence. The gradient disappearance problem that often occurs in the neural network appears correspondingly in the time dimension of the RNN. In order to solve the gradient dispersion problem of RNN in the time dimension, the researchers proposed the long and short memory unit LSTM, which proved that LSTM is very effective in solving long sequence dependence problems. However, since the use of RNN will cause the gradient to disappear, in order to solve this problem, this paper uses Long Short-Term Memory (LSTM) [35, 36]; the neurons are as Figure 2.Figure 2
Schematic diagram of LSTM neurons.LSTM is a variant model of RNN. The parameters of an LSTM neuron include input gate, forgetting gate, output gate, and unit and unit input activation vectors, which are represented byit, ft, ot, and Ct, respectively. The specific expression is as shown in formula (6)–(11), where ht−1 is the output of the previous cell and xt is the input of the current cell. σ represents the sigmoid function.
(6)ft=σWf∙ht−1,xt+bf,(7)it=σWi∙ht−1,xt+bi,(8)C~=tanhWC∙ht−1,xt+bC,(9)Ct=ft×Ct−1+it×Ct~,(10)ot=σWoht−1,xt+bo,(11)ht=ot×tanhCt.


## 3.4. Forward and Backward Model Training

In the construction of protein sequences, the traditional method uses the way of bindingPA=a1,a2,⋯an and PB=b1,b2,⋯bn sequentially to construct PPI characteristics (n represents the number of features described by the protein), as
(12)PPPI=PA⊕PB=a1,a2,⋯an,b1,b2,⋯bn.In view of the problem that the classification model is easy to overfitting and the order of protein feature binding affects the results, this paper proposes a combination of forward and backward protein feature sequences. The improvement based on the training method is based on the use of the above formula to construct the PPI characteristics. On the basis of the training model in the sequential combination, the PPI feature A in the training set is reinversely combined into B and added to the training set, so that the number of training sets of the training sample reconstruction is doubled and the number of test sets remains the same, as shown in Figure3.Figure 3
Schematic diagram of forward and backward model training process.Every protein interaction data record can be expressed asa1,a2,⋯a600,b1,b2,⋯b600l1,l2, where a represents the features of protein A, b represents the features of protein B, and (l1,l2) represents the label. The data of the labels are (1,0) and (0,1). (1,0) indicates that there exists an interaction relationship, and (0,1) means not. In the environment of python3.5, TensorFlow1.12.0 can be used to build a neural network according to the method in the paper. The batch_size is set to 128, learning_rate is set to 0.05, and trains are set for 200 rounds.


## 4. Experimental Results and Comparison

### 4.1. Evaluation Measures

In this experiment, we used a fivefold cross-validation process to prevent the calculation method from overfitting on the dataset or misjudging the result due to unbalanced data extraction. The evaluation criteria for the algorithm use several widely used parameters: accuracy, recall, specificity, precision, and MCC (Mathew’s correlation coefficient). Some of the above parameters are defined as formula (13)–(17):
(13)Accuracy=TP+TNTP+TN+FP+FN,(14)Recall=TPTP+FN,(15)Specificity=TNTN+FP,(16)Precision=TPTP+FP,(17)MCC=TP×TN−FP×FNTP+FPTP+FNTN+FPTN+FN,where the true-positive (TP) value denotes the number of true samples which are predicted correctly; the false-negative (FN) value is the number of true samples predicted to be noninteracting pairs incorrectly; the false-positive (FP) value is the number of true noninteracting pairs predicted to be PPIs falsely; and the true-negative (TN) value is the number of true noninteracting pairs predicted correctly.


### 4.2. Training and Validation on the Benchmark Dataset

We randomly divide the training set into five sets by fivefold cross-validation, and cross-train. Finally, the best performance model is tested under the hold-out test set. The specific data are shown in Table4. We can see that the accuracy of the fivefold cross-validation is almost the same. For testing the hold-out set, the model for test set 2 is used which achieved an accuracy of 99.57%, recall of 99.36%, sensitivity of 99.76%, precision of 99.74%, MCC of 99.14%, and AUC of 99.56%.Table 4
Performances of deep neural network with local weight sharing.
Test setAccuracy (%)Recall (%)Sensitivity (%)Precision (%)MCC (%)AUC (%)199.8899.8799.8899.8799.7599.88299.8899.75100.00100.0099.7599.87399.5799.2199.8899.8799.1499.55499.8899.1399.8899.8799.0299.50599.8299.62100.00100.0099.6399.81Hold-out99.5799.3699.7699.7499.1499.56To further confirm the effectiveness of the model, we compare the experimental results by constantly switching the ratio of training set to test set, as shown in Table5. We can see that the model can maintain a robust effect in different proportions.Table 5
Performances with different proportions of training and testing sets.
Train/testAccuracy (%)Recall (%)Sensitivity (%)Precision (%)MCC (%)AUC (%)0.3/0.799.7199.0799.8499.8398.9499.460.25/0.7599.95100.0099.9099.9099.9099.950.2/0.899.8899.8799.8899.8799.7599.880.1/0.999.7599.49100.00100.0099.5199.74


### 4.3. Multispecies Training Evaluation

To further explore the validity of the model, we used the same method to conduct experiments on different species datasets. Similarly, the training sets of each species were randomly divided into five sets for cross-training, and the best model was selected for testing. Table6 shows the results. In each training set, the performance remains robustness, and the data fluctuation does not exceed 1%. Finally, we can see that the accuracy in E. coli, C. elegans, S. cerevisiae, and human is 95.04%, 98.14%, 99.96%, and 99.94%, respectively.Table 6
Performance comparisons on datasets for other species.
SpeciesTest setAccuracy (%)Recall (%)Sensitivity (%)Precision (%)MCC (%)AUC (%)E. coli195.2991.2299.3599.2990.8895.29295.4091.6599.1499.0791.0595.39395.4091.9498.8598.7691.0195.39495.0490.7199.3599.2990.4195.03595.2291.0799.3599.2990.7595.21Hold-out95.0490.7199.3599.2990.4195.03C. elegans198.3396.8199.7699.7496.6898.28298.2096.5699.7699.7496.4498.16398.1496.4399.7699.7496.3298.09498.3397.1999.4099.3596.6798.30598.4597.3299.5299.4896.9298.42Hold-out98.1496.8199.4099.3596.3098.10S. cerevisiae199.9499.83100.00100.0099.8799.92299.9999.97100.00100.0099.9899.99399.8899.8399.9199.8399.7499.87499.9999.97100.00100.0099.9899.99599.9699.9299.9899.9799.9199.95Hold-out99.8699.61100.00100.0099.7099.80Human199.9399.8899.9799.9799.8599.93299.9299.8699.9799.9799.8499.92399.8799.8499.9199.9099.7499.87499.8999.8499.9399.9399.7799.88599.8699.8299.9199.9099.7399.86Hold-out99.9499.88100.00100.0099.8899.94


### 4.4. Compare the Performance of Feature Extraction and Fusion

In order to verify the feature extraction and fusion, under the same dataset, compare the performance of the feature extraction and fusion in our work and the works (signified as AC) which uses the amino acid composition based on position information to extract the features, as well as the works (signified as WT) which uses the feature extraction method based on multiattribute wavelet transform. For just comparing the performance of the feature extraction and fusion, we use the SVM classifier to train the model. The result can be seen in Figure4. From the result, we can see that our work has a higher accuracy than others.Figure 4
Experimental results of different feature extraction and fusion methods in a support vector machine.


### 4.5. Comparison with Other Methods

In this section, we compare the performance of the proposed method with other different methods, by using the S. cerevisiae dataset, as shown in Table7. We can see that in the counterpart methods, the accuracy is between 83.35% and 98.78%, most of them have exceeded 90%, and the highest accuracy rate is 98.78%. Compared with our method, except that precision in Ref. [28], the other attributes are higher than other methods, the minimum difference of accuracy is 1.16%, the minimum difference of sensitivity is 1.72%, the minimum difference of precision is 0%, and the minimum difference of MCC is 1.29%.Table 7
Comparison with other methods.
MethodAccuracy (%)Sensitivity (%)Precision (%)MCC (%)Our work99.5799.7699.7499.14Work in Ref. [28]98.7898.2398.6197.57Work in Ref. [13]97.3894.76100.0094.89Work in Ref. [12]94.4396.6594.3888.97Work in Ref. [26]93.9291.1096.4588.56Work in Ref. [24]92.6592.6392.6786.40Work in Ref. [25]92.0588.8295.8786.09Work in Ref. [36]89.3388.8789.93N/AWork in Ref. [27]83.3592.9583.3263.77


### 4.6. Comparison Time Performance with Other Deep Learning Methods

Based on the same machine configuration, this paper also compares the training time required for different training models. Table8 lists the comparison of the training time required between different algorithms. It can be seen that the training time of the partial-input two-way cyclic neural network shared by local weights is almost the same as that of the five-layer fully connected neural network under the same-order neurons. At the same time, compared with the DeepPPI training model proposed by Du et al. [12], the training speed is increased by 70 seconds, which is 251 seconds higher than that of the deep neural network without local weight sharing.Table 8
Comparison time performance with other deep learning methods.
MethodOur work5-layer fully connected neural networkDeepPPI [12]Deep neural network without local weight sharingTime (seconds)312309382563


### 4.7. Training Other Models by Using the Features of Forward and Backward Reconstruction

The experimental results are shown in Table9. We can see that the training methods based on the characteristics of forward and backward training can improve the performance of Xu’s method which can improve the accuracy by 1.26%, recall by 1.98%, sensitivity by 0.99%, precision by 2.13%, and MCC by 2.91%.Table 9
Training other models by using the features of forward and backward reconstruction.
MethodTest setAccuracy (%)Recall (%)Sensitivity (%)Precision (%)MCC (%)Xu et al.’s work [27]184.7767.5094.0685.9565.78284.8867.5394.0485.6865.78384.8867.6894.5385.3365.47484.8568.0193.6584.8565.56584.5766.4194.0785.4264.93Average84.7967.4394.0785.4565.50Average before improvement83.3565.45%92.9583.3263.77


### 4.8. Cross-Species Cross-Validation Evaluation

According to Table10, we can see that when the training set is human, the test results are better, most of which are more than 90 percent. However, other species can only play a certain role in the M. musculus dataset for testing. For data analysis, since human datasets are almost the sum of other kinds of datasets, robust models can be effectively trained. The best is 98.39%.Table 10
Performances on the cross-species validations.
Training setTest setAccuracy (%)HumanM. musculus98.39C. elegans95.75S. cerevisiae91.11H. pylori86.15E. coli50.20C. elegansM. musculus96.23S. cerevisiae55.00H. pylori52.97E. coli50.19Human49.72S. cerevisiaeM. musculus97.23C. elegans55.32E. coli51.19Human49.72H. pylori65.97E. coliM. musculus95.23C. elegans51.66S. cerevisiae50.24Human44.12H. pylori43.81


## 4.1. Evaluation Measures

In this experiment, we used a fivefold cross-validation process to prevent the calculation method from overfitting on the dataset or misjudging the result due to unbalanced data extraction. The evaluation criteria for the algorithm use several widely used parameters: accuracy, recall, specificity, precision, and MCC (Mathew’s correlation coefficient). Some of the above parameters are defined as formula (13)–(17):
(13)Accuracy=TP+TNTP+TN+FP+FN,(14)Recall=TPTP+FN,(15)Specificity=TNTN+FP,(16)Precision=TPTP+FP,(17)MCC=TP×TN−FP×FNTP+FPTP+FNTN+FPTN+FN,where the true-positive (TP) value denotes the number of true samples which are predicted correctly; the false-negative (FN) value is the number of true samples predicted to be noninteracting pairs incorrectly; the false-positive (FP) value is the number of true noninteracting pairs predicted to be PPIs falsely; and the true-negative (TN) value is the number of true noninteracting pairs predicted correctly.


## 4.2. Training and Validation on the Benchmark Dataset

We randomly divide the training set into five sets by fivefold cross-validation, and cross-train. Finally, the best performance model is tested under the hold-out test set. The specific data are shown in Table4. We can see that the accuracy of the fivefold cross-validation is almost the same. For testing the hold-out set, the model for test set 2 is used which achieved an accuracy of 99.57%, recall of 99.36%, sensitivity of 99.76%, precision of 99.74%, MCC of 99.14%, and AUC of 99.56%.Table 4
Performances of deep neural network with local weight sharing.
Test setAccuracy (%)Recall (%)Sensitivity (%)Precision (%)MCC (%)AUC (%)199.8899.8799.8899.8799.7599.88299.8899.75100.00100.0099.7599.87399.5799.2199.8899.8799.1499.55499.8899.1399.8899.8799.0299.50599.8299.62100.00100.0099.6399.81Hold-out99.5799.3699.7699.7499.1499.56To further confirm the effectiveness of the model, we compare the experimental results by constantly switching the ratio of training set to test set, as shown in Table5. We can see that the model can maintain a robust effect in different proportions.Table 5
Performances with different proportions of training and testing sets.
Train/testAccuracy (%)Recall (%)Sensitivity (%)Precision (%)MCC (%)AUC (%)0.3/0.799.7199.0799.8499.8398.9499.460.25/0.7599.95100.0099.9099.9099.9099.950.2/0.899.8899.8799.8899.8799.7599.880.1/0.999.7599.49100.00100.0099.5199.74


## 4.3. Multispecies Training Evaluation

To further explore the validity of the model, we used the same method to conduct experiments on different species datasets. Similarly, the training sets of each species were randomly divided into five sets for cross-training, and the best model was selected for testing. Table6 shows the results. In each training set, the performance remains robustness, and the data fluctuation does not exceed 1%. Finally, we can see that the accuracy in E. coli, C. elegans, S. cerevisiae, and human is 95.04%, 98.14%, 99.96%, and 99.94%, respectively.Table 6
Performance comparisons on datasets for other species.
SpeciesTest setAccuracy (%)Recall (%)Sensitivity (%)Precision (%)MCC (%)AUC (%)E. coli195.2991.2299.3599.2990.8895.29295.4091.6599.1499.0791.0595.39395.4091.9498.8598.7691.0195.39495.0490.7199.3599.2990.4195.03595.2291.0799.3599.2990.7595.21Hold-out95.0490.7199.3599.2990.4195.03C. elegans198.3396.8199.7699.7496.6898.28298.2096.5699.7699.7496.4498.16398.1496.4399.7699.7496.3298.09498.3397.1999.4099.3596.6798.30598.4597.3299.5299.4896.9298.42Hold-out98.1496.8199.4099.3596.3098.10S. cerevisiae199.9499.83100.00100.0099.8799.92299.9999.97100.00100.0099.9899.99399.8899.8399.9199.8399.7499.87499.9999.97100.00100.0099.9899.99599.9699.9299.9899.9799.9199.95Hold-out99.8699.61100.00100.0099.7099.80Human199.9399.8899.9799.9799.8599.93299.9299.8699.9799.9799.8499.92399.8799.8499.9199.9099.7499.87499.8999.8499.9399.9399.7799.88599.8699.8299.9199.9099.7399.86Hold-out99.9499.88100.00100.0099.8899.94


## 4.4. Compare the Performance of Feature Extraction and Fusion

In order to verify the feature extraction and fusion, under the same dataset, compare the performance of the feature extraction and fusion in our work and the works (signified as AC) which uses the amino acid composition based on position information to extract the features, as well as the works (signified as WT) which uses the feature extraction method based on multiattribute wavelet transform. For just comparing the performance of the feature extraction and fusion, we use the SVM classifier to train the model. The result can be seen in Figure4. From the result, we can see that our work has a higher accuracy than others.Figure 4
Experimental results of different feature extraction and fusion methods in a support vector machine.


## 4.5. Comparison with Other Methods

In this section, we compare the performance of the proposed method with other different methods, by using the S. cerevisiae dataset, as shown in Table7. We can see that in the counterpart methods, the accuracy is between 83.35% and 98.78%, most of them have exceeded 90%, and the highest accuracy rate is 98.78%. Compared with our method, except that precision in Ref. [28], the other attributes are higher than other methods, the minimum difference of accuracy is 1.16%, the minimum difference of sensitivity is 1.72%, the minimum difference of precision is 0%, and the minimum difference of MCC is 1.29%.Table 7
Comparison with other methods.
MethodAccuracy (%)Sensitivity (%)Precision (%)MCC (%)Our work99.5799.7699.7499.14Work in Ref. [28]98.7898.2398.6197.57Work in Ref. [13]97.3894.76100.0094.89Work in Ref. [12]94.4396.6594.3888.97Work in Ref. [26]93.9291.1096.4588.56Work in Ref. [24]92.6592.6392.6786.40Work in Ref. [25]92.0588.8295.8786.09Work in Ref. [36]89.3388.8789.93N/AWork in Ref. [27]83.3592.9583.3263.77


## 4.6. Comparison Time Performance with Other Deep Learning Methods

Based on the same machine configuration, this paper also compares the training time required for different training models. Table8 lists the comparison of the training time required between different algorithms. It can be seen that the training time of the partial-input two-way cyclic neural network shared by local weights is almost the same as that of the five-layer fully connected neural network under the same-order neurons. At the same time, compared with the DeepPPI training model proposed by Du et al. [12], the training speed is increased by 70 seconds, which is 251 seconds higher than that of the deep neural network without local weight sharing.Table 8
Comparison time performance with other deep learning methods.
MethodOur work5-layer fully connected neural networkDeepPPI [12]Deep neural network without local weight sharingTime (seconds)312309382563


## 4.7. Training Other Models by Using the Features of Forward and Backward Reconstruction

The experimental results are shown in Table9. We can see that the training methods based on the characteristics of forward and backward training can improve the performance of Xu’s method which can improve the accuracy by 1.26%, recall by 1.98%, sensitivity by 0.99%, precision by 2.13%, and MCC by 2.91%.Table 9
Training other models by using the features of forward and backward reconstruction.
MethodTest setAccuracy (%)Recall (%)Sensitivity (%)Precision (%)MCC (%)Xu et al.’s work [27]184.7767.5094.0685.9565.78284.8867.5394.0485.6865.78384.8867.6894.5385.3365.47484.8568.0193.6584.8565.56584.5766.4194.0785.4264.93Average84.7967.4394.0785.4565.50Average before improvement83.3565.45%92.9583.3263.77


## 4.8. Cross-Species Cross-Validation Evaluation

According to Table10, we can see that when the training set is human, the test results are better, most of which are more than 90 percent. However, other species can only play a certain role in the M. musculus dataset for testing. For data analysis, since human datasets are almost the sum of other kinds of datasets, robust models can be effectively trained. The best is 98.39%.Table 10
Performances on the cross-species validations.
Training setTest setAccuracy (%)HumanM. musculus98.39C. elegans95.75S. cerevisiae91.11H. pylori86.15E. coli50.20C. elegansM. musculus96.23S. cerevisiae55.00H. pylori52.97E. coli50.19Human49.72S. cerevisiaeM. musculus97.23C. elegans55.32E. coli51.19Human49.72H. pylori65.97E. coliM. musculus95.23C. elegans51.66S. cerevisiae50.24Human44.12H. pylori43.81


## 5. Conclusion and Future Work

The protein feature extraction and fusion method based on the combination of discrete wavelet transform and continuous wavelet transform is used to describe the protein amino acid sequence to improve the variety of the features to be considered in the prediction. When constructing protein interaction features, the common method is to directly combine the two protein features in sequence. However, this method of constructing interaction features doubles the length of the feature vector, which is likely to cause overfitting under limited protein interaction datasets. At the same time, because two interacting protein features are equally important, constructing mutual features of proteins is likely to result in different predictions due to different binding sequences. In this paper, based on the use of sequential binding protein features, the forward and backward model training methods are proposed to address this issue. Besides, a weight-sharing policy is proposed to minimize the parameters in the training in order to insure the training time. This paper defines protein interactions as a binary classification problem. In the future, we can consider whether the problem can be mapped to a multiclassification problem where the prediction result can be a certain type of interaction. Besides, currently, expressing the sequence by using an appropriate way can be used to solve the overfitting problem. Then, in the future, the coding method for expressing the features will be studied.



---

*Source: 5072520-2020-06-15.xml*