RAMRSGL: A Robust Adaptive Multinomial Regression Model for Multicancer Classification

In view of the challenges of the group Lasso penalty methods for multicancer microarray data analysis, e.g., dividing genes into groups in advance and biological interpretability, we propose a robust adaptive multinomial regression with sparse group Lasso penalty (RAMRSGL) model. By adopting the overlapping clustering strategy, affinity propagation clustering is employed to obtain each cancer gene subtype, which explores the group structure of each cancer subtype and merges the groups of all subtypes. In addition, the data-driven weights based on noise are added to the sparse group Lasso penalty, combining with the multinomial log-likelihood function to perform multiclassification and adaptive group gene selection simultaneously. The experimental results on acute leukemia data verify the effectiveness of the proposed method.


Introduction
With the development of technology, the scale of data is constantly increasing, and the dimension of data is rapidly expanding. Data as diverse as transaction data, user rating data, Web usage data, gene expression data, and multimedia data can have hundreds or thousands of dimensions and even more [1]. Therefore, the microarray data has the characteristics of small sample and ultrahigh dimension [2]. The birth of microarray data makes it possible to diagnose complex diseases such as cancer at the genetic level. In the process of using gene expression data for diagnosis, genes are treated as characteristics or attributes, and tissue samples are labeled as specific types, such as tumor tissue or normal tissue, various subtypes of cancer. The classifier is then constructed using machine learning methods to predict the types of the new sample [3][4][5][6]. However, only a few genes are closely related to cancer diagnostic tasks for the microarray gene expression data. Therefore, although the classification process is completely consistent with the traditional data, cancer classification based on the gene expression data still faces great challenges [7,8].
Due to the characteristics of automatic variable selection, sparse regression methods [9][10][11][12][13] have attracted a surge of attention in cancer diagnosis and gene selection. To tackle the problem that the l 1 regularization has a biased gene selection and does not have the oracle property, Wu et al. [13] in 2018 have investigated l 1 /l 2 regularized logistic regression for gene selection in high-dimensional cancer classification. In terms of classification performance, the experimental results on three DNA microarray datasets demonstrate that the proposed method outperforms other commonly used sparse methods. To address the problem that there are high correlations among genes, a two-stage sparse logistic regression has been proposed by Algamal and Lee [12] in 2019, which is aimed at obtaining an efficient subset of genes with high classification capabilities by combining the screening approach as a filter method and adaptive Lasso with a new weight as an embedded method. The experimental results demonstrate that the top selected genes are biologically related to the cancer type, which is useful for cancer classification using DNA gene expression data in real clinical practice. To handle the group structures of the time-dependent clinical variables in the model, Zhang et al. [10] in 2020 have developed a high-dimensional logistic regression and introduced the group spline-penalty or group smooth-penalty. This method is easy to implement since it can be turned into a group minimax concave penalty problem after certain transformations.
Yuan and Lin [14] first proposed a group Lasso regression model using l 2 -norm penalty. Group Lasso [15][16][17] can generate interpopulation sparsity, i.e., automatic identification of important gene groups. To identify several important genes but not all genes in the same group, Simon et al. [18] proposed the sparse group Lasso. Since both the l 1 -norm penalty and the l 2 -norm penalty are introduced into the model, it can generate both intergroup sparsity and intragroup sparsity. By introducing the weighted gene coexpression network analysis and information theory into the sparse group Lasso, Li et al. [19] proposed three criteria for evaluating the importance of genes within the population and then proposed the adaptive sparse group Lasso model. Generally, the group Lasso methods rely on early grouping, so it is important to choose an appropriate grouping method. To this end, various algorithms have been proposed. Clustering, the most popular, has been used since the first gene expression dataset is born and is still the most widely used [20,21]. Furthermore, clustering methods can be divided into four categories: prototype-based clustering [22,23], density-based clustering [24,25], hierarchical clustering [26,27], and spectral clustering [28]. For gene expression data, Sharan et al. [29] proposed a clustering algorithm by linking kernels, which is named CLICK. The CLICK algorithm uses graph theory and statistical techniques to identify tight groups of highly similar elements and then uses some heuristic process to extend kernel extensions into modules. Weighted gene coexpression network analysis (WGCNA) [30] is a clustering method developed for microarray data, which improves the classical bottom-up clustering algorithm. Instead of slicing a tree at a certain height like traditional hierarchical clustering, WGCNA uses a dynamic tree slicing algorithm to ensure that the resulting clustering meets several criteria related to cohesion and separation. Affinity propagation (AP) is a spectral-based clustering algorithm proposed by Frey and Dueck in 2007 [31]. AP clustering takes the similarity measure between data points as input and then automatically identifies a group of high-quality clustering centers and corresponding clusters through the continuous transmission of two kinds of real value information between data points.
It is necessary to construct a robust sparse regression model for high-dimensional data with noise [32][33][34][35]. Traditional least square methods may not produce reliable estimators, while the least absolute deviation (LAD) estimator is an effective robust regression method. Wang et al. [36] proposed LAD-Lasso by combining LAD and Lasso, which can not only estimate parameters and select variables at the same time but also has strong resistance to heavy tail error or response outliers. In addition, the parameters of LAD-Lasso are easy to estimate and have oracle properties. However, LAD loss is not applicable for small residuals, especially when there is no heavy tail error and no outliers, the estimator shows poor performance. To improve on that, Lambert-Lacroix and Zwald [37] proposed a robust regression model combining Huber criterion and adaptive Lasso penalty. Huber criterion is also an effective method of robust regression. It is a mixture of the square error of relatively small error and the absolute error of relatively large error, which makes the model have good performance regardless of the size of residuals. To alleviate the influence of conversion parameters on the performance of Huber Lasso, Zheng et al. [38] proposed a convex combination of adaptive Lasso and LAD-Lasso with data-driven power, namely, robust adaptive Lasso (RA-Lasso).
To solve multiclassification problems effectively, Vincent and Hansen [39] introduced sparse group Lasso penalty into multinomial log-likelihood function, proposed multinomial sparse group Lasso model, and developed the solution algorithm. Due to this model adopts the method of random grouping, the obtained groups are not of biological significance. Li et al. [19] used WGCNA to cluster genes in advance, introduced a clustering method that could better explain the structure of genes, and then proposed an adaptive multinomial regression model with sparse overlap group Lasso penalty. Although these methods [40,41] can solve the multiclassification problems in cancer diagnosis well, how to build a robust multinomial regression model for noisy data and how to use the noise information to construct datadriven weights so as to further increase the robustness of the model are problems that need to be solved.
In this paper, to obtain biologically significant gene clusters for each cancer subtype, AP clustering is used to cluster the three acute leukemia subtypes in advance on the noiseremoved data. Then, the noise matrix is used to construct data-driven weights, based on which an adaptive sparse group Lasso penalty for multicancer microarray data is proposed. Furthermore, a robust adaptive multinomial regression model with sparse group Lasso penalty (RAMRSGL) is proposed based on log-likelihood loss, and a regularization solution algorithm is developed.
The structure of the rest paper is as follows: in Section 2, we first define the multiclassification problem and then elaborate the RAMRSGL model. Section 3 verifies the effectiveness of the proposed model through experiments. Section 4 eventually summarizes the whole paper.

Problem and Method
2.1. Preliminaries. Since a cancer often has different subtypes, cancer diagnosis requires not only determining whether a patient has cancer but also accurately identifying the type of cancer they have. As a result, cancer diagnosis can be modeled as a multiclassification problem. Suppose cancer has K ðK ≥ 3Þ subtypes and a gene expression dataset D = fðx 1 , y 1 Þ, ðx 2 , y 2 Þ,⋯,ðx N , y N Þg contains N samples, where x i ∈ ℝ M and y i ∈ f1, 2,⋯,Kg are the gene expression sample and its label, respectively. For notation convenience, let X = ðx 1 , x 2 ,⋯,x N Þ T and y = ðy 1 , y 2 ,⋯,y N Þ T denote the sample matrix and its corresponding label vector, respectively. To identify the type of new sample x, we need to construct a decision function f ðxÞ with K discriminant functions f k , i.e., Generally, linear discriminant function f k ðxÞ = β ðkÞ T x + β ðkÞ 0 is most widely used. Therefore, the construction of the decision function is always transformed into the problem of solving the optimal parameters β ðkÞ and β ðkÞ 0 of each discriminant function.
The above regression coefficients can be usually solved by the following Lasso model [42]: where λ ≥ 0 is the regularization parameter. By using the l 1 -norm penalty, some coefficients that correspond to the features can be reduced to zero. To select features in groups, Yuan and Lin [14] proposed group Lasso (GL) in 2006.
where X ðlÞ and β ðlÞ are the subset of the l-th group, and m l represents the number of the l-th group. To generate both intergroup sparsity and intragroup sparsity, Simon et al. proposed sparse group Lasso (SGL) [18] in 2013.
where 0 ≤ α ≤ 1 is also the regularization parameter. SGL penalty is a convex combination of Lasso penalty and group Lasso penalty, which can achieve two kinds of sparsity simultaneously. To achieve adaptive population gene selection, Li et al. proposed adaptive sparse group Lasso (ASGL-CMI) in 2017.
where W is the weight constructed based on information theory. The ASGL-CMI can adaptively select the important genes in the selected population by introducing the weight with biological significance. The real gene expression datasets often have some missing values and contain noise, while the current models mostly ignore the point. Therefore, this paper is devoted to establish a robust classification model for gene expression data with noise and effectively identify the important genes related to cancer.

Robust Adaptive Multinomial Regression with Sparse
Group Lasso Penalty. First, the input sample matrix is decomposed through robust principal component analysis. Then, the overlapping clustering strategy is adopted to cluster the genes on the leukemia data with noise removed by AP clustering, and the weight is constructed by using the noise matrix. Finally, the RAMRSGL model is constructed according to the clustering results and weight.

Robust Principal Component Analysis.
It is assumed that the gene expression data X conforms to the noise distribution, and the noise is usually sparse. As a modification of the widely used statistical procedure of principal component analysis (PCA), the robust principal component analysis (RPCA) works well with respect to grossly corrupted data [43]. Therefore, X can be decomposed into a low-rank matrix D and the noise matrix E using RPCA, i.e., where k·k å = ∑ σð·Þ denotes the nuclear norm, i.e., the sum of its singular values; k·k 1 = ∑ j·j denotes the l 1 -norm, i.e., the sum of its absolute values. Due to D represents the clean matrix containing the information of the original data structure and E represents the sparse noise matrix, both components are of arbitrary magnitude.

Gene Clustering.
As a clustering algorithm based on the concept of message passing, affinity propagation (AP) provides a new method to reveal the inter-relationships between genes. Let sði, kÞ be a function that quantifies the similarity between any two genes x i and x k , let rði, kÞ be a function that quantifies how well-suited x k is to serve as the clustering center for x i , relative to other candidate clustering centers for x i , and let aði, kÞ be a function that quantifies how appropriate it would be for x i to pick x k as its clustering center, taking into account other points preference for x k as a clustering center. According to Frey and Dueck in [31], the algorithm performs the following updates iteratively. First, responsibility updates are sent around: Then, availability is updated as follows: Iterations are performed until either the cluster boundaries remain unchanged over a number of iterations, or some if l = i, then, the data point i can be served as a clustering center; otherwise, the data point l is seen as a clustering center of i. In the implementation of AP clustering, we use negative squared Euclidean distances to measure the similarity, referring to [31] for more details.
Considering that the subtype genes of each cancer may have a specific group structure, the overlapping clustering strategy is adopted, and AP clustering is performed on the data of each cancer to cluster genes. To avoid the influence of noise, the clean data D obtained by decomposition is grouped, and the specific process is as follows: Step 1. D T is divided into K sub-matrices depending on different sample labels.
Step 2. K symmetric metric matrices are constructed by using Pearson correlation coefficient.
Step 3. Based on the above metric matrices, AP clustering is carried out for each kind of data sample to obtain K group indicator vectors v 1 , v 2 , ⋯, v K , the corresponding group sequence of the vector elements specified by the gene.
Step 4. Expand the dimension of input matrix D: Step 4.1. According to v 1 , v 2 , ⋯, v K , rearrange the columns of D, and then get K matrices D 1 , D 2 , ⋯, D K ; Step 4.2. The expanded dimension matrix D ∈ ℝ n×KM is obtained by combining D 1 , D 2 , ⋯, D K by row.
Step 5. The group index vector v is constructed according to the specific group sequence in the data matrix after dimensional expansion. Let V denotes the maximum value of v, i.e., a total of V groups are obtained.

Model Construction.
Since each gene is repeated K times in the expanded dimension matrix D, to maintain the correspondence between the noise information and the data after dimensional expansion, the noise matrix E should be expanded accordingly. As such, rearrange the columns of E according to v 1 , v 2 , ⋯, v K and then get K matrices E 1 , E 2 , ⋯, E K . The expanded dimension matrix E ∈ ℝ n×KM is obtained by combining E 1 , E 2 , ⋯, E K by row. Obviously, the more noisy the gene is, the less important it is. Without loss of generality, we use the following gene reliability criterion: where s ðlÞ t represents the importance of the t-th gene in the l-th group. According to contraction theory, the regression coefficients of more important genes should be given less weight. Therefore, the weight of the t-th gene in the l-th group can be represented as follows: Further, the weight vector w can be obtained.
For the K-classification problem, the regression coefficients corresponding to each discriminant function need to be determined, so a total of K × ðKMÞ regression coefficients need to be determined. Considering that the coefficients corresponding to the same gene in each discriminant function should have the same weight, the weight vector w should be repeated K times to obtain K identical row vectors, and these K identical row vectors Solution algorithm of RAMRSGL.
The multinomial log-likelihood function does not need to presuppose the distribution of the data, and it can directly model the possibility of classification, so the loss function is used to estimate the empirical risk. By introducing adaptive multiclass sparse group Lasso penalty into multinomial log-likelihood function, this paper presents the following robust adaptive multinomial regression with sparse group Lasso penalty (RAMRSGL):  622  2782  185  1800  1617  2293  835  1314  2462  1114  2259  1922  2574  3551  791  1679  1206  2369  125  1363  2550  3327  2615  2781  298  3510  3077  2455  2923  2107  215  2109  3325  1108  1847  515  1879  2003  3333  where y ik = Iðy i = kÞ is the indicator function, i.e., if the sample belongs to class k, y ik = 1; otherwise, y ik = 0.
For multiclassification problems, the penalty term ∑ K k=1 ∑ V l=1 ffiffiffiffiffi m l p kβ ðkÞ l k 2 enables RAMRSGL to select important gene groups for all discriminant functions. We also construct data-driven weights using the decomposed noise information, which enables adaptive gene selection within each group. At the same time, by introducing noise information into the model, the robustness of the model is further enhanced.

Solution Algorithm.
Solving the group Lasso optimization problem is around for some time, e.g., Similä and Tikka [44] have developed an interesting application to multiresponse linear regression. Due to l 1 -norm penalty is not differentiable at the origin, group Lasso algorithms cannot be used to compute a solution to the sparse group Lasso optimization problem. Inspired by Vincent and Hansen [39], we also adopt the algorithm of block coordinate descent, comprising of the outer, middle, and inner coordinate descent loop.
In this work, the proposed RAMRSGL model is used to conduct multiclassification problem and gene selection on the gene expression data of multiple carcinomas. The specific steps are elaborated in Algorithm 1, which is implemented using the R language version of MSGL toolkit (https:// github.com/nielsrhansen/msgl) proposed by Vincent and Hansen. The maximum iterations of the proposed RAMRSGL model are set to i max = 1000. Moreover, its convergence is proved theoretically, more details in [39].
Although AP clustering does not need to specify the number of clustering in advance, the final number of clustering is affected by the parameter of pðiÞ, which is the reference degree with the point i as clustering center. This means that the higher the value pðiÞ is, the greater the possibility of this point becoming the clustering center is. For genes, since each data point has the same possibility of being the clustering center, all pðiÞ is set to the same value, which is denoted as p.

Experiments
3.1. Dataset. The acute leukemia gene expression dataset is provided by Golub et al. [45], which contains 72 samples consisting of 7129 genes. According to [46], the diagnosis of acute leukemia can be considered as a tri-classification problem, with 38 samples of B-cell acute lymphoblastic leukemia (BALL), 9 samples of T-cell acute lymphoblastic leukemia (TALL), and 25 samples of acute myeloid leukemia (AML). Using the data preprocessing method in [45], 3571 important genes are selected preliminarily. In this paper, preprocessed data is used for the experiment, i.e., a dataset containing 72 samples of 3571 genes. The data is randomly divided into two parts, two-thirds for training and onethird for testing. In order to ensure the class balance of the data, 25 BALL samples, 6 TALL samples, and 17 AML samples are randomly selected as the training set, and the remaining 24 samples are used as the test set.

Clustering
Results. AP clustering is performed on BALL, TALL, and AML, respectively, and the heatmaps of AP clustering are shown in Figure 1. Table 1 elaborates the detailed results of AP clustering. According to the clustering strategy, take the default reference p = −26:62758 in BALL class. The 3571 genes are automatically divided into 42 clusters, among which the second cluster has the largest number of genes (252 genes), the first cluster has the smallest number of genes (22 genes), and most of the other clusters have about 100 genes. In TALL class, the default reference p = −6:286937 is taken, and the genes are automatically divided into 36 clusters. Among the 36 clusters, the number of genes varies greatly, with the largest cluster containing 347 genes and the smallest cluster containing only 17 genes. In AML class, the default reference p = −17:206 is taken, and the genes are divided into 41 clusters, with the largest containing 273 genes and the smallest containing 22 genes. Think of each cluster as a group, and each duplicated gene as a new gene. A total of 10713 genes are obtained by placing the 119 gene groups in a specific order. Table 1 also reports the fact iterations of the algorithm, from which it can be seen that AP clustering on all datasets can achieve convergence within a finite number of steps.

Performance Comparison.
In this paper, the proposed RAMRSGL algorithm is compared with adaptive multinomial regression with sparse group Lasso (AMRSGL),

MIF 51
Macrophage migration inhibitory factor MIF encodes a lymphokine involved in cell-mediated immunity, immunomodulation, and inflammation. Srpr 84 Signal recognition particle receptor Srpr plays a role in signal recognition of particle binding.

DGUOK 46
Deoxyguanosine kinase The protein encoded by DGUOK is responsible for phosphorylation of purine DNA in the mitochondrial matrix.

SRI
88 Sorcin SRI encodes a calcium-binding protein that regulates intracellular calcium homeostasis.

HSPB1 105
Heat shock protein family B member 1 HSPB1 encodes proteins that play important roles in the differentiation of a variety of cell types. X43  X18  X35  X36  X6  X38  X27  X7  X39  X31  X9  X3  X42  X22  X13  X34  X23  X14  X21  X17  X33  X26  X20  X24  X1  X66  X69  X51  X45  X11  X61  X72  X63  X29  X71  X64  X41  X25  X32  X12  X52  X37  X46  X44  X40  X16  X8  X62  X67  X28  X50  X48  X58  X57  X56  X65  X53  X5  X2  X60  X54  X49  X30  X19  X59  X10  X68  X47  X55  X15  X70   Computational and Mathematical Methods in Medicine multinomial regression with sparse group Lasso penalty (MRSGL), multinomial regression with group Lasso penalty (MRGL), and multinomial regression with Lasso penalty (l 1 -norm MR). RAMRSGL is used to conduct experiments on the clean data obtained by decomposition, and the genes are clustered in advance by AP clustering. The other four methods are all tested on the original data. AMRSGL, MRSGL, and MRGL also used WGCNA for gene clustering, while l 1 -norm MR method does not require clustering in advance. The first three of the above methods have two model parameters α and λ that need to be determined. The last two have only one parameter λ to determine. Table 2 presents the average classification accuracy and average number of selected genes of 10 experiments with different methods on the acute leukemia dataset, with standard deviation in brackets. As can be seen from Table 2, these five methods have achieved high classification accuracy, all reaching more than 94%. The proposed RAMRSGL method has the highest average classification accuracy, 95.8%, which is 0.4%, 0.8%, 0.4%, and 1.2% higher than the other four methods, respectively. AMRSGL and MRGL have achieved a suboptimal classification accuracy of 95.4%, and l 1 -norm MR has achieved the lowest classification accuracy of 94.6%. RAMRSGL achieved the smallest standard deviation, indicating that the method is more stable than other methods. It should be noted that the average number of selected genes varies greatly among the five methods. The MRGL method has the most genes selected, with an average number of 571.7. The average number of selected genes was only 21.7 by l 1 -norm MR method and 52.2 by RAMRSGL method. To sum up, the proposed RAMRSGL method has the highest classification accuracy and high simplicity, which makes the model easier to be interpreted.
In addition, to further illustrate the robustness of the proposed model and the effectiveness of AP clustering, the experimental results of the three methods on the decomposed clean data are presented in Table 3. Both MRSGL and MRGL use AP clustering to cluster genes in advance, while l 1 -norm MR does not cluster. The parameter selection method is consistent with the above. As can be seen from Table 3, the classification accuracy of these three methods on clean data is higher than before, and the variance is relatively small. It is proved that the use of robust principal component analysis can improve the model performance. Otherwise, the deviation of the prediction accuracy in Table 3 is higher than the proposed method in Table 2, which proves that the proposed method using AP clustering is more robust. In terms of gene selection, the experimental results of MRSGL and MRGL methods are significantly different from those of the previous ones, with the average number of selected genes being significantly reduced. The ability to achieve high accuracy with fewer genes is very attractive. After AP clustering is used for gene clustering in advance, fewer genes are selected by these methods, which may benefit from the fact that AP clustering can well reveal the group structure between genes, so as to achieve more accurate gene selection.

Gene Selection.
In each experiment, as can be seen in Algorithm 1, we extract the nonzero coefficients β ⋆ of the optimal model and determine the corresponding genes and groups. By selecting genes that appear 9 or more times in 10 experiments as key genes, RAMRSGL has identified 9 key genes on the leukemia dataset. Seven gene replicates are selected for 10 times, and two gene replicates are selected for 9 times. Table 4 lists seven genes and their corresponding group sequences that are present in each experiment. In addition, through the search of these genes in the NCBI database, the functional annotations of these 7 genes are also given in Table 4. Figure 2 shows the heat map of the selected seven genes in different samples. It can be seen that genes HSPB1 and MIF have similar expressions in different samples and can be grouped into one group, while Srpr, SRI, DGUOK, and LRRC14 can be grouped into another group. It is concluded that these genes have similar functions or are jointly involved in some gene pathways. Figure 3 illustrates the volcano plot for differential expression of 3571 genes where the differentially expressed genes are selected by the threshold p < 0:05ð log 2 FC < 1 and log 2 FC>−1Þ. As can be seen from Figure 3, among the 7 screened genes, the expressions of SRI, Srpr, HSPB1, and DGUOK are significantly upregulated, while the expressions of MIF, LRRC14, and CDK1 are significantly downregulated. The bubble diagram of genes selected in an experiment is shown in Figure 4. It can be seen from Figure 4 that the cell pathways involved in these genes mainly include viral myocarditis, tuberculosis, transcription disorders in cancer, hematopoietic cell lineage, and B cell signaling pathway. In addition, more of these genes are involved in cancer transcription disorders, and more are involved in viral infection.
Combined with gene function and literature, the relationship between five key genes and cancer is expounded.  in the mitochondrial matrix. This protein phosphorylates several purine deoxyribonucleoside analogs used in the treatment of lymphoproliferative disorders, and this phosphorylation is critical for the effectiveness of the analogs. Wu et al. [47] have found that DGUOK-AS1 is upregulated in cervical squamous cell carcinoma and intracervical adenocarcinoma (CESC) tissues. Their research has also shown that DGUOK-AS1 is highly expressed in liver cancer cell lines and can promote the proliferation of cervical cancer cells by releasing EMSY as the ceRNA of miR-653-5p.

MIF.
This gene encodes a lymphokine involved in cellmediated immunity, immune regulation, and inflammation. By inhibiting the anti-inflammatory effects of glucocorticoids, it regulates the function of macrophages in host defense. Osipyan et al. [48] have found that MIF can trigger the mitogen-activated protein kinase and phosphoinosinic acid 3-kinase signaling pathways by binding to CD74 and other receptors. The change in the expression value of MIF and changes in the active state of connection pathways are related to inflammatory diseases and cancer.
3.4.3. CDK1. The protein encoded by this gene is a member of the Ser/Thr protein kinase family. This protein is the catalytic subunit of the highly conserved protein kinase complex M-phase promoting factor (MPF), which plays an important role in the transition of the G1/S and G2/M phases of the eukaryotic cell cycle. The mitotic cyclin binds to the protein stably and functions as a regulatory subunit. The phosphorylation and dephosphorylation of this protein also play an important regulatory role in cell cycle control. Huang et al. [49] have studied the mechanism of CDK1 in lung cancer and found that CDK1 is regulated by NF-KB through a hypothetical KB site in its proximal promoter.

Srpr.
This gene encodes a subunit of the endoplasmic reticulum signal recognition particle receptor, and together with the signal recognition particle, it participates in the targeting and translocation of secreted proteins and cell membrane proteins marked by signal sequences. Alternative splicing leads to multiple transcriptional variations. Kim et al. [50] have found that Srpr is highly expressed in epidermal keratinocytes and regulates the proliferation of keratinocytes by affecting cell cycle progression.
3.4.5. HSPB1. This gene encodes a protein of the small heat shock protein (HSP20) family. This protein plays an important role in the differentiation of many cell types. The expression of this gene is associated with the adverse clinical outcomes of a variety of human cancers. The encoded protein can promote the proliferation and metastasis of cancer cells, while protecting cancer cells from apoptosis. Rajesh et al. [51] have established Fli-1 (Fli-1), a member of the Ets family, which plays a transcriptional regulatory role on the HSPB1 gene. Fli-1 binds to the nucleotide residues GGAA at binding sites 3, 6, and 7 in the 5-kb region upstream of HSPB1. Fli-1 is related to oncogenic transformation and upregulation in radio/TMZR GBM.

Conclusions
In this paper, a robust adaptive multinomial regression model with sparse group Lasso penalty is proposed and its solution algorithm is developed, based on robust principal component analysis and AP clustering with overlapping strategy. The proposed method is applied to the diagnosis of triple-cancer leukemia, and the accuracy of diagnosis is up to 95.8%, which is better than other state-of-the-art methods. In addition, seven key genes are screened out, and the relationship between five key genes and cancer is 11 Computational and Mathematical Methods in Medicine expounded in combination with gene function and relative literature. In the future, the nonlinear problem will be studied.

Data Availability
The acute leukemia gene expression dataset is provided by Golub et al., which can be download at https://www.kaggle .com/crawford/gene-expression.