 Research
 Open Access
 Published:
Multicancer samples clustering via graph regularized lowrank representation method under sparse and symmetric constraints
BMC Bioinformatics volume 20, Article number: 718 (2019)
Abstract
Background
Identifying different types of cancer based on gene expression data has become hotspot in bioinformatics research. Clustering cancer gene expression data from multiple cancers to their own class is a significance solution. However, the characteristics of highdimensional and small samples of gene expression data and the noise of the data make data mining and research difficult. Although there are many effective and feasible methods to deal with this problem, the possibility remains that these methods are flawed.
Results
In this paper, we propose the graph regularized lowrank representation under symmetric and sparse constraints (sgLRR) method in which we introduce graph regularization based on manifold learning and symmetric sparse constraints into the traditional lowrank representation (LRR). For the sgLRR method, by means of symmetric constraint and sparse constraint, the effect of raw data noise on lowrank representation is alleviated. Further, sgLRR method preserves the important intrinsic local geometrical structures of the raw data by introducing graph regularization. We apply this method to cluster multicancer samples based on gene expression data, which improves the clustering quality. First, the gene expression data are decomposed by sgLRR method. And, a lowest rank representation matrix is obtained, which is symmetric and sparse. Then, an affinity matrix is constructed to perform the multicancer sample clustering by using a spectral clustering algorithm, i.e., normalized cuts (Ncuts). Finally, the multicancer samples clustering is completed.
Conclusions
A series of comparative experiments demonstrate that the sgLRR method based on low rank representation has a great advantage and remarkable performance in the clustering of multicancer samples.
Background
Currently, cancer is one of the most prevalent human diseases, and cancer seriously threatens the quality of human life [1]. The number of variety cancers is increasing, which makes it difficult to effect a radical cure of cancer. A good performing cancer diagnosis method can help doctors to formulate treatment strategies for patients effectively and in a timely manner. In addition, cancer clustering based on gene expression data has become one of the frontiers of bioinformatics research. In the field, it provides an effective way to further explore gene expression data. For example, it can be used to classify cancer [2], select genes [3] and discover cancer linked biomarker genes [4]. In this paper, we propose a methodology to processing gene expression data for identifying different types of cancer.
Since the start of the twentyfirst century, the volume of high dimensional and complex gene expression data has exploded with the advent and development of gene detection technology such as DNA microarray technology [5]. So far, the researchers have proposed many wellperforming methods and used them for gene expression data mining, such as Kmeans clustering [6], nonnegative matrix factorization (NMF) [7] and principal component analysis (PCA) [8]. More recently, because of the high dimensional nature of gene expression data, the lowrank representation (LRR) method has become a popular and promising method since its prototype was proposed by Liu et al. [9]. The LRR method can preserve the subspace structure of the raw dataset in a lowest rank representation matrix. Theoretically, the lowest rank representation matrix is a blockdiagonal matrix with a well grouped effect, and this matrix can well capture the global structural information of highdimensional dataset [10]. And then, the clustering method, such as spectral clustering method, is used to cluster the lowest rank representation matrix to realize the subspace segmentation. The LRR clustering method has been adopted widely in many fields due to the advantages of the lowest rank representation matrix, such as facial recognition [11], genetic microarray data clustering [12], image clustering [13] and subspace segmentation [14]. And, LRR method achieves good results in processing highdimensional datasets.
In general, highdimensional data always have noisy and outliers because of the complexity of the collection process. And, the noisy and outliers inevitably impairs the intrinsic structure of the data space. Therefore, the outliers and noise cause difficulties during processing the raw data. Especially in the LRR method, the highdimensional data are usually used in the form of a dictionary matrix, which inevitably adversely affects grouped effect of lowest rank representation matrix. As described in [9], the LRR method may fail to obtain a blockdiagonal lowest rank representation matrix in complex applications, which makes it difficult to integrate the lowest rank representation matrix with other information. To alleviate this problem, the commonly used solution is to combine the LRR method with the spectral clustering method (the Ncuts clustering method is often adopted) to get the final clustering result. The LRR method and the spectral clustering method are linked by an affinity matrix which is constructed based on the lowest rank representation matrix. And, the affinity matrix has better grouping effects. In general, in order to construct the affinity matrix, a symmetric operation step is usually performed to establish a similaritybased undirected graph. However, this simple symmetric operation inevitably leads to the loss of important structural information of the raw dataset. To tackle this disadvantage, Ni et al. proposed an approach named the lowrank representation with positive semidefinite (LRRPSD) to obtain a symmetric positive semidefinite (PSD) matrix [15]. In the LRRPSD method, an affinity matrix is constructed based on the PSD matrix. This method inspired Chen et al. to propose a lowrank representation with symmetric constraint (LRRSC) method for learning a symmetric lowest rank representation matrix [16]. In this method, the affinity matrix is constructed according to the angular information of the principal directions of the symmetric lowest rank representation matrix. The obtained affinity matrix is better than the matrix which is obtained by simple symmetric operation.
However, compared with the sparse representation method, which considers the sparsest representation of each data point or data vector individually, the LRR method mainly focuses on the global structural information of data [9]. That leads to the LRR method ignoring the local geometrical structural information of data. Because it is shown that the intrinsic local geometrical structures within the highdimensional data are important for the subspace clustering model [17], some researchers introduce nonlinear dimensionality reduction methods into the LRR, such as the manifold learning theory.
At present, many wellestablished nonlinear dimensionality reduction methods have been proposed since Tenenbaum et al. and Roweis et al. proposed isometric mapping (ISOMAP) [18] and locally linear embedding (LLE) [19], respectively. The typical methods include the locality preserving projection (LPP) [20], local tangent space alignment (LTSA) [21], Laplacian eigenmap (LE) [22] and Riemannian normal coordinates (RNC) [23]. They can generate a lowdimensional subspace according to the submanifold of the observation datasets. Furthermore, the manifold learning method treats the local geometrical structures of data points as submanifolds. Inspired by the local invariance [20], the manifold learning method estimates the geometrical structures of the submanifold using random data points [24]. The method can map the submanifolds from the highdimensional space to the lowdimensional space. Therefore, the local geometrical structural information of the raw highdimensional dataset can be preserved in the lowdimensional space [25].
In order to improve the original LRR method, some researchers combine manifold learning theory with the LRR. For instance, Yin et al. proposed a novel model called the nonnegative sparse hyperLaplacian regularized LRR (NSHLRR) that can acquire the inherent information within dataset [24]. Motivated by the NSHLRR, Wang et al. proposed the Laplacian regularized lowrank representation (LLRR) method to identify differently expressed genes [26]. More recently, Wang et al. presented a tumor sample clustering method named the Mixednorm Laplacian Regularized lowrank representation (MLLRR) [27].
Motivated by the above methods, in order to obtain a better lowest rank matrix that can avoid the simple symmetric operation and preserve the intrinsic local geometrical structures within the raw highdimensional dataset, we introduce symmetric sparse constraints and graph regularization based on manifold learning into the LRR method, and propose the graph regularized lowrank representation method under combined the sparse and symmetric constraints, or short sgLRR method. The sgLRR method can obtain a lowest rank representation matrix that can well capture the global structure information of the highdimensional raw dataset and meanwhile preserve the intrinsic local geometrical structures within the dataset. Furthermore, the sgLRR method weakens the adverse effect of noise in the raw dataset by strengthening the symmetric constraint to the lowest rank representation matrix. The obtained lowest rank representation matrix is an excellent basis for constructing the affinity matrix. To take full advantage of the lowest rank representation matrix, we consider the angular information of the principal directions of the lowest rank representation matrix. Therefore, in contrast to the traditional approach, we perform skinny singular value decomposition (SVD) operations on the lowest rank representation to construct the affinity matrix. Finally, based on the affinity matrix, we adopt a spectral clustering algorithm to obtain the clustering results.
We adopt the sgLRR method for multicancer sample clustering based on gene expression data. Our experiment design is carried out in the following three steps: Step One: the sgLRR method is used to process multicancer sample gene expression dataset. And, we can obtain a lowest rank representation matrix. Step Two: an affinity matrix is constructed by exploiting the obtained lowest rank representation matrix. Step Three: based on the affinity matrix, we adopt a spectral clustering algorithm, i.e., Ncuts method, to perform the multicancer sample clustering. Compared with a lot of related methods, the sgLRR method has better performance in multicancer sample clustering.
In summary, the main contributions of our work are as follows:
 (1)
We introduce the symmetric sparse constraints and graph regularization based on manifold learning into the original LRR method and develop a novel method named the sgLRR. The regularized graph is better for preserving the local geometrical structure of raw highdimensional data. And, the symmetric constraint weakens the effect of noise in the raw dataset. Therefore, we use sgLRR method to get a better lowest rank presentation matrix that has better grouping effect for the subspace clustering.
 (2)
Based on the lowest rank presentation matrix, we construct an affinity matrix to further improve its grouping effect. As the link of sgLRR method and Ncuts clustering method, the affinity matrix makes full useful of the angular information of the principal directions of the lowest rank representation matrix.
 (3)
By combining sgLRR with the Ncuts clustering method, we apply the sgLRR method to multicancer sample clustering, and extensive experiments are conducted on gene expression data. Compared with other methods, our methodology has better performance in multicancer sample clustering.
The remainder of this paper is outlined as follows: The section 2 summarizes the LRR method, and gives a brief review of some related work. And then, we describe the proposed sgLRR method in detail. In section 3, based on The Cancer Genome Atlas (TCGA) dataset [28], we perform a large number of comparative experiments to demonstrate the sgLRR method with better performance on the multicancer sample clustering. And, we discuss and analysis the experimental results from different aspects. In section 4, we describe the corresponding discussion. In the section 5, we summarize our work for the full paper.
Methods
First, we review the related work about the lowrank representation. And then, then we introduced our proposed approach.
Related work
In recent years, the LRR method and its improved algorithms have been widely used in many fields. Furthermore, the group theory based on manifold learning has also captured the attention of the researchers. In subsections LowRank Representation and The Symmetric Constraint for the LowRank Representation, we review the LRR method [9] and the symmetric constraint for the lowrank representation [16], respectively. Then, in subsection Manifold Learning for Graph Regularization, we give a detail introduction to graph regularization based on manifold learning [29, 30].
LowRank Representation
Learning a lowest rank representation matrix of the observation dataset is the aim of LRR method [9]. Given an observation data matrix X = [x_{1}, x_{2}, ..., x_{n}] ∈ ℝ^{m × n} with no error. And, there is an overcomplete dictionary matrix A = [a_{1}, a_{2}, ..., a_{k}] ∈ ℝ^{m × k} and a union of multiple lowdimensional independent subspaces. It is assumed that the subspaces can be linearly spanned by the dictionary matrix A. Therefore, the given observation data X can be represented by these lowdimensional subspaces, and the relationship between data X and matrix A is X = AZ. In other words, data X is a linear combination of the dictionary matrix A. The function of the LRR method is as follows:
Here, X = [x_{1}, x_{2}, ..., x_{n}] ∈ ℝ^{m × n} is the observation data matrix. m is the total number of features, and n is the total number of the samples. A = [a_{1}, a_{2}, ..., a_{k}] is the overcomplete dictionary matrix, and Z = [z_{1}, z_{2}, ..., z_{n}] ∈ ℝ^{k × n} is the low rank representation matrix. The element z_{i} of matrix Z is the mapping relationship from {x_{i} x_{i} ∈ X^{m × n}, 1 ≤ i ≤ n} to the dictionary matrix A. In general, the matrix Z is also called the coefficient matrix, and it is a new expression form of X that is based on the dictionary matrix A. The purpose of the LRR method is to find the lowest rank representation matrix Z^{∗}.
In practical analysis, the observation data matrix X is usually selected as the dictionary matrix A, which is a very important aspect of the LRR [9, 15, 26, 27]. According to the matrix multiplication rule, the lowest rank representation matrix Z = [z_{1}, z_{2}, ..., z_{n}] ∈ ℝ^{n × n} is a square matrix. Equation (1) can be rewritten as follows:
In this case, the matrix Z^{∗} represents the relation of each sample of X. In other words, the element \( {\mathbf{z}}_{ij}^{\ast } \) of matrix Z^{∗} represents the similarity between the samples x_{i} and x_{j}. Therefore, the element \( {\mathbf{z}}_{ij}^{\ast } \) should be equal to the element \( {\mathbf{z}}_{ji}^{\ast } \). That is, the matrix Z^{∗} is a symmetric matrix when the observation data matrix X is clean.
Because the rank function is nonconvex, no closed expression can be found. Therefore, Eq. (2) is very difficult to solve. The related research has shown that the nuclearnorm of a matrix is a minimal convex envelope of the rank of the matrix [31,32,33]. Therefore, Eq. (2) is equivalent to the following nuclearnorm convex optimization problem:
Here, ‖⋅‖_{∗} is the nuclearnorm. It is the sum of all singular values of the matrix Z, which is the minimal convex envelope of the rank function [17]. In the actual situation, the observation data are inevitably polluted by noise or outliers under certain special circumstances. Therefore, a certain regularization constraint ‖⋅‖_{l} is usually added to (3) to balance the interference. The improved formula is as follows:
Here, the matrix E denotes the noise or outliers. The parameter γ > 0 is to balance the adaptability of each part in (4), and ‖⋅‖_{l} is regularization constraint. In general, the appropriate regularization constraint ‖⋅‖_{l} is selected according to different types of noise and outliers in real environments. For example, ‖⋅‖_{2, 1}, i.e., the l_{2, 1} norm, is used to extract the samplespecific corruptions and small noise or outliers, and ‖⋅‖_{0}, i.e., the l_{0} norm, is used to deal with the significant noise or outliers [27]. Solving the l_{0} norm is an NPhard problem. Therefore, it is usually replaced by ‖⋅‖_{1}, i.e., the l_{1} norm.
The above is a description of the classic original LRR method. The LRR method deals with the observation data from a holistic perspective. That is, the global structural features of the observation data are represented by the lowest rank representation matrix Z^{∗}. In addition, the LRR method maps the structures of the observation data from highdimensional spaces to lowdimensional spaces. It reduces the difficulty of processing highdimensional observation data.
The Symmetric Constraint for the LowRank Representation
With clean observation data, based on function (3), the most ideal matrix Z^{∗} is a block diagonal and strictly symmetric matrix, as shown in Fig. 1. However, according to function (4), the lowest rank representation matrix Z^{∗} is not strictly symmetric when using real data with noise and outliers, as shown in Fig. 2 [34].. In other words, because the element Z_{ij} is not equal to the element Z_{ji}, the degree of similarity of the ith sample to the jth sample is not equal to the degree of similarity of the ith of sample to the jth sample. One question worth considering is which of the two elements is more suitable to be used to reflect the similarity between the two samples.
In general, an affinity matrix is usually constructed using symmetric operation, i.e., ( Z^{∗} +Z^{∗}^{T})/2, to reflect the similarity of samples. Then, based on the affinity matrix, spectral clustering algorithms generally use the Ncuts clustering method for subspace clustering. To avoid symmetric operations, Chen et al. imposed a symmetric constraint onto the LRR to obtain a symmetric lowest rank representation matrix [16]. The improved method was named the lowrank representation with symmetric constraint (LRRSC) and it can be expressed as follows:
The symmetric lowest rank representation matrix Z^{∗} can greatly preserve the subspace structures of the observation data. Therefore, the affinity matrix based on the principal direction angular information of the symmetric lowest rank representation matrix Z^{∗} can effectively reflect the similarity between samples. However, the LRRSC method does not consider the local geometrical structural information. It may lose important information when obtaining the lowest rank representation matrix. In the next section, we use manifold learning with graph regularization to solve this problem.
Manifold Learning for Graph Regularization
In actual situations, the given observation data X ∈ ℝ^{m × n} are usually highdimensional. Thus, the local geometrical structural information exists at each data point and at its knearestneighboring data points. Capturing the local geometrical structural information is important for the performance of subspace clustering. Fortunately, graph regularization based on manifold learning provides a feasible option to achieve this aim [29]. This approach can preserve the intrinsic local geometrical structures that are embedded in the highdimensional data space.
In graph theory, the “manifold assumption” is that data points near local geometrical structures should keep their proximity under a new basis [35]. If we map the adjacent data points x_{i} and x_{j} in the highdimensional space to the lowdimensional space, their mapping data points z_{i} and z_{j} should be close in the lowdimensional space. Therefore, the local geometrical structural information of the data points x_{i} and x_{j} can be represented in the lowdimensional space. In other words, if the characteristics of the data points are similar in the highdimensional space, their mapping data points can be clustered into the same class in the lowdimensional space.
We take each data point as a vertex. The data points are defined by the column of observation data X = [x_{1}, x_{2}, ..., x_{n}]. Therefore, the number of vertices is n. All n vertices form a graph G. The weight of the connected edge of vertices i and j in the graph G is represented by w_{ij}. The assignment rule of w_{ij} is as follows:
where N_{k}(x_{i}) denotes the set of the knearestneighbors of x_{i}. As suggest in [26, 27], we select the k = 5 as the nearest neighbors for the experimental datasets. In addition, all elements w_{ij} make up a symmetric weight matrix W.
In the lowdimensional space, the new relationship of the data points is as follows:
After a linear algebraic transformation, the above optimization problem (7) can be written as follows:
Here, tr(⋅) is the trace of the matrix. L is called the graph Laplacian matrix. It is defined by L = D − W. The matrix D is a diagonal matrix, and the element d_{ii} of D is sum of the ith row of W, i.e., \( {\mathbf{d}}_{ii}={\sum}_j^n{\mathbf{w}}_{ij} \).
sgLRR methodology
In this section, we introduce our method for multicancer sample clustering. First, we obtain the objective function according to the problem’s formulation and solve the function using the linearized adaptive direction method with the adaptive penalty (LADMAP) method [36]. Then, we provide the complete algorithm for easier understanding. Second, we combined our method with the Ncuts clustering method by learning an affinity matrix. Finally, the proposed method is used for the subspace segmentation of multicancer sample clustering.
Problem formulation and the solution
In this subsection, our goal is to propose a novel LRR model to preserve the intrinsic local geometrical structures of the observation data and simultaneously weaken the effects of noise and outliers in the dictionary matrix. We introduce graph regularization based on manifold learning and the symmetric constraint into the original LRR method. It is as follows:
where β and γ are penalty parameters, L is the Laplacian matrix, and ‖ ⋅ ‖_{1} is the regularization constraint. ‖E‖_{1} is the sum of the absolute values of each element in the matrix E.
In addition, according to the sparsitybased clustering method, e.g., sparse coding combined with clustering, the sparsity constraint can be thought of as a strategy for information localization [37]. Thus, the coefficient matrix with the sparsity constraint can improve the performance of subspace clustering. Namely, by combining the lowrank and sparse data, the withinclass affinities are dense, and the betweenclass affinities are zeros. So, we introduce the sparsity constraint into Eq. (9), and the finally objective function of our method is as follows:
where λ is the penalty parameter, and ‖Z‖_{1} is the sparsity constraint for the lowrank representation matrix Z.
We call the objective function in (10) the graph regularized lowrank representation under combined the sparse and symmetric constraints (sgLRR) method. To obtain a globally optimal solution, we adopt the LADMAP to solve problem (10).
First, we introduce the auxiliary variable J to separate variables. It is as follows:
Second, problem (11) can be converted into an unconstrained optimization problem by using the augmented Lagrange multiplier method (ALM) [38]. The formula is rewritten as follows:
Here, ‖⋅‖_{F} is the Frobeniusnorm; λ, β, λ and μ are the penalty parameters; 〈A, B〉 = tr(A^{T}B) represents the Euclidean inner product between the two matrices, and Y_{1} and Y_{2} are Lagrangian multipliers.
According to the LADMAP method, problem (12) is divided into three problems. They are as follows:
Problem (13) can be replaced by solving the following problem (16):
where \( {\nabla}_{\mathbf{Z}}\mathbf{q}\left({\mathbf{Z}}_k\right)=\beta \left({\mathbf{Z}}_k{\mathbf{L}}^{\mathrm{T}}+{\mathbf{Z}}_k\mathbf{L}\right)+{\mu}_k\left({\mathbf{Z}}_k{\mathbf{J}}_k+{\mathbf{Y}}_2^k/{\mu}_k\right)+{\mu}_k{\mathbf{X}}^{\mathrm{T}}\left(\mathbf{X}{\mathbf{Z}}_k\mathbf{X}+{\mathbf{E}}_k{\mathbf{Y}}_1^k/{\mu}_k\right) \), \( {\eta}_1=2\beta {\left\Vert \mathbf{L}\right\Vert}_2+{\mu}_k\left(1+{\left\Vert \mathbf{X}\right\Vert}_2^2\right) \).
We use the following Lemma1 to solve problem (16). Chen et al. have given the rigorous mathematical derivations and detailed proofs for this theorem [16].
Lemma 1
Given a square matrix Q ∈ ℝ^{n × n}, there is a unique closed form solution to solve optimization problem (17).
It is as follows:
Here, Σ_{r}, U_{r} and V_{r} are obtained using \( \overset{\sim }{\mathbf{Q}}={\mathbf{U}}_r{\boldsymbol{\Sigma}}_r{\mathbf{V}}_r^{\mathrm{T}} \), which is the skinny SVD of the symmetric matrix \( \overset{\sim }{\mathbf{Q}} \). In addition, Σ_{r} = diag (σ_{1}, σ_{2}, ..., σ_{r}) with \( \left\{r:{\sigma}_r>\frac{1}{\mu}\right\} \) are the positive singular values of matrix \( \overset{\sim }{\mathbf{Q}} \). U_{r} and V_{r} are the singular vectors of matrix \( \overset{\sim }{\mathbf{Q}} \). Matrix \( \overset{\sim }{\mathbf{Q}} \) is obtained by \( \overset{\sim }{\mathbf{Q}}=\left(\mathbf{Q}+{\mathbf{Q}}^{\mathrm{T}}\right)/2 \) and the skinny SVD only keeps the positive singular values of the normal SVD. I_{r} is an identity matrix.
According to Lemma1, we set Q = Z_{k} − ∇_{Z}q(Z_{k})/η_{1}. Then, we solve problem (16) by using the iterative formula (19):
Here, \( {\Theta}_{\varepsilon}\left(\mathbf{A}\right)={\mathbf{U}}_r{\mathbf{S}}_{\varepsilon}\left({\boldsymbol{\Sigma}}_r\frac{1}{\mu_k}\cdot {\mathbf{I}}_r\right){\mathbf{V}}_r^{\mathrm{T}} \) and S_{ε}(x) = sgn(x) max( x −ε, 0).
We update Ε and J by minimizing ℓ_{2}(E) and ℓ_{3}(J). And, Ε and J are independent of each other in this minimization problem. And then, based on a singular value thresholding algorithm, we obtain the iterative formulas of Ε and J. We set \( \frac{\partial {\ell}_2}{\partial \mathbf{E}}=0 \) and \( \frac{\partial {\ell}_3}{\partial \mathbf{J}}=0 \), respectively. Then, we obtain the following equations.
According to the NSHLRR method [24] and the singular value thresholding algorithm [39], the iterative formulas of E and J are as follows:
Based on the above, we discuss the time complexity of sgLRR compared to the original LRR. As described in [36], the complexity of LADMAP method for LRR is O(rmn), where r is the rank of the matrix Z, m and n is the size of observation data matrix X ∈ ℝ^{m × n}. For sgLRR method, the construction of the knearest neighbor graph is O(n^{2}m). Therefore, the complexity of sgLRR is O(rmn + n^{2}m).
Finally, Algorithm 1 provides the complete sgLRR algorithm.
sgLRR method combined with the Ncuts clustering method
We obtain the lowest rank representation matrix Z^{∗} by Algorithm 1. The obtained matrix Z^{∗} inherits and improves the grouping effect of the LRR method. The symmetric property of matrix Z^{∗} strictly reflects the similarity of the data samples, and the data samples that belong to the same group highlight the same subspace of matrix Z^{∗}. However, as mentioned in [9], the complex application may fail in the lowest rank representation matrix Z^{∗} and in fully using the information within matrix Z^{∗}. Therefore, we combine the sgLRR method with the Ncuts clustering method to guarantee correct segmentation results.
First, we learn an affinity matrix H that is the link between the sgLRR method and the Ncuts clustering method. The affinity matrix H utilizes the angular similarity information of the principal direction of matrix Z^{∗}, and matrix H is a similar undirected graph that further improves the grouping effect. The process below can be defined as learning matrix H.
 1.
The matrix Z^{∗} is decomposed into Z^{∗} = U^{∗}Σ^{∗}(V^{∗})^{T} using skinny SVD.
 2.
Define the matrix M = U^{∗}(Σ^{∗})^{1/2} or the matrix N = (Σ^{∗})^{1/2}(V^{∗})^{T}. Because the matrix Z^{∗} is a symmetrical matrix, both matrix M and matrix N are equivalent for leaning the affinity matrix H.
 3.
The element of the affinity matrix H is calculated using function (24).
where m_{i} is the ith row of M, and n_{i} is the ith row of N.
Next, we adopt the Ncuts clustering method to produce the final data sample clustering results. The Ncuts clustering method was proposed by Shi et al. and is closely related to graph theory [40]. This approach can well reflect the degree of similarity within classes and the degree of dissimilarity between classes. This approach has been successfully applied in image segmentation and has numerous successful examples in different fields and datasets, such as gene expression overlapping clustering based on the penalized weighted normalized cut [41].
Finally, we briefly summarize the process of the multicancer sample clustering algorithm. It is as follows.
Results
Datasets
As the biggest cancer genomic profile database, The Cancer Genome Atlas (TCGA) provides publicly available datasets with over 30 types of cancers using highthroughput sequencing technology and integrated multidimensional analyses to help improve the diagnosis, prevention, and treatment of cancer [28].
We use five real gene expression datasets that were downloaded from the TCGA to construct the integrated datasets for the experiments. The five original datasets are the cholangiocarcinoma (CHOL) dataset, the head and neck squamous cell carcinoma (HNSC) dataset, the colon adenocarcinoma (COAD) dataset, the esophageal carcinoma (ESCA) dataset and the pancreatic adenocarcinoma (PAAD) dataset. Each dataset consists a different number of cancer samples and normal samples, and each sample contains 20,502 genes. Table 1 lists the distribution number of the samples for each dataset.
As listed in the Table 1, we use all the cancer samples of each dataset to construct six integrated datasets. And, the six integrated datasets are named the COCH (COADCHOL) dataset, the PAES (PAADESCA) dataset, the CHHNCO (CHOLHNSCCOAD) dataset, the ESCHHN (ESCACHOLHNSC) dataset, the ESCOPAHN (ESCACOADPAADHNSC) dataset and the COCHESHN (COADCHOLESCAHNSC) dataset, respectively. The characteristics of the datasets are as follows: the COCH dataset contain all 298 cancer samples from COAD and CHOL; the PAES dataset contain all 359 cancer samples from PAAD and ESCA; the CHHNCO dataset contain all 696 cancer samples from CHOL, HNSC and COAD; the ESCHHN dataset contain all 617 cancer samples ESCA, CHOL and HNSC; the COCHESHN dataset contain all 879 cancer samples from COAD, CHOL, ESCA and HNSC; and, the ESCOPAHN dataset contain all 1019 cancer samples from ESCA, COAD, PAAD and HNSC. The distribution of the six datasets are summarized and listed in Table 2. We conduct experiments on the basis of the six datasets to prove the performance of sgLRR method.
Measurement metrics for the experiment results
In this article, we use multiple measures to strictly analyze the clustering results. The clustering results are mainly evaluated by the Accuracy (Acc) [42], Matthews Correlation Coefficient (MCC) [43], Rand Index (RI) [44] and Normalized Mutual Information (NMI) [45]. Next, we concisely introduce them.
Accuracy
The Accuracy (Acc) evaluates the clustering results on the global level by calculating the matching degree of experimental result labels and actual labels. The values of the Acc ranges from 0 to 1, and the higher value is, the better the clustering results is. The specific formula is as follows.
Here, δ(p_{i}, map(q_{i})) is defined as follows:
where n is the number of data samples, p_{i} is the real label for the ith sample, and q_{i} is the experimental result of the ith sample. map(q_{i}) is the mapping function that can match the clustering result to the real label using the KuhnMunkres approach [46].
Matthews correlation coefficient
The Matthews Correlation Coefficient (MCC) is widely used performance measure in biomedical research to handle imbalanced datasets [43, 47,48,49]. In general, MCC represents a comprehensive evaluation measure which has a better balance of both aspects of the accuracy and coverage than the individual precision and recall values [49]. The MCC is defined in terms of TP (True Positive), FP (False Positive) and TN (True Negative), FN (False Negative), and its formula is as follows.
where TP is the number of true positives, where the data points that actually belong to the same cluster are grouped into the same cluster in the experiment results. TN is the number of true negatives, where the data points that actually belong to the same cluster are grouped into the different clusters in the experiment results. FP is the number of false positives, where the data points that actually belong to different clusters are grouped into the same cluster in the experiment results. FN is the number of false negatives, where the data points that actually belong to different clusters are grouped into the different clusters in the experiment results. The Fig. 3 shows TP, TN, FP, FN clearly.
The value of MCC is took in the interval [−1, 1], with 1 representing a complete agreement, −1 indicating a complete disagreement, and 0 indicating that the clustered result was uncorrelated with the ground truth [50]. For the multiclass dataset clustering with k classes, the MCC can be calculated by the confusion matrix. And, the confusion matrix is a matrix C = (C_{ij})_{k × k} with the size of k × k, where C_{ij} represents the number of samples, which in actually belongs to the class i, are clustered to be in the cluster j. And, the confusion matrix and the item of TP, FP, TN, FN for multicancer samples clustering are defined as the Fig. 4.
Rand index
The Rand Index (RI) is an objective criterion for the evaluation of clustering methods. From a mathematical standpoint, the RI is related to the Acc, but it is applicable even when class labels are not used [44]. Given the set of n data points S = {O_{1}, O_{2}, ..., O_{n}} that are to be clustered, the specific partitions V = {v_{1}, v_{2}, ..., v_{r}} and U = {u_{1}, u_{2}, ..., u_{c}} are the clustering results of S that are divided into r and c disjointed sets, respectively. If V represents the true results and U represents the experiment results, then RI is defined as follows.
The value of the RI ranges from 0 to 1, and the higher value is, the better the clustering results is.
Normalized mutual information
The Normalized Mutual Information (NMI) is commonly used in clustering to measure the similarity of two clustering results [45]. There are the clusters Ξ = [ξ_{i}]_{k} obtained by the clustering algorithm and the true inherent classes Ω = [ω_{i}]_{k}. The NMI is defined as follows.
Here, \( I\left(\Xi; \Omega \right)=\sum \limits_{\xi_i\in \Xi}^k\sum \limits_{\omega_i\in \Omega}^kp\left(\xi, \omega \right)\log \left(\frac{p\left(\xi, \omega \right)}{p\left(\xi \right)p\left(\omega \right)}\right) \) is the mutual information, and \( H\left(\Xi \right)=\sum \limits_{i=1}^kp\left({\xi}_i\right)\times I\left({\xi}_i\right)=\sum \limits_{i=1}^kp\left({\xi}_i\right)\times {\log}_2\left(\frac{1}{p\left({\xi}_i\right)}\right) \), where p(ξ_{i}) (p(ω_{i})) is the probability of an object being in cluster ξ_{k} (class ω_{k}), and p(ξ_{k}, ω_{j}) is the joint probability that an object lies in cluster ξ_{k} and class ω_{k}. The value of the NMI ranges from 0 to 1, and the higher value is, the better the clustering results is.
Experiment result and discussion
In this subsection, we cluster the multicancer samples using the sgLRR method and compare the results with other related methods to analyze the performance. The related methods in the comparative experiments include Kmeans, TSNE, LLE, NMF [42], PCA [33], LRR [9], LLRR [26] and MLLRR [27]. And, the experiments are carried out on the six integrated datasets. We obtain the clustering results of the sgLRR method and the comparison methods. For the compared methods: Kmeans, TSNE, LLE, NMF, PCA, LRR, LLRR, and MLLRR, they are the traditional existing clustering and dimensional reduction methods. And, we categorize these methods into three classes. The first kind of method is the classic method for clustering, including Kmeans, NMF and PCA. The TSNE and LLE belong to the second kind of method for dimensional reduction. TSNE and LLE both are wellestablished manifold learning methods. Among them, TSNE is almost the dominant one in bioinformatics, especially for expression data. The third kind of method include LRR, LLRR, MLRR and our proposed sgLRR method. These methods belong to the subspaces clustering methods to dimensional reduction by low rank representation the raw datasets.
In addition, Kmeans clustering algorithm is usually used to obtain the final clustering result in spectral clustering. In this paper, Kmeans method uses the Kmeans + + algorithm for cluster center initialization and squared Euclidean distance by default, and in Kmeans + + algorithm, the initial cluster center is randomly selected [51]. Therefore, if Kmeans method is used to repeat the experiment with the same dataset, the results of these experiments will not be identical, and there will be minor differences. This difference will affect our performance evaluation of clustering methods. In our experiments, in order to improve the reasonable of results and reduce the difference, we repeat clustering experiment 50 times. And, the mean of results is taken as the measurements of clustering results.
The experimental results are listed in the Table 3. And, we highlight the best clustering results in bold. Of all the best results, except for the few results, the results obtained by sgLRR method are overwhelmingly superior in the nine experimental methods. In the next, based on the clustering results, we detailed discuss and analyze the advantage of sgLRR method which is different with the above comparison methods. And, the details are as follows.
 1.
For the most of metrics results in the Table 3, the LRR, LLRR, MLRR and sgLRR methods are better than the first kind method, including Kmeans, NMF and PCA. Furthermore, the performances of LLRR, MLRR and sgLRR methods improve as the number of cancer types increasing. Notably, the best clustering results are mainly obtained by the sgLRR method. From an overall standpoint, the experimental results demonstrate that the methods for the lowrank representation are better for multiple subspace clustering than the classical clustering method. One mainly reason is that the lowrank representation methods with the characteristics of capturing the subspace structure of datasets. Therefore, the gene expression data structures of each type cancer are stored in their respective low dimensional subspaces, which makes the different types of cancer dataset more separable.
 2.
In order to demonstrate dimensionality reduction datasets of sgLRR with the better performance on the multicancer gene expression datasets, we compare sgLRR method with the second class of method: TSNE and LLE. At first, we visualize the dimensionality reduction datasets which are obtained by the TSNE, LLE and sgLRR methods, as shown in Fig. 5. And, the data points are colored according to their actual labels. As shown in the Fig. 5, in the dimensionality reduction data obtained by the TSNE method, there are several overlaps between clusters of different types of cancer samples such as I2, I4, I5 and I6. In the dimensionality reduction data obtained by the LLE method, the separability of clusters of different types of cancers is not obvious such as II3, II5 and II6. In the dimensionality reduction data obtained by the sgLRR method, the independence of different cancer sample clusters is obvious such as III2, III4 and III6, and the data subspace has better separability effect than TSNE and LLE methods. Therefore, we come to the conclusion that the separability among different types cancers in the dimensionality reduction data of three methods is best by sgLRR method, followed by TSNE method, and finally by LEE method. Moreover, sgLRR method makes the data points more separable between classes than TSNE method. That is due to that sgLRR method combines the lowrank representation method with the graph regularization constraint based on manifold learning, which enhances the separable between different types of cancer data in dimensionality reduction datasets.
 3.
In the third kind of method, what LRR LLRR MLLRR and sgLRR methods have in common is that they represent global structure of the raw dataset by a lowrank matrix with low dimensional subspaces. However, comparing the LRR method with the LLRR, MLLRR and sgLRR methods, the clustering results of most datasets are better than the LRR method. This is because LLRR, MLLRR and sgLRR methods with graph regularization based on manifold learning can capture the inherent geometric structural information of datasets. The results suggest that introducing graph regularization based on manifold learning can improve the clustering performance of the method. Moreover, we can find that the most of metrics of the sgLRR are higher than those of the LLRR, and they are also the best in all comparison methods. This is because the symmetry constraint weakens the effect of noise in the genetic expression data, and it makes the lowest rank representation matrix that is obtained by the sgLRR better for preserving the similarity among the cancer samples than the LLRR.
In addition, the affinity matrix that is constructed based on the lowest rank representation matrix also plays a key role in the clustering. To briefly and clearly explain the contribution of the affinity matrix, we randomly select three typical datasets and give the heat maps based on matrix Z^{∗} and matrix H^{∗} for each respective dataset. The heat maps of the three selected datasets (COCH, CHHNCO and COCHESHN) are as shown Fig. 6. In addition, in Fig. 6, the larger that the matrix element is, the brighter the corresponding position on the heat map. As we can see from Fig. 6, it is obvious that the grouping effect of matrix H^{∗} is better than that of Z^{∗}.
 4.
In this part, we analyze the advantages of sgLRR method from the relationship between subspace number contained in datasets and method performance. According to Table 2, each of the six integrated datasets contains different types and amounts of cancer. In other word, the different integrated datasets contain different number of subspaces. And, there is reason to believe that the complexity of the internal geometric structures for the dataset has a notable positive correlation with the number of subspaces. Therefore, among the six integrated datasets, the COCHESHN and ESCOPAHN are the most complex, followed by the CHHNCO and ESCHHN that contain three types of cancer, and finally, followed by the integrated datasets COCH and PAES that contain two types of cancer. Based on the Table 3, we can see that the sgLRR method is better than the other methods as the subspace number increases. Specifically, the metrics of the sgLRR on the ESCHHN dataset are 2.92 (ACC), 30.14 (MCC), 4.03 (RI) and 26.37 (NMI) percentage points higher than those of the LLRR. Furthermore, for the COCHESHN dataset, the percentages of the sgLRR are 1.69 (ACC), 13.66 (MCC), 1.92 (RI) and 5.85 (NMI) higher than those of the LLRR. This proves that the sgLRR method is more suitable for multicancer sample clustering than comparison methods.
Through the above analysis, we can conclude that the combination of graph regularization based on manifold learning and the symmetry constraint plays a significant role in the sgLRR and achieves satisfactory results in multicancer samples clustering.
Discussion
Based on the comparison and demonstration of the above experimental results, our proposed sgLRR method has advantages over other methods. The sgLRR method based on low rank representation has a great advantage in multisubspace clustering. By means of symmetric constraint and sparse constraint, the influence of data noise on lowrank representation is alleviated. Meanwhile, the local geometric structure of data is retained through graph regularization constraint based on manifold learning, which improves the clustering effect in subspace clustering. Compared with other methods based on low rank representation, our method takes into account various factors that affect subspace clustering and improves the performance of the method. These advantages have been demonstrated in experiments with gene expression data from multiple cancers.
Conclusions
In this paper, we introduce graph regularization based on manifold learning and symmetric sparse constraints into the original LRR and propose a novel method called the sgLRR. The original LRR method can capture the global geometrical information of the whole observation data. The lowest rank representation matrix Z^{∗} of the sgLRR method has the properties of the traditional LRR method and can capture the intrinsic local geometric information within data. In addition, the symmetry constraint weakens the effect of noise in the dictionary matrix and makes the lowest rank representation matrix Z^{∗} strictly and accurately preserve the similarity between samples.
We adopt the sgLRR method for multicancer samples clustering based on gene expression dataset. First, we use the sgLRR to obtain the lowest rank representation matrix Z^{∗}. Then, based on the angular similarity information of the lowest rank representation matrix Z^{∗}, we learn an affinity matrix H by using a unitary matrix that is obtained using skinny SVD. The results prove that the affinity matrix has a better grouping effect. Finally, based on the affinity matrix H, the spectral clustering algorithm (Ncuts) is used to obtain the clustering results.
We compare the experimental results from other methods to the sgLRR, including the Kmeans, TSNE, LLE, NMF, PCA, LRR, LLRR and MLLRR methods. The experimental results show that the sgLRR method is a novel efficient method for multicancer sample clustering. The sgLRR method performs well on the dataset, which contain multiple subspaces. In future work, we will further study the sgLRR method. For example, the current method can be extended to identify characteristic cancer genes or to analyze cancer pathways.
Availability of data and materials
The datasets that support the findings of this study can be found in the [The Cancer Genome Atlas (TCGA)] https://cancergenome.nih.gov/.
Abbreviations
 ALM:

The augmented Lagrange multiplier method;
 LADMAP:

The linearized adaptive direction method with the adaptive penalty method
 LRR:

Lowrank representation
 Ncuts:

Normalized cuts
 sgLRR:

The graph regularized lowrank representation under symmetric and sparse constraints method
 SVD:

Singular value decomposition
 TCGA:

The Cancer Genome Atlas
References
Bray F, Ferlay J, Soerjomataram I, Siegel RL, Torre LA, Jemal A. Global cancer statistics 2018: GLOBOCAN estimates of incidence and mortality worldwide for 36 cancers in 185 countries. CA Cancer J Clin. 2018;68(6):394–424.
Feng C, Xu Y, Liu J, Gao Y, Zheng C. Supervised discriminative sparse PCA for comcharacteristic gene selection and tumor classification on multiview biological data. IEEE Trans Neural Netw Learn Syst. 2019;30(10):2926–37.
Liu JX, Feng CM, Kong XZ, Xu Y. Dual graphLaplacian PCA: a closedform solution for biclustering to find “checkerboard” structures on gene expression data. IEEE Access. 2019, 7:151329–38.
Sadhu A, Bhattacharyya B. Discovery of cancer linked biomarker genes through common subcluster mining. In: 2016 international conference on bioinformatics and systems biology (BSB): Mar, Allahabad, India 2016. p. 1–5.
Venter JC, Adams MD, Myers EW, Li PW, Mural RJ, Sutton GG, Smith HO, Yandell M, Evans CA, Holt RA, et al. The sequence of the human genome. Science (New York, NY). 2001;291(5507):1304–51.
Mavroeidis D, Marchiori E. Feature selection for kmeans clustering stability: theoretical analysis and an algorithm. Data Min Knowl Disc. 2014;28(4):918–60.
Zheng CH, Ng TY, Zhang L, Shiu CK, Wang HQ. Tumor classification based on nonnegative matrix factorization using gene expression data. IEEE Trans NanoBiosci. 2011;10(2):86–93.
Pooladi M, Tavirani MR, Hashemi M, HesamiTackallou S, Abad SKR, Moradi A, Zali AR, Mousavi M, Dalvand LF, Rakhshan A, et al. Cluster and principal component analysis of human glioblastoma multiforme (GBM) tumor proteome. Iran J Cancer Prevent. 2014;7(2):87–95.
Liu GC, Lin ZC, Yu Y. Robust subspace segmentation by lowrank representation. In: Proceedings of the 27th international conference on machine learning (ICML10): 2010. 2010.
Lu C, Feng J, Lin Z, Mei T, Yan S. Subspace clustering by block diagonal representation. IEEE Trans Pattern Anal Mach Intell. 2018:1–1.
Chen CF, Wei CP, Wang YF. Lowrank matrix recovery with structural incoherence for robust face recognition. In: 2012 IEEE conference on computer vision and pattern recognition: Jun. 2012. p. 2618–25.
Cui Y, Zheng CH, Yang J. Identifying subspace gene clusters from microarray data using lowrank representation. PLoS One. 2013;8(3):e59377.
Zhang ZY, Zhao KK. Lowrank matrix approximation with manifold regularization. IEEE Trans Pattern Anal Mach Intell. 2013;35(7):1717–29.
Liu GC, Yan SC. Latent lowrank representation for subspace segmentation and feature extraction. In: 2011 international conference on computer vision: Nov.; Barcelona, Spain 2011. p. 1615–1622.
Ni YZ, Sun J, Yuan XT, Yan SC, Cheong LF. Robust lowrank subspace segmentation with semidefinite guarantees. In: Proceedings of the 2010 IEEE international conference on data mining workshops (ICDMW ’10): Dec.; Sydney, NSW, Australia, IEEE Computer Society 2010. p. 1179–1188.
Chen J, Mao H, Sang Y, Yi Z. Subspace clustering using a symmetric lowrank representation. KnowlBased Syst. 2017;127:46–57.
Yin M, Gao JB, Lin ZC, Shi QF, Guo Y. Dual graph regularized latent lowrank representation for subspace clustering. IEEE Trans Image Process. 2015;24(12):4918–33.
Tenenbaum JB, de Silva V, Langford JC. A global geometric framework for nonlinear dimensionality reduction. Science (New York, NY). 2000;290(5500):2319–23.
Roweis ST, Saul LK. Nonlinear dimensionality reduction by locally linear embedding. Science (New York, NY). 2000;290(5500):2323–6.
He X. Locality preserving projections. Chicago: University of Chicago; 2005.
Zhang Z, Zha H. Principal manifolds and nonlinear dimensionality reduction via tangent space alignment. SIAM J Sci Comput. 2006;26(1):313–38.
Belkin M, Niyogi P. Laplacian eigenmaps and spectral techniques for embedding and clustering. In: Proceedings of the 14th international conference on neural information processing systems: natural and synthetic: Dec.; Vancouver, British Columbia, Canada. MIT Press 2001. p. 585–591.
Lin T, Zha H, Lee SU. Riemannian manifold learning for nonlinear dimensionality reduction. In: Leonardis A, Bischof H, Pinz A, editors. Computer vision – ECCV 2006. Berlin/Heidelberg: Springer; 2006. p. 44–55.
Yin M, Gao J, Lin Z. Laplacian regularized lowrank representation and its applications. IEEE Trans Pattern Anal Mach Intell. 2016;38(3):504–17.
He XF, Cai D, Shao YL, Bao HJ, Han JW. Laplacian regularized Gaussian mixture model for data clustering. IEEE Trans Knowl Data Eng. 2011;23(9):1406–18.
Wang YX, Liu JX, Gao YL, Zheng CH, Shang JL. Differentially expressed genes selection via Laplacian regularized lowrank representation method. Comput Biol Chem. 2016;65:185–92.
Wang J, Liu JX, Zheng CH, Wang YX, Kong XZ, Weng CG. A mixednorm Laplacian regularized lowrank representation method for tumor samples clustering. IEEE/ACM Trans Comput Biol Bioinform. 2018;7:1–1.
Tomczak K, Czerwinska P, Wiznerowicz M. The Cancer Genome Atlas (TCGA): an immeasurable source of knowledge. Contemp Oncol (Poznan, Poland). 2015;19(1A):A68–77.
Belkin M, Niyogi P. Laplacian eigenmaps for dimensionality reduction and data representation. Neural Comput. 2003;15(6):1373–96.
Sun SL, Hussain Z, ShaweTaylor J. Manifoldpreserving graph reduction for sparse semisupervised learning. Neurocomputing. 2014;124:13–21.
Candès EJ, Recht B. Exact matrix completion via convex optimization. Found Comput Math. 2009;9:717–72.
Keshavan RH, Montanari A, Oh S. Matrix completion from noisy entries. In: Proceedings of the 22nd international conference on neural information processing systems. 2009. p. 952–60.
Candès EJ, Li X, Ma Y, Wright J. Robust principal component analysis? ACM. 2011;58(3):1–37.
Liu GC, Lin ZC, Yan SC, Sun J, Yu Y, Ma Y. Robust recovery of subspace structures by lowrank representation. IEEE Trans Pattern Anal Mach Intell. 2013;35(1):171–84.
Dai LY, Feng CM, Liu JX, Zheng CH, Yu J, Hou MX. Robust nonnegative matrix factorization via joint graph Laplacian and discriminative information for identifying differentially expressed genes. Complexity. 2017;2017:11.
Lin Z, Liu R, Su Z. Linearized alternating direction method with adaptive penalty for lowrank representation. Adv Neural Inf Proces Syst. 2011:612–20.
Oktara Y, Turkan M. A review of sparsitybased clustering methods. Signal Process. 2018;148:20–30.
Lin Z, Chen M, Ma Y. The augmented lagrange multiplier method for exact recovery of corrupted lowrank matrices. Eprint Arxiv. 2010;
Cai JF, Candès EJ, Shen Z. A singular value thresholding algorithm for matrix completion. SIAM J Optim. 2008;20(4):1956–82.
Shi JB, Malik J. Normalized cuts and image segmentation. IEEE Trans Pattern Anal Mach Intell. 2000;22(8):888–905.
Teran Hidalgo SJ, Zhu T, Wu M, Ma S. Overlapping clustering of gene expression data using penalized weighted normalized cut. Genet Epidemiol. 2018;42(8):796–811.
Zheng CH, Huang DS, Zhang L, Kong XZ. Tumor clustering using nonnegative matrix factorization with gene selection. IEEE Trans Inf Technol Biomed. 2009;13(4):599–607.
Matthews BW. Comparison of the predicted and observed secondary structure of T4 phage lysozyme. Biochimica et Biophysica Acta (BBA)  Protein Structure. 1975;405(2):442–51.
Rand WM. Objective criteria for the evaluation of clustering methods. J Am Stat Assoc. 1971;66(336):846–50.
Manning C, Raghavan P, Schütze H. Introduction to information retrieval, vol. 1. Cambridge: Cambridge University Press; 2008.
Zhu H, Zhou MC, Alkins R. Group role assignment via a KuhnMunkres algorithmbased solution. IEEE Trans Syst Man Cybernet Part A Syst Hum. 2012;42(3):739–50.
Boughorbel S, Jarray F, ElAnbari M. Optimal classifier for imbalanced data using Matthews Correlation Coefficient metric. PLoS One. 2017;12(6):e0177678.
Liu G, Mercer TR, Shearwood AMJ, Siira SJ, Hibbs ME, Mattick JS, Rackham O, Filipovska A. Mapping of mitochondrial RNAprotein interactions by digital RNase footprinting. Cell Rep. 2013;5(3):839–48.
Gu Q, Zhu L, Cai Z. Evaluation measures of the classification performance of imbalanced data sets. Commun Comput Inform Sci. 2009;51:461–71.
Baldi P, Brunak S, Chauvin Y, Andersen CA, Nielsen H. Assessing the accuracy of prediction algorithms for classification: an overview. Bioinformatics (Oxford, England). 2000;16(5):412–24.
Arthur D, Vassilvitskii S. kmeans++: the advantages of careful seeding. In: Proceedings of the eighteenth annual ACMSIAM symposium on discrete algorithms; New Orleans, Louisiana. 1283494: Society for Industrial and Applied Mathematics 2007. p. 1027–35.
Acknowledgements
Thanks go to the editor and the anonymous reviewers for their comments and suggestions.
About this supplement
This article has been published as part of BMC Bioinformatics Volume 20 Supplement 22, 2019: Decipher computational analytics in digital health and precision medicine. The full contents of the supplement are available online at https://bmcbioinformatics.biomedcentral.com/articles/supplements/volume20supplement22.
Funding
Publication costs are funded by the NSFC under grant Nos. 61572284, 61702299, 61972226 and 61902215. The funder played no role in the design of the study and collection, analysis, and interpretation of data and in writing the manuscript.
Author information
Authors and Affiliations
Contributions
CHL and JW jointly conceptualized the algorithm, designed the sgLRR method and carried out the experiments. JXL and LYD gave statistical and computational advice for the project and analysed the results of the methods. XZK participated in designing evaluation criteria, and drafted the manuscript and polished the English expression. 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 distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. 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.
About this article
Cite this article
Wang, J., Lu, CH., Liu, JX. et al. Multicancer samples clustering via graph regularized lowrank representation method under sparse and symmetric constraints. BMC Bioinformatics 20 (Suppl 22), 718 (2019). https://doi.org/10.1186/s1285901932315
Published:
DOI: https://doi.org/10.1186/s1285901932315
Keywords
 Affinity matrix
 Gene expression data
 Graph regularization
 Symmetric constraint
 Lowrank representation
 Spectral clustering