 Methodology Article
 Open Access
 Published:
PESM: predicting the essentiality of miRNAs based on gradient boosting machines and sequences
BMC Bioinformatics volume 21, Article number: 111 (2020)
Abstract
Background
MicroRNAs (miRNAs) are a kind of small noncoding RNA molecules that are direct posttranscriptional regulations of mRNA targets. Studies have indicated that miRNAs play key roles in complex diseases by taking part in many biological processes, such as cell growth, cell death and so on. Therefore, in order to improve the effectiveness of disease diagnosis and treatment, it is appealing to develop advanced computational methods for predicting the essentiality of miRNAs.
Result
In this study, we propose a method (PESM) to predict the miRNA essentiality based on gradient boosting machines and miRNA sequences. First, PESM extracts the sequence and structural features of miRNAs. Then it uses gradient boosting machines to predict the essentiality of miRNAs. We conduct the 5fold crossvalidation to assess the prediction performance of our method. The area under the receiver operating characteristic curve (AUC), Fmeasure and accuracy (ACC) are used as the metrics to evaluate the prediction performance. We also compare PESM with other three competing methods which include miES, Gaussian Naive Bayes and Support Vector Machine.
Conclusion
The results of experiments show that PESM achieves the better prediction performance (AUC: 0.9117, Fmeasure: 0.8572, ACC: 0.8516) than other three computing methods. In addition, the relative importance of all features also further shows that newly added features can be helpful to improve the prediction performance of methods.
Background
MicroRNAs (miRNAs) are small noncoding RNAs with a length of 22 nucleotides, which are processed from stemloop regions of longer RNA transcripts [1]. They bind to the 3’ untranslated regions (UTRs) of target mRNAs by sequencespecific base pairing to regulate the gene expression at the posttranscriptional level [2, 3]. Studies have shown that miRNAs play crucial roles in many biological processes, such as cell differentiation, growth, immune reaction and death, thereby leading to a variety of diseases [4, 5]. For example, miR285p and miR283p are downregulated in colorectal cancer (CRC) samples compared with normal colon samples [6]. Members of the let7 family of microRNAs were significantly downregulated in primary melanomas, and the anchorageindependent growth of melanoma cells are also inhibited by let7b [7]. The poor clinical features in gastric cancer are associated with the low levels of miR34b and miR129 expression [8]. The incidence of lymphoma is regulated by the overexpression of miRNA hsamir451a [9, 10]. Furthermore, after knocking out one or more members of a very broadly conserved miRNA family, some abnormal phenotypes are observed [11]. For example, as paralogous proteins, members of the same seed families often have at least partially redundant functions, with severe lossoffunction phenotypes apparent only after multiple family members are disrupted, which includes mmumir22 [12], mmumir29 [13].
In order to systematically understand the associated mechanisms between miRNAs and diseases, some databases have been constructed, such as HMDD [14], miR2Disease [15], dbDEMC [16], Oncomirdb [17]. With these databases, some computational methods have been proposed to identify potential miRNAdisease associations. Based on a kernelized Bayesian matrix factorization model, Lan et al. proposed a computational method (KBMFMDI) to predict miRNAdiseases associations based on known miRNAdisease associations, miRNA sequence and disease sematic information [18]. By integrating the miRNAdisease association network, miRNA similarity network and disease similarity network, You et al. [19] developed PBMDA to prioritize the underlying miRNAdisease associations, which used a special depthfirst search algorithm in a heterogeneous network. Luo et al. also proposed a networkbased method for drug repositioning based on similarities among drugs and diseases [20]. DNRLMFMDA was proposed to discover hidden miRNAdisease associations based on known miRNAdisease associations, miRNA similarity and disease similarity, the main feature of DNRLMFMDA was that it assigned higher importance levels to the observed interacting miRNAdisease pairs than unknown pairs [21]. Based on the inductive matrix completion model, IMCMDA was also proposed to predict miRNAdisease associations by integrating miRNA functional similarity, disease semantic similarity and Gaussian interaction profile kernel similarity [22]. Chen et al. [23] proposed a computational model named Laplacian regularized sparse subspace learning for miRNAdisease association prediction (LRSSLMDA), which projected miRNA/disease’ statistical feature profiles and graph theoretical feature profiles to a common subspace. MDHGI was a computational model to discover new miRNAdisease associations based on the matrix decomposition and heterogeneous graph inference, which integrated the predicted association probability obtained from matrix decomposition through a sparse learning method [24]. DLRMC was a computational method to predict miRNAdisease associations, based on matrix completion model with dual Laplacian regularization (DLRMC) [25]. EDTMDA was a computational method based on the ensemble of decision trees, which built a computational framework by integrating ensemble learning and dimensionality reduction [26]. Based on the logistic model tree, Wang et al. proposed a method for predicting miRNAdisease associations (LMTRDA) [27]. Pasquier et al. proposed a method to calculate the associations of miRNA disease pairs according to the vector similarity of miRNAs and diseases based on the distributional information of miRNAs and diseases in a highdimensional vector space [28]. RKNNMDA was a type of instancebased learning to predict potential miRNAdisease associations based on the knearest neighbor algorithm and support vector machine (SVM) [29]. BNPMDA was a novel computational model of bipartite network projection for miRNAdisease association prediction, and its main feature was that bias ratings were constructed for miRNAs and diseases by using agglomerative hierarchical clustering [30]. VAEMDA was a novel miRNAdisease association prediction method based on an unsupervised deep learning framework with variational autoencoder [31]. Yan et al. proposed ABMDA to predict potential miRNAdisease associations, which balanced the positive and negative samples by performing random sampling based on kmeans clustering on negative samples [32]. Based on the kmer sparse matrix to extract miRNA sequence information and deep autoencoder neural network (AE), MLMDA was developed to predict miRNAdisease associations [33]. Cheng et al. also proposed a miRNAdisease association prediction method based on adaptive multiview multilabel learning(AMVML) [34]. By combined the weighted profile and collaborative matrix factorization (CMF), a new computation model logistic weighted profilebased collaborative matrix factorization (LWPCMF) was developed to predict miRNAdisease associations [35]. DBMDA was a novel computational model for miRNAdisease association prediction, the notable feature of this method was inferring the global similarity from region distances based on the miRNA sequences [36]. By combing the kernelbased nonlinear dimensionality reduction, matrix factorization and binary classification, a neoteric Bayesian model (KBMFMDA) was proposed to predict miRNAdisease associations [37]. Chen et al. also proposed a miRNAdisease association prediction method (NCMCMDA) based on a neighborhood constraint matrix completion model [38]. Based on the neural inductive matrix completion with graph convolutional networks, Li et al. also proposed a method to predict miRNAdisease associations [39]. In addition, the matrix completion model was also used in drug repositioning [40–43], predicting lncRNAdisease associations [44, 45] and microbedisease associations [46].
Furthermore, the miRNAtarget interaction was also predicted by miRTRS based on known miRNAtarget interactions, miRNA sequences and gene sequences [47]. Bartel et al. [11] described the important biological functions identified for most of the broadly conserved miRNAs of mammals, and they also reviewed how metazoan miRNAs recognized and caused the repression of their targets. Studies demonstrated that some miRNA molecules were essential to the disease development [48]. Therefore, inspired by the bioinformatics development of the protein essentiality prediction [49, 50], Gao et al. first proposed a computational method (miES) based on machine learning and sequence features to identify the miRNA essentiality [51]. MiES used the miRNA sequences and a logistic regression model for performing miRNAomewide search for essential miRNAs. In addition, miES further analyzed the miRNA conservation [52], miRNA expression dataset and miRNA disease spectrum width (DSW) [53] to understand the important basis for predicting the essentiality of miRNAs [54]. In addition, the sequence features also used in study of genome [55]. The frequencies of kmers were also used in ARP to classify the reads into three categories [56]. In MultiMotifMaker, the position weight matrix (PWM) was a used representation of motifs, and its 4 columns (A,C,T,G) described the frequency of occurrence of each base at each position [57].
However, the current development of miRNA essentiality prediction method is still not good enough. Complex and deeper features related to miRNAs should be considered to improve the prediction quality of current methods. The more effective and advanced computational methods should also be developed to identify essential miRNAs. Therefore, in this study we propose a computational method (PESM) to predict potential essential miRNA based on the essential miRNA and nonessential miRNAs benchmark dataset. PESM first integrates more miRNA sequence features (such as 18 dinucleotide features : UC%, UG% and so on) as in miES. Then PESM uses gradient boosting machines to predict the essentiality of miRNAs. In order to assess the prediction performance of PESM and compare it with other computational methods, we also conduct the 5fold cross validation (5CV). In addition, the area under of receiver operating characteristic (ROC) curve (AUC), accuracy (ACC) and Fmeasure are used as the metrics of all prediction methods. The competing methods include miES, Gaussian Naive Bayes (GaussianNB) and SVM. The experiment results of 5CV show that PESM can obtain better prediction performance in terms of AUC, ACC and Fmeasure (AUC: 0.9117, ACC: 0.8516 and Fmearsure: 0.8572) than other competing methods: miES (AUC: 0.8837, ACC: 0.8263 and Fmearsure: 0.8326), GaussianNB (AUC: 0. 8720, ACC: 0.8000 and Fmearsure: 0.8093) and SVM (AUC: 0.8571, ACC: 0.8206 and Fmearsure: 0.8271). Comparing with miES, PESM integrates more sequence and structural features of miRNAs. In addition, the gradient boosting machine model is used to compute the predicted scores of essential miRNAs. By analyzing the relative importance of the features, we can also conclude that the added new features can represent the intrinsical characteristics of miRNAs. Finally, the experiment results also prove that the prediction ability of our method is superior to other competing methods.
Methods
Materials
In this study, we use the benchmark dataset of essential miRNAs and nonessential miRNAs, which consists of the premiRNA sequences and maturemiRNA sequences of human, rat and mouse from miRbase [52]. The benchmark dataset includes 77 essential mice miRNAs and the same number of nonessential miRNAs [11]. The known essential mice miRNAs (positive samples) and nonessential miRNAs (negative samples) were obtained from the review paper [11]. In miES, the negative samples were generated with two strategies: (1) the random selection; (2) the selection according to the maximum mean AUC.
Feature set
The miRNAs are transcribed as long primary miRNAs, which produce miRNA precursors (premiRNAs) by nuclear RNase III Drosha [58]. Then the premiRNAs are cleaved into mature miRNAs [1]. All premiRNAs have stemloop hairpin structures [59]. Therefore, by considering the production process of miRNAs and the structure of premiRNAs, PESM uses the features of not only maturemiRNAs but also premiRNAs. The selected feature set of premiRNA sequences and maturemiRNA sequences has important influence on predicting the essentiality of miRNAs. In this study, we first extract the 14 premiRNA and maturemiRNA features which include information about sequences and structures. In addition, up to now various feature sets have been proposed to study premiRNA and other relative prediction problems. Inspired by the successful application of dinucleotide frequency information in predicting premiRNAs, we add the 18 dinucleotide frequency features of premiRNAs and maturemiRNAs in this study [60]. In addition, we further add other 6 structure features of premiRNAs, includes normalized basepairing propensity (P(s)), normalized basepairing propensity divided by its length (nP(s)), normalized Shannon entropy (Q(s)), normalized Shannon entropy divided by its length (nQ(s)), normalized basepair distance(D(s)) and normalized basepair distance divided by its length(nD(s)) [61]. We use the module RNAlib of Vienna RNA Package to intrinsic folding quantitative measures P(S), nP(S), Q(s), nQ(s), D(s) and nD(s) [62]. These structure features and Vienna RNA Package have been broadly used in both miRNA prediction and premiRNA prediction [63–65]. As a result, our method consists of 38 features. Note that these features also include the 14 features which are used in miES. The more detail about the feature set is described in Table 1.
Gradient boosting regression trees
After computing the above sequence and structure features, we take a supervised learning method named gradient boosting regression trees derived from the gradient boosting machine model to predict essential miRNAs [66, 67]. This method has been successfully used in other classification issues [68, 69]. In the common supervised learning scenario, the sample data set can be represented by a set containing feature vectors and labels: D={(x_{i},y_{i})}(i=1,...,N), where N is the number of samples [70]. In this study, x_{i}∈R^{d} is the feature vector of the i−th miRNA, while y_{i} is its essentiality score. d is the dimensionality of features. According to the gradient boosting regression tree model, the predicted essentiality score \({\hat y}_{i}\) of miRNA i from its input feature vector can be calculated as follows:
where K is the maximum depth of regression trees and F is a set of functions containing the partition of the region and score [70]. In order to learn the set of trees {f_{i}}, the regularized objective function is defined as follows [70]:
where l is a differentiable convex loss function that is used to calculate the difference between the prediction \({\hat y}_{i}\) and target y_{i}. To avoid the overfitting, the second term Ω is used to control the complexity of the model. This regularized function can penalize the complicated models. Finally, the model with simple and predictive functions can be selected.
Since this model includes functions as parameters, it can not use traditional optimization methods in the Euclidean space to establish it. Instead, a new tree f_{t} is added to the ensemble, which optimizes the objective function and is searched from the functional space F at each iteration t. The process is defined as follows:
where \({\hat y}_{i}^{(t)}\) is the prediction of the i−th instance at the t−th iteration. The model finds f_{t} to optimize the above objective function.
Equation (3) is still hard to optimize in the general setting, so the second order Taylor expansion is used to approximate the objective function as follows:
where \(g_{i}=\partial _{\hat {y}_{i}^{(t1)}} l\left (y_{i}, {\hat {y}_{i}^{(t1)}}\right)\) and \(h_{i}= {\partial _{\hat {y}_{i}^{(t1)}}}^{2} l\left (y_{i}, {\hat {y}_{i}^{(t1)}}\right)\). By removing the terms independent of f_{t}(x_{i}), the following approximate objective function at step t can be obtained:
A gradient boosting algorithm iteratively adds functions that optimizes \(\overline {L}^{(t)}\) for a number of userspecified iterations.
In order to learn the function f_{t} in each step, the mapping q:R^{d}→{1,2,...,T} is defined to map the input to the index of the region. The function is defined as follow:
where w is a vector of scores in each region and q represents the decision tree structure. Furthermore, the function complexity was defined as follow:
where T is the number of trees. The parameters γ and λ are used to make a balance. \({w_{j}^{2}}\) is the prediction score for data corresponding to the j−th leaf from f_{t}.
Then Eq(5) can be rewritten as follow:
where I_{j}={iq(x_{i})=j} is defined as the instance set of region j. When q(x) is fixed, the optimal weight \({w_{j}^{*}}\) of region j can be calculated as follows:
The optimal objective value is calculated as follow:
Equation (10) is used to score the region partition specified by q. It also can find a good structure according to the previous reference [70]. Since there can be infinitely many possible candidates of the tree structure, it applied a greedy algorithm in practice [70]. The one step of the algorithm was that splitting a leaf into two leaves. In each round, it greedily enumerated the features and split the feature that gives the maximum reduction calculated by Eq. (10). The main feature of this model is the explicit regularization term which prevents the model from overfitting. The detail of this model can be found in Chen et al. [67].
Results
Performance evaluation
In order to assess the prediction performance of our method and other computing methods, we conduct the 5CV based on the same benchmark dataset. The competing methods include miES [51], GaussianNB [71] and SVM [72, 73]. The benchmark dataset is downloaded from miES. In each round of the 5CV, we divide the essential miRNAs and nonessential miRNAs into the 5 sets, 4 of which are used to train the model while the left one is used as the testing set. We repeat the 5CV 50 times in this study.
In addition, the AUC value is used to measure the prediction performance of computational methods. The ROCs are drawn with TPR (true positive rate) with respect to FPR (false positive rate) values. TPR is the fraction of essential miRNAs that are correctly predicted, while FPR is the fraction of nonessential miRNAs that are incorrectly predicted. Furthermore, the Fmeasure and ACC are also used to evaluate the prediction performance of computational methods. The Fmeasure is calculated from the harmonic mean of precision (P) and recall (R)(F=2∗P∗R/(P+R)).
Comparison with other competing methods
In this study, we compare our method to other three competing methods which include miES, GaussianNB and SVM. MiES was a computational method for miRNA essentiality prediction, which only uses sequence features of known essential miRNAs. In addition, GaussianNB and SVM are the typical classification models. Figure 1 plots the ROC curve and shows the AUC values of four computational methods. In terms of AUC, our method obtains the best prediction performance as its AUC value is 0.9117, compared with other methods (miES: 0.8837, GaussianNB: 0.8720 and SVM: 0.8571).
In addition, Table 2 shows the ACC and Fmeasure values of four methods with the 5CV validation. We can see from Table 2 that our method obtains the best prediction performance (ACC:0.8516 and Fmearsure:0.8572), compared with other methods (miES (ACC:0.8263 and Fmearsure:0.8326), GaussianNB (ACC:0.8000 and Fmearsure:0.8093) and SVM (ACC:0.8206 and Fmearsure:0.8271)).
Relative importance of the features
In order to demonstrate the newly added features in the prediction method, we further analyze the relative importance of all 38 features. Figure 2 plots the relative importance of the features, which is computed by the XGBoost package. We can see from Fig. 2 that 4 newly added features are ranked top 10 based on the relative importance, which include %CC in mat, P(s),nQ(s) and D(s). These 4 added features rank 6, 4, 3 and 5, respectively. It also demonstrates that the newly added features can reflect the intrinsic characteristics of miRNAs and help improve the performance of predicting essential miRNAs.
Parameter analysis for γ,λ, K and T
In this study, we analyze four parameters, including the regularization terms on the number of regions (γ), on the sum of squared scores (λ), the maximum depth of regression trees (K) and the number of trees (T). The default values of γ,λ, K and T are 0, 0.1, 6 and 1000, respectively. We conduct the 5CV to evaluate the prediction performance of PESM. In addition, one of four parameters is analyzing while the other three parameters are set to be the default values.
The default value of γ is 0 in the XGBoost package. We also compute the prediction performance of PESM with the parameter γ in the set 0, 0.1, 0.2 according to reference [70]. The AUC values of our method are 0.9117, 0.9133 and 0.9100. In this study, we set the value of parameter γ to 0 based on our experiment results and the default value in the XGBoost package.
We evaluate the prediction performance of PESM when parameter λ ranges from 0.25 to 2.0 with the increment of 0.25. We can see from Table 3 that PESM can achieve the best prediction performance when it is set to 1.0 which is also the default value of XGBoost package. Therefore, we set λ to 1.0 in this study.
Furthermore, in the XGBoost package, the default value of parameter K is 6. Table 4 describes the AUC values obtained by PESM when K ranges from 3 to 9. We can see from Table 4 that our method can obtain the best prediction performance when K is set to be 7, and obtain reliable prediction performances when K ranges from 5 to 7. Therefore, by considering the default value in the XGBoost package and our experiments results, we set K to 6 in this study.
Finally, Table 5 shows the prediction performance of PESM when the tree number T is set to 100, 500, 1000, 1500, 2000. We can see from Table 5 that PESM obtain the reliable prediction performance when T is selected from one of set 1000, 1500, 2000. Therefore, we also set the default value of T to 1000 in this study.
Discussion
With the development of biotechnology, studies have shown that miRNAs participate in many biological processes, such as cell growth, cell death and so on. Furthermore, miRNAs also play important roles in human diseases, especially the complex diseases, such as cancer. Therefore, the study of miRNA and disease associations has become a main research topic in bioinformatics. Based on the more systematic understanding of miRNAs, studies further demonstrate that some miRNA molecules are essential to the disease development. The essential miRNAs are necessary to manifest principles of disease mechanisms. Therefore, identifying the essential miRNAs is very appealing.
Conclusion
In this study, we have developed a computational method (PESM) to predict the essentiality of miRNAs. PESM integrates the 38 sequence and structural features of miRNAs. Then it further uses the gradient boosting machines to compute the predicted scores of essential miRNAs. The experiment results with the 5fold cross validation show that the prediction performance of PESM is superior to other competing methods, including the stateofart method miES. Finally, we have analyzed the relative importance of all features by the XGBoost package, and the results demonstrate that the newly added features can further improve the prediction performances.
Although our method can effectively predict the essential miRNAs and nonessential miRNAs, its limits should be addressed in the future. First, the nonessential miRNAs in the current benchmark dataset are randomly selected. Second, the more features of miRNAs also should be designed, such as topological features of miRNAs. Finally, other similaritybased methods [74], collaborative metric learning methods [75] and deep learning methods [76, 77] should be adopted. We would provide a more effective computational method to predict essential miRNAs by addressing above limitations in the future.
Availability of data and materials
The datasets and source codes are available at https://github.com/bioinfomaticsCSU/PESM.
Abbreviations
 5CV:

10fold cross validation
 ACC:

Accuracy
 AUC:

Area under the receiver operating curve
 FPR:

False positive rate
 GaussianNB:

Gaussian Naive Bayes
 MFE:

minimum free energy
 SVM:

Support vector machine
 TPR:

True positive rate
References
 1
Bartel DP. Micrornas: genomics, biogenesis, mechanism, and function. Cell. 2004; 116(2):281–97.
 2
Ambros V. micrornas: tiny regulators with great potential. Cell. 2001; 107(7):823–6.
 3
Meister G, Tuschl T. Mechanisms of gene silencing by doublestranded rna. Nature. 2004; 431(7006):343.
 4
Wen D, Danquah M, Chaudhary AK, Mahato RI. Small molecules targeting microrna for cancer therapy: Promises and obstacles. J Control Rel. 2015; 219:237–47.
 5
Chen X, Xie D, Zhao Q, You ZH. Micrornas and complex diseases: from experimental results to computational models. Brief Bioinforma. 2019; 20(2):515–39.
 6
Almeida MI, Nicoloso MS, Zeng L, Ivan C, Spizzo R, Gafà R, Xiao L, Zhang X, Vannini I, Fanini F, et al. Strandspecific mir285p and mir283p have distinct effects in colorectal cancer cells. Gastroenterology. 2012; 142(4):886–96.
 7
Schultz J, Lorenz P, Gross G, Ibrahim S, Kunz M. Microrna let7b targets important cell cycle molecules in malignant melanoma cells and interferes with anchorageindependent growth. Cell Res. 2008; 18(5):549.
 8
Tsai KW, Wu CW, Hu LY, Li SC, Liao YL, Lai CH, Kao HW, Fang WL, Huang KH, Chan WC, et al. Epigenetic regulation of mir34b and mir129 expression in gastric cancer. Int J Cancer. 2011; 129(11):2600–10.
 9
Gorur A, Fidanci SB, Unal ND, Ayaz L, Akbayir S, Yaroglu HY, Dirlik M, Serin MS, Tamer L. Determination of plasma microrna for early detection of gastric cancer. Mol Biol Rep. 2013; 40(3):2091–6.
 10
Weidhaas J. Using micrornas to understand cancer biology. Lancet Oncol. 2010; 11(2):106–7.
 11
Bartel DP. Metazoan micrornas. Cell. 2018; 173(1):20–51.
 12
Lu W, You R, Yuan X, Yang T, Samuel EL, Marcano DC, Sikkema WK, Tour JM, Rodriguez A, Kheradmand F, et al. The microrna mir22 inhibits the histone deacetylase hdac4 to promote t h 17 cell–dependent emphysema. Nat Immunol. 2015; 16(11):1185.
 13
Dooley J, GarciaPerez JE, Sreenivasan J, Schlenner SM, Vangoitsenhoven R, Papadopoulou AS, Tian L, Schonefeldt S, Serneels L, Deroose C, et al. The microrna29 family dictates the balance between homeostatic and pathological glucose handling in diabetes and obesity. Diabetes. 2016; 65(1):53–61.
 14
Li Y, Qiu C, Tu J, Geng B, Yang J, Jiang T, Cui Q. Hmdd v2. 0: a database for experimentally supported human microrna and disease associations. Nucleic Acids Res. 2013; 42(D1):1070–4.
 15
Jiang Q, Wang Y, Hao Y, Juan L, Teng M, Zhang X, Li M, Wang G, Liu Y. mir2disease: a manually curated database for microrna deregulation in human disease. Nucleic Acids Res. 2008; 37(suppl_1):98–104.
 16
Yang Z, Ren F, Liu C, He S, Sun G, Gao Q, Yao L, Zhang Y, Miao R, Cao Y, et al. dbdemc: a database of differentially expressed mirnas in human cancers. In: BMC Genomics, vol. 11. BioMed Central: 2010. p. 5. https://0doiorg.brum.beds.ac.uk/10.1186/1471216411s4s5.
 17
Wang D, Gu J, Wang T, Ding Z. Oncomirdb: a database for the experimentally verified oncogenic and tumorsuppressive micrornas. Bioinformatics. 2014; 30(15):2237–8.
 18
Lan W, Wang J, Li M, Liu J, Wu FX, Pan Y. Predicting micrornadisease associations based on improved microrna and disease similarities. IEEE/ACM Trans Comput Biol Bioinforma (TCBB). 2018; 15(6):1774–82.
 19
You ZH, Huang ZA, Zhu Z, Yan GY, Li ZW, Wen Z, Chen X. Pbmda: A novel and effective pathbased computational model for mirnadisease association prediction. PLoS Comput Biol. 2017; 13(3):1005455.
 20
Luo H, Wang J, Li M, Luo J, Peng X, Wu FX, Pan Y. Drug repositioning based on comprehensive similarity measures and birandom walk algorithm. Bioinformatics. 2016; 32(17):2664–71.
 21
Yan C, Wang J, Ni P, Lan W, Wu FX, Pan Y. Dnrlmfmda: predicting micrornadisease associations based on similarities of micrornas and diseases. IEEE/ACM Trans Comput Biol Bioinforma. 2019; 16(1):233–43.
 22
Chen X, Wang L, Qu J, Guan NN, Li JQ. Predicting mirna–disease association based on inductive matrix completion. Bioinformatics. 2018; 34(24):4256–65.
 23
Chen X, Huang L. Lrsslmda: Laplacian regularized sparse subspace learning for mirnadisease association prediction. PLoS Comput Biol. 2017; 13(12):1005912.
 24
Chen X, Yin J, Qu J, Huang L. Mdhgi: Matrix decomposition and heterogeneous graph inference for mirnadisease association prediction. PLoS Comput Biol. 2018; 14(8):1006418.
 25
Tang C, Zhou H, Zheng X, Zhang Y, Sha X. Dual laplacian regularized matrix completion for micrornadisease associations prediction. RNA Biol. 2019; 16(5):601–11.
 26
Chen X, Zhu CC, Yin J. Ensemble of decision tree reveals potential mirnadisease associations. PLoS Comput Biol. 2019; 15(7):1007209.
 27
Wang L, You ZH, Chen X, Li YM, Dong YN, Li LP, Zheng K. Lmtrda: Using logistic model tree to predict mirnadisease associations by fusing multisource information of sequences and similarities. PLoS Comput Biol. 2019; 15(3):1006865.
 28
Pasquier C, Gardès J. Prediction of mirnadisease associations with a vector space model. Sci Rep. 2016; 6:27036.
 29
Chen X, Wu QF, Yan GY. Rknnmda: rankingbased knn for mirnadisease association prediction. RNA Biol. 2017; 14(7):952–62.
 30
Chen X, Xie D, Wang L, Zhao Q, You ZH, Liu H. Bnpmda: bipartite network projection for mirna–disease association prediction. Bioinformatics. 2018; 34(18):3178–86.
 31
Zhang L, Chen X, Yin J. Prediction of potential mirna–disease associations through a novel unsupervised deep learning framework with variational autoencoder. Cells. 2019; 8(9):1040.
 32
Zhao Y, Chen X, Yin J. Adaptive boostingbased computational model for predicting potential mirnadisease associations. Bioinformatics. 2019; 35(22):4730–8.
 33
Zheng K, You ZH, Wang L, Zhou Y, Li LP, Li ZW. Mlmda: a machine learning approach to predict and validate microrna–disease associations by integrating of heterogenous information sources. J Transl Med. 2019; 17(1):260.
 34
Liang C, Yu S, Luo J. Adaptive multiview multilabel learning for identifying diseaseassociated candidate mirnas. PLoS Comput Biol. 2019; 15(4):1006931.
 35
Yin MM, Cui Z, Gao MM, Liu JX, Gao YL. Lwpcmf: logistic weighted profilebased collaborative matrix factorization for predicting mirnadisease associations. IEEE/ACM Trans Comput Biol Bioinforma. 2019. https://0doiorg.brum.beds.ac.uk/10.1109/tcbb.2019.2937774.
 36
Zheng K, You ZH, Wang L, Zhou Y, Li LP, Li ZW. Dbmda: A unified embedding for sequencebased mirna similarity measure with applications to predict and validate mirnadisease associations. Mol TherNucleic Acids. 2020; 19:602–11.
 37
Chen X, Li SX, Yin J, Wang CC. Potential mirnadisease association prediction based on kernelized bayesian matrix factorization. Genomics. 2020; 112(1):809–19.
 38
Chen X, Sun LG, Zhao Y. Ncmcmda: mirna–disease association prediction through neighborhood constraint matrix completion. Brief Bioinforma. 2020. https://0doiorg.brum.beds.ac.uk/10.1093/bib/bbz159.
 39
Li J, Zhang S, Liu T, Ning C, Zhang Z, Zhou W. Neural inductive matrix completion with graph convolutional networks for mirnadisease association prediction. Bioinformatics. 2020. https://0doiorg.brum.beds.ac.uk/10.1093/bioinformatics/btz965.
 40
Yang M, Luo H, Li Y, Wang J. Drug repositioning based on bounded nuclear norm regularization. Bioinformatics. 2019; 35(14):455–63.
 41
Luo H, Li M, Wang S, Liu Q, Li Y, Wang J. Computational drug repositioning using lowrank matrix approximation and randomized algorithms. Bioinformatics. 2018; 34(11):1904–12.
 42
Yang M, Luo H, Li Y, Wu FX, Wang J. Overlap matrix completion for predicting drugassociated indications. PLoS Comput Biol. 2019; 15(12). https://0doiorg.brum.beds.ac.uk/10.1371/journal.pcbi.1007541.
 43
Luo H, Li M, Mengyun Y, Wu FX, Li Y, Wang J. Biomedical data and computational models for drug repositioning: a comprehensive review. Brief Bioinforma. 2019. https://0doiorg.brum.beds.ac.uk/10.1093/bib/bbz176.
 44
Lu C, Yang M, Luo F, Wu FX, Li M, Pan Y, Li Y, Wang J. Prediction of lncrnadisease associations based on inductive matrix completion. Bioinformatics. 2018; 34(19):3357–64.
 45
Lu C, Yang M, Li M, Li Y, Wu F, Wang J. Predicting human lncrnadisease associations based on geometric matrix completion. IEEE J Biomed Health Inform. 2019. https://0doiorg.brum.beds.ac.uk/10.1109/JBHI.2019.2958389.
 46
Yan C, Duan G, Wu F, Pan Y, Wang J. Mchmda: Predicting microbedisease associations based on similarities and lowrank matrix completion. IEEE/ACM Trans Comput Biol Bioinforma. 2019. https://0doiorg.brum.beds.ac.uk/10.1109/TCBB.2019.2926716.
 47
Jiang H, Wang J, Li M, Lan W, Wu F, Pan Y. mirtrs: A recommendation algorithm for predicting mirna targets. IEEE/ACM Trans Comput Biol Bioinforma. 2018. (https://0doiorg.brum.beds.ac.uk/10.1109/TCBB.2018.2873299).
 48
Beermann J, Piccoli MT, Viereck J, Thum T. Noncoding rnas in development and disease: background, mechanisms, and therapeutic approaches. Physiol Rev. 2016; 96(4):1297–325.
 49
Li M, Li W, Wu FX, Pan Y, Wang J. Identifying essential proteins based on subnetwork partition and prioritization by integrating subcellular localization information. J Theor Biol. 2018; 447:65–73.
 50
Li G, Li M, Peng W, Li Y, Pan Y, Wang J. A novel extended pareto optimality consensus model for predicting essential proteins. J Theor Biol. 2019; 480:141–9.
 51
Song F, Cui C, Gao L, Cui Q. mies: predicting the essentiality of mirnas with machine learning and sequence features. Bioinformatics. 2018; 35(6):1053–4.
 52
Kozomara A, GriffithsJones S. mirbase: annotating high confidence micrornas using deep sequencing data. Nucleic Acids Res. 2013; 42(D1):68–73.
 53
Huang Z, Shi J, Gao Y, Cui C, Zhang S, Li J, Zhou Y, Cui Q. Hmdd v3. 0: a database for experimentally supported human microrna–disease associations. Nucleic Acids Res. 2018; 47(D1):1013–7.
 54
De Rie D, Abugessaisa I, Alam T, Arner E, Arner P, Ashoor H, Åström G, Babina M, Bertin N, Burroughs AM, et al. An integrated expression atlas of mirnas and their promoters in human and mouse. Nat Biotechnol. 2017; 35(9):872.
 55
Ni P, Huang N, Zhang Z, Wang DP, Liang F, Miao Y, Xiao CL, Luo F, Wang J. Deepsignal: detecting dna methylation state from nanopore sequencing reads using deeplearning. Bioinformatics. 2019; 35(22):4586–95.
 56
Liao X, Li M, Junwei L, Zou Y, Wu FX, Pan Y, Luo F, Wang J. Improving assembly based on read classification. IEEE/ACM Trans Comput Biol Bioinforma. 2020; 17(1):177–88.
 57
Li T, Zhang X, Luo F, Wu FX, Wang J. Multimotifmaker: a multithread tool for identifying dna methylation motifs from pacbio reads. IEEE/ACM Trans Comput Biol Bioinforma. 2020; 17(1):220–5.
 58
Lee Y, Ahn C, Han J, Choi H, Kim J, Yim J, Lee J, Provost P, Rådmark O, Kim S, et al. The nuclear rnase iii drosha initiates microrna processing. Nature. 2003; 425(6956):415.
 59
Nelson P, Kiriakidou M, Sharma A, Maniataki E, Mourelatos Z. The microrna world: small is mighty. Trends Biochem Sci. 2003; 28(10):534–40.
 60
Kleftogiannis D, Theofilatos K, Likothanassis S, Mavroudi S. Yamipred: A novel evolutionary method for predicting premirnas and selecting relevant features. IEEE/ACM Trans Comput Biol Bioinforma. 2015; 12(5):1183–92.
 61
Loong SNK, Mishra SK. Unique folding of precursor micrornas: quantitative evidence and implications for de novo identification. Rna. 2007; 13(2):170–87.
 62
Hofacker IL. Vienna rna secondary structure server. Nucleic Acids Res. 2003; 31(13):3429–31.
 63
Batuwita R, Palade V. micropred: effective classification of premirnas for human mirna gene prediction. Bioinformatics. 2009; 25(8):989–95.
 64
Tseng KC, ChiangHsieh YF, Pai H, Chow CN, Lee SC, Zheng HQ, Kuo PL, Li GZ, Hung YC, Lin NS, et al. microrpm: a microrna prediction model based only on plant small rna sequencing data. Bioinformatics. 2017; 34(7):1108–15.
 65
Stegmayer G, Yones C, Kamenetzky L, Milone DH. High classimbalance in premirna prediction: a novel approach based on deepsom. IEEE/ACM Trans Comput Biol Bioinforma (TCBB). 2017; 14(6):1316–26.
 66
Friedman J, Hastie T, Tibshirani R, et al. Additive logistic regression: a statistical view of boosting (with discussion and a rejoinder by the authors). Ann Stat. 2000; 28(2):337–407.
 67
Chen T, Guestrin C. Xgboost: A scalable tree boosting system. In: Proceedings of the 22nd Acm Sigkdd International Conference on Knowledge Discovery and Data Mining. ACM: 2016. p. 785–94. https://0doiorg.brum.beds.ac.uk/10.1145/2939672.2939785.
 68
He T, Heidemeyer M, Ban F, Cherkasov A, Ester M. Simboost: a readacross approach for predicting drug–target binding affinities using gradient boosting machines. J Cheminformatics. 2017; 9(1):24.
 69
Öztürk H, Özgür A, Ozkirimli E. Deepdta: deep drug–target binding affinity prediction. Bioinformatics. 2018; 34(17):821–9.
 70
Chen T, He T. Higgs boson discovery with boosted trees. In: NIPS 2014 Workshop on Highenergy Physics and Machine Learning. Montreal: 2015. p. 69–80.
 71
Pedregosa F, Varoquaux G, Gramfort A, Michel V, Louppe G. Scikitlearn: Machine learning in python. J Mach Learn Res. 2013; 12(10):2825–30.
 72
Chang CC, Lin CJ. Libsvm: A library for support vector machines. ACM Trans Intell Syst Technol (TIST). 2011; 2(3):27.
 73
Chen Q, Lai D, Lan W, Wu X, Chen B, Chen YPP, Wang J. Ildmsf: Inferring associations between long noncoding rna and disease based on multisimilarity fusion. IEEE/ACM Trans Comput Biol Bioinforma. 2019. https://0doiorg.brum.beds.ac.uk/10.1109/TCBB.2019.2936476.
 74
Lan W, Li M, Zhao K, Liu J, Wu FX, Pan Y, Wang J. Ldap: a web server for lncrnadisease association prediction. Bioinformatics. 2016; 33(3):458–60.
 75
Luo H, Wang J, Yan C, Li M, Fangxiang W, Yi P. A novel drug repositioning approach based on collaborative metric learning. IEEE/ACM Trans Comput Biol Bioinforma. 2019. https://0doiorg.brum.beds.ac.uk/10.1109/TCBB.2019.2926453.
 76
Kong Y, Gao J, Xu Y, Pan Y, Wang J, Liu J. Classification of autism spectrum disorder by combining brain connectivity and deep neural network classifier. Neurocomputing. 2019; 324:63–68.
 77
An Y, Huang N, Chen X, Wu F, Wang J. Highrisk prediction of cardiovascular diseases via attentionbased deep neural networks. IEEE/ACM Trans Comput Biol Bioinforma. 2019. https://0doiorg.brum.beds.ac.uk/10.1109/TCBB.2019.2935059.
Acknowledgements
The authors are very grateful to the anonymous reviewers for their constructive comments which have helped significantly in revising this work.
Funding
Publication costs are funded by National Natural Science Foundation of China under Grant No.61962050. The authors would like to express their gratitude for the support from the National Natural Science Foundation of China(No.61772552, No.61420106009, No.61832019 and No.61962050), 111 Project (No. B18059) and Hunan Provinvial Science and Technology Program (No. 2018WK4001).
Author information
Affiliations
Contributions
GD and JW conceived the project; CY designed the experiments; and CY performed the experiments; CY, GD and FXW wrote the paper. All authors read and approved the final manuscript.
Corresponding author
Ethics declarations
Ethics approval and consent to participate
Not applicable.
Consent for publication
Not applicable.
Competing interests
The authors declare that they have no competing interests.
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/. The Creative Commons Public Domain Dedication waiver (http://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated in a credit line to the data.
About this article
Cite this article
Yan, C., Wu, F., Wang, J. et al. PESM: predicting the essentiality of miRNAs based on gradient boosting machines and sequences. BMC Bioinformatics 21, 111 (2020). https://0doiorg.brum.beds.ac.uk/10.1186/s1285902034269
Received:
Accepted:
Published:
DOI: https://0doiorg.brum.beds.ac.uk/10.1186/s1285902034269
Keywords
 MiRNA
 Essentiality
 Gradient boosting machines