Research article

Multi-stage differential evolution algorithm for constrained D-optimal design

  • Received: 25 October 2020 Accepted: 17 December 2020 Published: 08 January 2021
  • MSC : 62K05, 62K99

  • In practice, objective condition may impose constraints on design region, which make it difficult to find the exact D-optimal design. In this paper, we propose a Multi-stage Differential Evolution (MDE) algorithm to find the global approximated D-optimal design in an experimental region with linear or nonlinear constraints. MDE algorithm is approved from Differential Evolution (DE) algorithm. It has low requirements for both feasible regions and initial values. In iteration, MDE algorithm pursues evolutionary equilibrium rather than convergence speed, so it can stably converge to the global D-optimal design instead of the local ones. The advantages of MDE algorithm in finding D-optimal design will be illustrated by examples.

    Citation: Xinfeng Zhang, Zhibin Zhu, Chongqi Zhang. Multi-stage differential evolution algorithm for constrained D-optimal design[J]. AIMS Mathematics, 2021, 6(3): 2956-2969. doi: 10.3934/math.2021179

    Related Papers:

    [1] Sumaiya Noor, Salman A. AlQahtani, Salman Khan . Chronic liver disease detection using ranking and projection-based feature optimization with deep learning. AIMS Bioengineering, 2025, 12(1): 50-68. doi: 10.3934/bioeng.2025003
    [2] Wallace Camacho Carlos, Alessandro Copetti, Luciano Bertini, Leonard Barreto Moreira, Otávio de Souza Martins Gomes . Human activity recognition: an approach 2D CNN-LSTM to sequential image representation and processing of inertial sensor data. AIMS Bioengineering, 2024, 11(4): 527-560. doi: 10.3934/bioeng.2024024
    [3] Kayode Oshinubi, Augustina Amakor, Olumuyiwa James Peter, Mustapha Rachdi, Jacques Demongeot . Approach to COVID-19 time series data using deep learning and spectral analysis methods. AIMS Bioengineering, 2022, 9(1): 1-21. doi: 10.3934/bioeng.2022001
    [4] Abdulmajeed Alsufyani . Performance comparison of deep learning models for MRI-based brain tumor detection. AIMS Bioengineering, 2025, 12(1): 1-21. doi: 10.3934/bioeng.2025001
    [5] Marianthi Logotheti, Eleftherios Pilalis, Nikolaos Venizelos, Fragiskos Kolisis, Aristotelis Chatziioannou . Development and validation of a skin fibroblast biomarker profile for schizophrenic patients. AIMS Bioengineering, 2016, 3(4): 552-565. doi: 10.3934/bioeng.2016.4.552
    [6] Shital Hajare, Rajendra Rewatkar, K.T.V. Reddy . Design of an iterative method for enhanced early prediction of acute coronary syndrome using XAI analysis. AIMS Bioengineering, 2024, 11(3): 301-322. doi: 10.3934/bioeng.2024016
    [7] Md. Mehedi Hassan, Rezuana Haque, Sheikh Mohammed Shariful Islam, Hossam Meshref, Roobaea Alroobaea, Mehedi Masud, Anupam Kumar Bairagi . NeuroWave-Net: Enhancing epileptic seizure detection from EEG brain signals via advanced convolutional and long short-term memory networks. AIMS Bioengineering, 2024, 11(1): 85-109. doi: 10.3934/bioeng.2024006
    [8] Lamia Fatiha KAZI TANI, Mohammed Yassine KAZI TANI, Benamar KADRI . Gas-Net: A deep neural network for gastric tumor semantic segmentation. AIMS Bioengineering, 2022, 9(3): 266-282. doi: 10.3934/bioeng.2022018
    [9] Vincent Brondani . In vitro analysis of site specific nuclease selectivity by NGS. AIMS Bioengineering, 2021, 8(4): 235-242. doi: 10.3934/bioeng.2021020
    [10] Thi Kim Thoa Thieu, Roderick Melnik . Coupled effects of channels and synaptic dynamics in stochastic modelling of healthy and Parkinson's-disease-affected brains. AIMS Bioengineering, 2022, 9(2): 213-238. doi: 10.3934/bioeng.2022015
  • In practice, objective condition may impose constraints on design region, which make it difficult to find the exact D-optimal design. In this paper, we propose a Multi-stage Differential Evolution (MDE) algorithm to find the global approximated D-optimal design in an experimental region with linear or nonlinear constraints. MDE algorithm is approved from Differential Evolution (DE) algorithm. It has low requirements for both feasible regions and initial values. In iteration, MDE algorithm pursues evolutionary equilibrium rather than convergence speed, so it can stably converge to the global D-optimal design instead of the local ones. The advantages of MDE algorithm in finding D-optimal design will be illustrated by examples.



    N6,2′-O-dimethyladenosine (m6Am) is a significant RNA modification that plays a vital role in regulating various cellular processes, including gene expression, RNA stability, and the general integrity of RNA metabolism. This modification occurs at the five untranslated regions (UTRs) of messenger RNA (mRNA), influencing key RNA functions such as capping, translation initiation, and RNA decay [1]. m6Am has been shown to affect the interaction of RNA molecules with RNA-binding proteins, modulating critical processes like RNA splicing, transport, and stability. These modifications help regulate gene expression in response to cellular conditions and environmental cues, making them essential for maintaining cellular homeostasis. The dynamic and reversible nature of m6Am modifications in RNA is crucial for regulating mRNA's fate and ensuring the translation machinery's proper functioning [2]. The m6Am modification has gained attention due to its potential implications in disease pathogenesis and cellular dysfunction. The m6Am is linked to various biological processes, such as cell growth, differentiation, stress responses, and RNA surveillance mechanisms. The m6Am role in regulating mRNA stability suggests that it could regulate gene expression in response to stress or environmental changes, making it an essential factor in cellular adaptation and survival [3],[4]. Similarly, alterations in m6Am modification patterns have been associated with several diseases, including cancer, neurological disorders, and metabolic conditions, highlighting its significance in both health and disease. Its importance and accurate identification of m6Am sites within RNA sequences is essential for advancing the understanding of gene regulation and the molecular mechanisms that govern disease progression [5]. The ability to detect m6Am modifications opens new avenues for therapeutic interventions, enabling the development of targeted strategies for diseases that involve aberrant RNA modifications. As a result, computational methods that allow efficient and precise detection of m6Am sites are critical for advancing research in RNA biology and molecular medicine.

    Advancements in computational biology have led to several learning tools for predicting RNA modifications, particularly m6Am. For example, Song et al. [6] introduced MultiRM, an attention-based multi-label neural network capable of predicting 12 RNA modifications simultaneously. Using an attention mechanism, MultiRM identifies modification sites and interprets key sequence contexts, revealing strong associations between different RNA modifications. The model achieves 71.13% accuracy with an MCC of 0.427 and an AUC of 0.805 on sequence-based RNA modification mechanisms. Jiang et al. [7] proposed m6AmPred using the eXtreme gradient boosting with dart (XGBDart) algorithm and EIIP-PseEIIP encoding for feature representation. m6AmPred achieved 73.10% accuracy with an MCC of 0.462 and an AUC of 0.820 on cross-validation. Similarly, Luo et al. [8] developed another model named DLm6Am, i.e., an ensemble deep-learning framework combining one-hot encoding, nucleotide chemical property (NCP), and nucleotide density (ND) for feature extraction. DLm6Am integrates CNN, BiLSTM, and multi-head attention modules, outperforming tools like m6AmPred and MultiRM with 79.55% accuracy, 81.71% sensitivity, 77.40% specificity, MCC of 0.591, and AUC of 0.863 on independent testing data. Recently, Jia et al. [9] proposed EMDL_m6Am, a stacking ensemble model employing one-hot encoding and integrating DenseNet, inflated convolutional network (DCNN), and deep multiscale residual network (MSRN) for feature extraction. EMDL_m6Am achieved 80.98% accuracy, 82.25% sensitivity, 79.72% specificity, MCC of 0.619, and AUC of 0.823 on training data, with independent testing (80.98% accuracy, AUC of 0.8211). Despite advancements, existing methods struggle with limited encoding schemes, inefficient feature selection, and reliance on single deep learning frameworks, leading to suboptimal performance and high computational costs. The lack of explainability in current models significantly hinders the interpretation and improvement of accuracy, robustness, and interpretability in m6Am site prediction techniques.

    Based on the aforementioned considerations, in this study, we propose Deep-m6Am, a novel deep learning (DL) model designed to accurately identify m6Am sites in RNA sequences. The model integrates multiple feature extraction techniques, including pseudo single nucleotide composition (PseSNC), pseudo dinucleotide composition (PseDNC), and pseudo trinucleotide composition (PseTNC), to capture complex sequence patterns essential for precise prediction. A SHAP (SHapley Additive exPlanations)-based feature selection mechanism is incorporated to enhance computational efficiency and eliminate irrelevant or redundant features, ensuring that only the most informative features contribute to the model's predictions. The Deep-m6Am framework addresses the limitations of single-model approaches by leveraging a multilayer deep neural network (DNN) classifier, improving robustness and generalizability. The model's performance was rigorously evaluated using 5-fold cross-validation and independent testing. The Deep-m6Am demonstrates state-of-the-art results across multiple evaluation metrics, including accuracy, sensitivity, specificity, AUC, and MCC, outperforming existing models and traditional ML algorithms. Integrating cutting-edge feature extraction, selection, and deep learning methodologies, Deep-m6Am provides a powerful and interpretable tool for predicting RNA modifications. This advancement significantly contributes to RNA biology by offering more profound insights into RNA modifications and their roles in disease mechanisms, opening promising avenues for further research into RNA modification patterns. Therefore, Deep-m6Am is a robust computational framework for addressing key challenges in RNA modification analysis, as illustrated in Figure 1.

    Figure 1.  Architecture of the proposed model.

    The rest of the paper is organized as follows: Section 2 presents material and methods, Section 3 illustrates performance metrics and evaluation, Section 4 provides experimental results and analysis, and the work is concluded in Section 5.

    A valid and reliable benchmark dataset is essential for designing a powerful and robust computational model. In this study, we utilized the same benchmark datasets employed by Jia et al. [9]. These sites were regarded as highly confident, providing a solid foundation for accurate and reliable model development. Initially, sample sequences were extracted for the training dataset, as depicted in Eq. 1.

    T1=(T+1T1)

    Where T1 represents the total RNA sequences, T+1 represents the positive m6Am sequences, and T1 represents the non-m6Am sequences. U is a mathematical operator representing the union of the two subsamples. Moreover, a CD-HIT tool was employed to eliminate pairwise sequences with a similarity greater than 20%. Finally, we achieved a benchmark dataset comprising 3548 sequences with 1774 m6Am samples and 1774 non-m6Am samples. In addition, we randomly separated 15% of the samples with label stratification from the original dataset and generated an independent set. The remaining 85% of the samples were used as training sets. The independent benchmark dataset was mathematically formulated using the following Eq. 2.

    T2=(T+2T2)

    Where T2 represents the total RNA sequences, T+2 represents the positive m6Am sequences, and T2 represents the non-m6Am sequences. After separation, the training sets contained 2838 (i.e., 1419 Pos+ and 1419 Neg-) training instances and 710 (i.e., 355 Pos+ and 355 Neg-) independent instances. It is important to note that the independent test set was carefully saved separately as invisible data and was not used in learning and parameter tuning processes. The statistical distribution of the benchmark dataset, detailed in Table 1, ensures an equitable representation of positive and negative samples across training and independent testing, thereby enabling a robust and reliable model evaluation.

    Table 1.  Statistical distribution of the benchmark dataset.
    Dataset Number of samples Positive samples Negative samples
    Cross validation 3548 1774 1774
    Training dataset 2838 1419 1419
    Independent dataset 710 355 355

     | Show Table
    DownLoad: CSV

    Several techniques have been developed to convert DNA, protein, and RNA sequences into discrete mathematical models, maintaining the nucleotides' outstanding features and structural integrity. These methods ensure that the biological sequences are accurately described in numerical formats, enabling computational analysis without losing critical sequence-specific information. Accordingly, several bioinformatics approaches have been developed that can transform RNA sequences into various statistical equations with the preservation of the uniqueness and inherent patterns of the measures [10][13]. Following the second rule of Chou's 5-step guidelines, several feature extraction techniques have been implemented in this paper to improve the representation of RNA sequences. These techniques include pseudo K-tuple nucleotide composition (PseKNC), comprising methods like PseSNC (Ƙ = 1), PseDNC (Ƙ = 2), and PseTNC (Ƙ = 3). Feature extraction methods are explained in detail in the next section. The PseKNC approach represents RNA sequences as functional vectors by encoding their composition and sequence patterns. This method suppresses detailed order data, focusing on capturing essential features that suggest similarities between RNA samples. By transforming the sequences into structured mathematical representations, PseKNC facilitates efficient computational analysis while preserving key biological characteristics of the RNA [14]. Let us consider an RNA sequence R with N number of nucleotides, represented in Eq. 3.

    R=R1R2R3RiRN

    Where N represents the number of nucleotides in a RNA sequence (i.e. the length of a RNA sequence) and Ri{A,C,G,U} (i=1,2,3,....,L). Where Ri represents a nucleotides at the ith sequence location and A,C,G, U represents Adenine, Cytosine, Guanine and Urine respectively [16],[17].

    The Eq. 3, can be expressed in the general form of the PseKNC as

    R=[φ1φ2φ3...φy....ϕz]T

    In RNA sequence representation, T is the transposed vector representing a mathematical transformation, z represents a numeric value typically corresponding to an output or dependent variable in the analysis, and ϕy represents the actual value of the RNA sequence's feature vector and can be computed using Eq. 5.

    φu={fKtupleu4ki=1fKtupleu+wƛj=1θj(1u4k,u=1,2,3,...)wθu4k4ki=1fKtupleu+wƛj=1θj(4k+1u4k+λ)

    θj={1LK(λ1)LK(λ1)i=1Ci,i+jj1,2,.....,λ,λ<LK

    Ci,i+j=1uλξ=1[Hξ(NiNi+1...Ni+K1)Hξ(Ni+jNi+j+1...Ni+j+K1)]2

    Where θj represent the jth tier correlation factor or jth rank correlation factor that reflects the sequence order correlation in most contiguous K-tuple nucleotides. λ represents the total number correlation rank and w represents the weight. This paper uses the PseKNC technique to convert the provided sequences into discrete feature vectors while maintaining the sequence order data. By designating different values to K (i.e., K = 1, 2, 3) in Eq. 4, three distinct modes of PseKNC were obtained, i.e., PseSNC (K = 1), PseDNC (K = 2), and PseTNC (K = 3), defined as follows:

    RPseSNC=|f1Tuplej=1,...4Df(A,C,G,U)

    RPseDNC=|f2Tuplej=1,...16Df(AA,CC,GG,UU)

    RPseTNC=|f3Tuplej=1,...64Df(AAA,CCC,GGG,UUU)

    This study used three distinct feature extraction methods to encode RNA sequences into discrete feature vectors, as summarized in Table 2. These features include PseSNC, PseDNC, and PseTNC, which integrate pseudo, composition, and transitional probability features to improve the differentiation and interpretation of nucleotide sequences [17][19]. All individual features were incorporated to construct a comprehensive hybrid feature vector by capturing diverse sequence-derived attributes. Machine learning models leveraging hybrid features benefit from combining multiple extraction techniques, enhancing predictive performance by effectively capturing complex data patterns. This approach remains a widely adopted strategy in bioinformatics and genomics for improving model interpretability and accuracy.

    Table 2.  Dimension of feature vector with different values of K.
    Feature extraction methods Features
    Pseudo single nucleotide composition (PseSNC) 4
    pseudo dinucleotide composition (PseDNC) 16
    Pseudo trinucleotide composition (PseTNC) 64
    Hybrid features 84

     | Show Table
    DownLoad: CSV

    Feature selection is critical in developing models to improve overall performance and computational efficiency. Feature selection involves identifying and retaining the most informative features while eliminating irrelevant or redundant ones, which can introduce noise and reduce prediction accuracy. This study employs SHAP (SHapley Additive exPlanations) as a robust feature selection technique. SHAP leverages cooperative game theory to quantify the contribution of each feature to the model's predictions, ensuring that only the most significant features are retained [20]. This approach reduces the dataset's dimensionality and enhances the model's interpretability by providing insights into the importance of individual features. By integrating SHAP into the Deep-m6Am framework, the model achieves optimized computational efficiency and improved generalization, enabling more accurate and reliable identification of m6Am sites in RNA sequences. This feature selection strategy is pivotal in addressing the challenges of high-dimensional data and ensuring the model's robustness and scalability. This approach enhances model interpretability and supports robust data analysis; it can be expressed as in Eq. 11.

    SHAPi(x)=Øi=sN{i}|S|(|N||S|1)|N|[f(S{i})f(S)]

    Where φi represents the SHAP value for the feature i, N is the set of all features, and S is a subset of features excluding i. Then, f(S) is the model's prediction given features in S, and f(S{i}) is the model's prediction given features in S plus feature i. This equation captures the incremental effect of adding the feature i to different subsets of features.

    The network topology of a deep neural network, an algorithm based on machine learning or artificial intelligence inspired by the human brain, includes input and output layers and multiple hidden layers. The mechanism of neuron transmission and activation function in DNN is shown in Figure 2. Unlike traditional processing techniques, DNNs can self-learn and automatically acquire pertinent features from unstructured or raw data. Domains in which DNN has been successfully implemented include speech recognition, NLP (Natural Language Processing) and bioengineering, and imaging [21].

    Figure 2.  The architecture of the proposed deep neural network.

    The proposed architecture utilizes fully connected layers to locate m6Am sites in RNA sequences. The input layer comprises 42 nodes linked to a first hidden layer of 32 nodes through weighted connections. A second hidden layer with 16 nodes processes outputs from the first layer, followed by a third and last layer with 8 nodes. Each layer employs the rectified linear unit (ReLU) activation function, enabling the model to detect nonlinear relationships and complex patterns [22]. The output layer uses the sigmoid activation function for normalized binary classification, distinguishing m6Am and non-m6Am sites in RNA sequences.

    The Deep-m6Am performance is rigorously evaluated using key metrics, including accuracy (ACC), sensitivity (SN), specificity (SP), Matthews correlation coefficient (MCC), and area under the curve (AUC) [23]. SN measures the model's ability to accurately identify true m6Am sites, while SP evaluates its capacity to predict negative cases correctly. ACC reflects the overall correctness of predictions, MCC provides a balanced classification performance assessment, and AUC highlights the model's ability to distinguish between positive and negative instances. These metrics comprehensively evaluate the model's predictive power, ensuring its reliability and effectiveness in identifying m6Am sites.

    ACC=T++TT++F++T+F

    SN = T+T++F

    SP = TT+ F+

    MCC = (TT+)  ( FF+)(f+ + T+)(T++ F)(F++T)(T+F)

    Where T+ symbolizes true positives, F+ symbolizes false positives, T- Symbolizes true negatives, and F- false negatives, respectively.

    In this section, we analyze the hyperparameters of the Deep-m6Am model to optimize its performance. The key hyperparameters considered include learning rate (LR), batch size, number of layers, neurons per layer, and dropout rate. A dropout rate of 0.5 and L2 regularization (0.001) is applied to prevent overfitting, while Xavier initialization ensures stable weight distribution. The model is trained using the Adam optimizer with a learning rate of 0.01 and a momentum of 0.9 to accelerate convergence. Training is conducted for 100 epochs, utilizing ReLU activation functions in the hidden layers and Softmax activation in the output layer for effective learning and classification. A grid search technique was employed to assess the proposed model performance under various hyperparameters, exploring different combinations of parameters. Specifically, the analysis focused on the hyperparameters that significantly influence the performance of the DNN model, including the activation function, learning rate, and number of iterations. Table 3 presents the optimal hyperparameters for the Deep-m6Am.

    Table 3.  Optimal hyperparameters for the DNN model.
    Parameter Optimal value
    Dropout rate 0.5
    Weight initialization function Xavier
    Seed 12345L
    Dropout 0.001
    Number of hidden layers 3
    Optimizer Adam, SGD
    L2 regularization 0.001
    Epochs 100
    Learning rate 0.01
    Batch size 16
    Activation functions ReLU, Softmax
    Momentum 0.9

     | Show Table
    DownLoad: CSV

    In this section, we conduct the performance analysis of the proposed Deep-m6Am model. We conducted experiments to examine the effects of LR. Table 4 presents a detailed comparison of performance metrics across different learning rates and shows how the chosen learning rate significantly impacts the model's effectiveness and reliability.

    Table 4.  Performance metrics across various learning rates (LR).
    LR ACC (%) SN (%) SP (%) MCC
    0.01 83.43 82.64 84.22 0.669
    0.02 80.05 79.71 80.38 0.601
    0.03 79.43 80.27 78.58 0.589
    0.04 78.86 78.58 79.14 0.577
    0.05 78.70 75.00 82.40 0.672

     | Show Table
    DownLoad: CSV

    As shown in Table 4, the Deep-m6Am model achieves optimal performance with a learning rate of 0.01, attaining the highest accuracy (ACC) of 83.43%, sensitivity (SN) of 82.64%, specificity (SP) of 84.22%, and MCC of 0.669. However, as the learning rate increases, the model's performance declines, highlighting that excessively higher learning rates negatively influence overall metrics.

    Figure 3.  Performance comparison across various dropout rates.

    Furthermore, in Figure 3, we analyze the model's fluctuation in performance with different dropout rates, offering valuable guidance for optimizing this hyperparameter. Proper optimization is crucial for balancing generalization and overfitting prevention, ensuring a robust and reliable model. Figure 3 shows that the model achieves optimal performance at a dropout rate of 0.5, with the highest ACC (83.43%) and MCC (66.90%). Performance improves as the dropout rate increases from 0.1 to 0.5, highlighting 0.5 as the most effective rate for balancing generalization and accuracy.

    Figure 4.  Performance comparison across various batch sizes.

    Moreover, we analyze the effect of varying batch sizes on model performance, comparing outcomes across different sizes to identify optimal configurations. Figure 4 illustrates the impact of batch size on model performance, showing a decline as the batch size increases from 16 to 256. The model achieves optimal performance at a batch size of 16, with the highest ACC (83.43%) and MCC (69.90%). As batch size increases, performance gradually decreases, emphasizing the importance of tuning this hyperparameter for optimal results.

    Evaluating the robustness of statistical learning models is essential, and this is typically achieved through validation techniques such as jackknife, k-fold cross-validation, and subsampling. Among these methods, k-fold cross-validation is particularly effective for objectively assessing model performance by dividing the dataset into multiple test sets. This approach ensures a thorough evaluation of the model's generalizability and reliability. Table 5 presents a performance comparison of the proposed Deep-m6Am model using various feature extraction techniques, including individual, hybrid, and SHAP-based feature selection methods.

    Table 5.  5-fold cross-validation performance evaluation.
    Method ACC (%) SN (%) SP (%) MCC
    PseSNC 71.70 66.55 76.40 0.570
    PseDNC 77.73 76.89 78.58 0.555
    PseTNC 79.43 80.27 78.58 0.589
    Hybrid features 80.83 80.27 81.40 0.617
    Hybrid features after SHAP 83.43 82.64 84.22 0.669

     | Show Table
    DownLoad: CSV

    Table 5 highlights the varying predictive performance of individual features, with PseSNC, PseDNC, and PseTNC achieving ACCs of 71.70%, 77.73%, and 79.43%, respectively. The hybrid feature approach significantly improves classification, reaching an ACC of 80.83%. Further enhancement through SHAP-based feature selection optimizes feature importance, achieving the highest ACC (83.43%) and MCC (0.669). These results underscore the effectiveness of hybrid features in capturing complex patterns and the role of SHAP in refining feature selection for improved model performance.

    In this section, we provide an analysis of the DNN model in comparison to well-known machine learning algorithms such as K-nearest neighbor (KNN), random forest (RF), decision tree (DT), naive Bayes (NB), and support vector machine (SVM) [16],[24][26]. Table 6 illustrates the importance of evaluating model performance across different classifiers. We employed a 5-fold cross-validation scheme to ensure a reliable and unbiased performance assessment.

    Table 6.  Performance comparison with ML algorithms on 5-fold cross-validation.
    Classifiers ACC (%) SN (%) SP (%) MCC
    RF 68.72 66.91 70.53 0.667
    DT 71.80 70.22 73.38 0.706
    KNN 77.15 75.62 78.68 0.741
    NB 79.99 78.35 81.63 0.712
    SVM 82.53 81.96 83.09 0.651
    Deep-m6Am 83.43 82.64 84.22 0.669

     | Show Table
    DownLoad: CSV

    Table 6 shows that Deep-m6Am outperforms other ML algorithms, achieving the highest ACC (83.43%) and MCC (0.669). SVM follows with an ACC of 82.53%, while NB and KNN achieve 79.99% and 77.15%, respectively. DT (71.80%) and RF (68.72%) perform lower. These results highlight Deep-m6Am as the most effective model for m6Am site identification. To analyze further, we evaluate the proposed model performance using the Area Under the ROC Curve (AUC), as shown in Figure 5. Figure 5 show that the proposed model achieved an AUC value of 0.853, indicating excellent performance compared with widely used ML algorithms.

    Figure 5.  AUC performance comparison with commonly used classifiers using 5-fold cross-validation.

    Furthermore, Table 7 evaluates various ML algorithms on an independent dataset to assess generalizability and robustness. From Table 7, the proposed Deep-m6Am model demonstrated superior performance among the ML classifiers, achieving an ACC of 82.86% with an MCC of 0.657%. The SVM classifier had an ACC of 81.64% with an MCC of 0.632. In contrast, KNN achieved an ACC of 75.45%, while NB, DT, and RF performed at 77.29%, 68.88%, and 66.22%, respectively. This analysis identifies Deep-m6Am as the top-performing model, showcasing its superiority in handling dataset complexities and ensuring reliable and accurate m6Am site prediction.

    Table 7.  Performance comparison with ML algorithms on the independent dataset.
    Classifiers ACC (%) SN (%) SP (%) MCC
    RF 66.22 64.50 68.00 0.325
    DT 68.88 67.10 70.66 0.378
    KNN 75.45 73.20 77.70 0.509
    NB 77.29 75.20 79.38 0.545
    SVM 81.64 79.50 83.78 0.632
    Deep-m6Am 82.86 83.65 82.07 0.657

     | Show Table
    DownLoad: CSV

    In this section, we conduct a detailed comparative analysis of the proposed Deep-m6Am predictor against several state-of-the-art predictors, including MultiRM [6], m6AmPred [7], DLm6Am [8], and EMDL_m6Am [9]. This comparison is shown in Table 8.

    Table 8.  Performance comparison with existing models on the independent dataset.
    Predictor ACC (%) SN (%) SP (%) MCC
    MultiRM [6] 71.13 78.59 63.66 0.427
    m6AmPred [7] 73.10 72.11 74.08 0.462
    DLm6Am [8] 79.55 81.71 77.40 0.591
    EMDL_m6Am [9] 80.98 82.25 79.72 0.619
    Deep-m6Am 82.86 83.65 82.07 0.657

     | Show Table
    DownLoad: CSV

    From Table 8, the MultiRM achieved an ACC of 71.13% and MCC of 0.427, while m6AmPred had an ACC of 73.10% and MCC of 0.462. DLm6Am demonstrated an ACC of 79.55% and MCC of 0.591, and EMDL_m6Am obtained an ACC of 80.98% and MCC of 0.619. In comparison, the proposed Deep-m6Am outperformed all these models, achieving the highest ACC of 82.86% and MCC of 0.657. These results highlight the superior predictive accuracy and robustness of Deep-m6Am for m6Am site identification, making it the most effective model among the evaluated predictors.

    The biological function of N6,2′-O-dimethyladenosine (m6Am) in RNA sequences underscores its critical role in regulating post-transcriptional processes, RNA stability, and translation. This study introduces the Deep-m6Am model, which employs a hybrid feature extraction approach, incorporating SHAP (SHapley Additive exPlanations) feature selection and DNN classifier to precisely identify m6Am sites within RNA sequences. Through 5-fold cross-validation, compared with popular ML methods, Deep-m6Am demonstrated unique advantages that resulted in more precise m6Am site predictions. Furthermore, the proposed Deep-m6Am model showed superior performance metrics, achieving an average accuracy of 82.86% compared to the existing models. These results underscore the potential of Deep-m6Am as a reliable and efficient tool for advancing RNA modification analysis.

    Future research could expand Deep-m6Am to analyze other RNA modifications and integrate multi-omics data for enhanced predictive accuracy. Exploring its role in disease-specific studies could advance precision medicine. Optimizing computational efficiency through transfer learning, hyperparameter optimization, and parallel programming will improve the model's scalability and applicability in RNA biology and medical research [27].



    [1] D. C. Montgomery, E. N. Loredo, D. Jearkpaporn, M. C. Testik, Experimental designs for constrained regions, Qual. Eng., 14 (2002), 587–601. doi: 10.1081/QEN-120003561
    [2] J. J. Borkowski, G. F. Piepel, Uniform designs for highly constrained mixture experiments, J. Qual. Technol., 41 (2009), 35–47. doi: 10.1080/00224065.2009.11917758
    [3] R. D. Snee, D. W. Marquardt, Extreme vertices designs for linear mixture models, Technometrics, 16 (1974), 399–408. doi: 10.1080/00401706.1974.10489209
    [4] T. J. Mitchell, An Algorithm for the construction of D-optimal experimental designs, Technometrics, 16 (1974), 203–210.
    [5] R. D. Cook, C. J. Nachtsheim, A comparison of algorithms for constructing exact D-optimal designs, Technometrics, 22 (1980), 315–324. doi: 10.1080/00401706.1980.10486162
    [6] A. Heredia-Langner, D. C. Montgomery, W. M. Carlyle, C. M. Borror, Model-robust optimal designs: A genetic algorithm approach, J. Qual. Technol., 36 (2004), 263–279. doi: 10.1080/00224065.2004.11980273
    [7] A. Heredia-Langner, W. M. Carlyle, D. C. Montgomery, C. M. Borror, G. C. Runger, Genetic algorithms for the construction of D-optimal designs, J. Qual. Technol., 35 (2003), 28–46. doi: 10.1080/00224065.2003.11980189
    [8] Y. Yu, D-optimal designs via a cocktail algorithm, Stat. Comput., 21 (2010), 475–481.
    [9] Y. Liu, M. Q. Liu, Construction of uniform designs for mixture experiments with complex constraints, Commun. Stat.-Theor. M., 45 (2015), 2172–2180.
    [10] G. Li, C. Zhang, Random search algorithm for optimal mixture experimental design, Commun. Stat. Theor. M., 47 (2017), 1413–1422.
    [11] J. Duan, W. Gao, H. K. T. Ng, Efficient computational algorithm for optimal continuous experimental designs, J. Comput. Appl. Math., 350 (2019), 98–113. doi: 10.1016/j.cam.2018.09.046
    [12] W. K. Wong, R. B. Chen, C. C. Huang, W. Wang, A modified particle swarm optimization technique for finding optimal designs for mixture models, PLoS One, 10 (2015), e0124720.
    [13] P. Y. Yang, F. I. Chou, J. T. Tsai, J. H. Chou, Adaptive uniform experimental design based fractional order particle swarm optimizer with non-linear time varying evolution, Appl. Sci., 9 (2019), 5537. doi: 10.3390/app9245537
    [14] K. Price, Differential evolution: A fast and simple numerical optimizer, In: Proceedings of North American Fuzzy Information Processing, 1996,524–527.
    [15] R. Storn, K. Price, Differential Evolution — A Simple and Efficient Heuristic for global optimization over continuous spaces, J. Global. Optim., 11 (1997), 341–359. doi: 10.1023/A:1008202821328
    [16] K. V. Price, R. M. Storn, J. A. Lampinen, Differential evolution-A practical approach to global optimization, Springer, Berlin, 2005.
    [17] Z. Zhao, J. Z. Wang, J. Zhao, Z. Y. Su, Using a Grey model optimized by Differential Evolution algorithm to forecast the per capita annual net income of rural households in China, Omega, 40 (2012), 525–532. doi: 10.1016/j.omega.2011.10.003
    [18] K. Rajesh, A. Bhuvanesh, S. Kannan, C. Thangaraj, Least cost generation expansion planning with solar power plant using Differential Evolution algorithm, Renew. Energ., 85 (2016), 677–686. doi: 10.1016/j.renene.2015.07.026
    [19] W. Xu, W. K. Wong, K. C. Tan, J. Xu, Finding high-dimensional D-optimal designs for logistic models via differential evolution, IEEE Access 7 (2019), 7133–7146.
    [20] W. Deng, J. J. Xu, X. Z. Gao, H. M. Zhao, An enhanced MSIQDE algorithm with novel multiple strategies for global optimization problems, IEEE T. Syst. Man Cy-S., (2020), 1–10.
    [21] J. Kiefer, Optimum experimental designs, J. R. Stat. Soc. B., 21 (1959), 272–319.
    [22] R. H. Myers, D. C. Montgomery, G. G. Vining, T. J. Robinson, Generalized Linear Models: With Applications in Engineering and the Sciences, 2 Eds., John Wiely & Sons, New York, 2002.
    [23] A. Dasgupta, S. Mukhopadhyay, W. J. Studden, Compromise designs in heteroscedastic linear models, J. Stat. Plan. Infer., 32 (1992), 363–384. doi: 10.1016/0378-3758(92)90017-M
    [24] K. Chaloner, Optimal bayesian experimental design for linear models, Ann. Stat., 12 (1984), 283–300.
    [25] R. D. Cook, V. V. Fedorov, Constrained optimization of experimental design, Statistics, 26 (1995), 129–178. doi: 10.1080/02331889508802474
    [26] J. A. Cornell, Experiments with mixtures: designs, models and the alysis of mixture data, 3 Eds., John Wiely & Sons, New York, 2002.
    [27] J. Kiefer, J. Wolfowitz, Optimum extrapolation and interpolation designs Ⅱ, Ann. I. Stat. Math. 16 (1964), 295–303.
  • Reader Comments
  • © 2021 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(1790) PDF downloads(53) Cited by(6)

Figures and Tables

Figures(2)  /  Tables(4)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog