 Methodology article
 Open Access
 Published:
Nonnegative matrix factorization by maximizing correntropy for cancer clustering
BMC Bioinformatics volume 14, Article number: 107 (2013)
Abstract
Background
Nonnegative matrix factorization (NMF) has been shown to be a powerful tool for clustering gene expression data, which are widely used to classify cancers. NMF aims to find two nonnegative matrices whose product closely approximates the original matrix. Traditional NMF methods minimize either the l_{2} norm or the KullbackLeibler distance between the product of the two matrices and the original matrix. Correntropy was recently shown to be an effective similarity measurement due to its stability to outliers or noise.
Results
We propose a maximum correntropy criterion (MCC)based NMF method (NMFMCC) for gene expression databased cancer clustering. Instead of minimizing the l_{2} norm or the KullbackLeibler distance, NMFMCC maximizes the correntropy between the product of the two matrices and the original matrix. The optimization problem can be solved by an expectation conditional maximization algorithm.
Conclusions
Extensive experiments on six cancer benchmark sets demonstrate that the proposed method is significantly more accurate than the stateoftheart methods in cancer clustering.
Background
Because cancer has been a leading cause of death in the world for several decades, the classification of cancers is becoming more and more important to cancer treatment and prognosis [1, 2]. With advances in DNA microarray technology, it is now possible to monitor the expression levels of a large number of genes at the same time. There have been a variety of studies on analyzing DNA microarray data for cancer class discovery [35]. Such methods are demonstrated to outperform the traditional, morphological appearancebased cancer classification methods. In such studies, different cancer classes are discriminated by their corresponding gene expression profiles [1].
Several clustering algorithms have been used to identify groups of similar expressed genes. Nonnegative matrix factorization (NMF) was recently introduced to analyze gene expression data and this method demonstrated superior performance in terms of both accuracy and stability [68]. Gao and Church [3] reported an effective unsupervised method for cancer clustering with gene expression profiles via sparse NMF (SNMF). Carmona et al. [9] presented a methodology that was able to cluster closely related genes and conditions in subportions of the data based on nonsmooth nonnegative matrix factorization (nsNMF), which was able to identify localized patterns in large datasets. Zheng et al. [5, 7] applied penalized matrix decomposition (PMD) to extract metasamples from gene expression data, which could captured the inherent structures of samples that belonged to the same class.
NMF approximates a given gene data matrix, X, as a product of two lowrank nonnegative matrices, H and W, as X≈H W. This is usually formulated as an optimization problem, where the objective function is to minimize either the l_{2} norm or the KullbackLeibler (KL) distance [10] between X and HW. Most of the improved NMF algorithms are also based on the minimization of these two distances while adding the sparseness term [3], the graph regularization term [11], etc. Sandler and Lindenbaum [12] argued that measuring the dissimilarity of W and HW by either the l_{2} norm or the KL distance, even with additional bias terms, was inappropriate in computer vision applications due to the nature of errors in images. Sandler and Lindenbaum [12] proposed a novel NMF with earth mover’s distance (EMD) metric by minimizing the EMD error between X and HW. The proposed NMFEMD algorithm demonstrated significantly improved performance in two challenging computer vision tasks, i.e., texture classification and face recognition. Liu et al. [4] tested a family of NMF algorithms using αdivergence with different α values as dissimilarities between X and HW for clustering cancer gene expression data.
It is widely acknowledged that DNA microarry data contain many types of noise, especially experimental noise. Recently, correntropy was shown to be an effective similarity measurement in information theory due to its stability to outliers or noise [13]. However, it has not been used in the analysis of microarray data. In this paper, we propose a novel form of NMF that maximizes the correntropy. We introduce a new NMF algorithm with a maximum correntropy criterion (MCC) [13] for the gene expression databased cancer clustering problem. We call it NMFMCC. The goal of NMFMCC is to find a metasample matrix, H, and a coding matrix, W, such that the gene expression data matrix, X, is as correlative to the product of H and W as possible under MCC.
Related works
He et al. [13] recently developed a face recognition algorithm, correntropybased sparse representation (CESR), based on MCC. CESR tries to find a group of sparse combination coefficients to maximize the correntropy between the facial image vector and the linear combination of faces in the database. He et al. [13] demonstrated that CESR was much more effective in dealing with the occlusion and corruption problems of face recognition than the stateoftheart methods. However, CESR learns only the combination coefficients while the basis faces (the faces in the database) are fixed. Comparing to CESR, NMFMCC can learn both the combination coefficients and the basis vectors jointly, which allows the algorithm to obtain more basis vectors for better representation of the data points. Zafeiriou and Petrou [14] addressed the problem of NMF with kernel functions instead of inner products and proposed the projected gradient kernel nonnegative matrix factorization (PGKNMF) algorithm. Both NMFMCC and PGKNMF employ kernel functions to map the linear data space to a nonlinear space. However, as we show later, NMFMCC computes different kernels for different features, while PGKNMF computes a single kernel for the whole feature vector. Thus, NMFMCC allows the algorithm to assign different weights to different features and emphasizes the discriminant features with high weights, thus achieving feature selection. In contrast, like most kernel based methods, PGKNMF simply replaces the inner product by the kernelfunction and treats the features equally, thus there is no feature selection function.
Methods
In this section, we first briefly introduce the traditional NMF method. We then propose our novel NMFMCC algorithm by maximizing the correntropy in NMF. We further propose a expectation conditional maximizationbased approach to solve the optimization problem.
Nonnegative matrix factorization
NMF is a matrix factorization algorithm that focuses on the analysis of data matrices whose elements are nonnegative. Consider a gene expression dataset that consists of D genes in N samples. We denote it by a matrix $X=[{x}_{1},\cdots \phantom{\rule{0.3em}{0ex}},{x}_{N}]\in {\mathfrak{\Re}}^{D\times N}$ of size D×N, and each column of X is a sample vector containing D genes. NMF aims to find two nonnegative matrices, $H=\left[{h}_{\mathit{\text{dk}}}\right]\in {\mathfrak{\Re}}^{D\times K}$ and $W=\left[{w}_{\mathit{\text{kn}}}\right]\in {\mathfrak{\Re}}^{K\times N}$, whose product closely approximates the original matrix X:
Matrix H is of size D×K, with each of the K columns defining a metasample and each entry, h_{ d k }, in H representing the expression level of gene d over metasample k. Matrix W is of size K×N, with each of the n columns representing the metasample expression pattern of the corresponding sample, and each entry, w_{ k n }, representing the coefficient of metasample k over sample n. Figure 1 shows an example of the factorization of a gene expression matrix X with D=2308 genes and N=83 samples as the product of the metasample matrix H with K=4 metasamples and the coding matrix W.
The factorization is quantified by an objective function that minimizes some distance measure, such as:

l_{ 2 }norm distance: One simple measure is the square of the l_{2} norm distance (also known as the Frobenius norm or the Euclidean distance) between two matrices, which is defined as:
$$\begin{array}{l}{F}^{{l}_{2}}=\sum _{d=1}^{D}\sum _{n=1}^{N}{\left({X}_{\mathit{\text{dn}}}\sum _{k=1}^{K}{H}_{\mathit{\text{dk}}}{W}_{\mathit{\text{kn}}}\right)}^{2}.\end{array}$$(2) 
Kullback  Leibler (KL) divergence: The second one is the divergence between two matrices [10], which is defined as:
$${F}^{\mathit{\text{KL}}}=\sum _{d=1}^{D}\sum _{n=1}^{N}\left({X}_{\mathit{\text{dn}}}\mathit{\text{ln}}\frac{{X}_{\mathit{\text{dn}}}}{{(\mathit{\text{HW}})}_{\mathit{\text{dn}}}}{X}_{\mathit{\text{dn}}}+{(\mathit{\text{HW}})}_{\mathit{\text{nd}}}\right).$$(3)
Maximum correntropy criterion for NMF
Another thing that has to be changed is that the definition of correntropy is not subject to the kernel being Gaussian as they seem to imply through the text, so for instance when they define they can say E(k(xy)) and one of the common choices of k is the Gaussian kernel giving....
Correntropy is a nonlinear similarity measure between two random variables, x and y[13, 15, 16], defined as
where k_{ σ } is a kernel that satisfies the Mercer theory and E[·] is the expectation. One of the common choices of k_{ σ } is the Gaussian kernel given as ${k}_{\sigma}(xy)=\mathit{\text{exp}}(\frac{{(xy)}^{2}}{2{\sigma}^{2}})$.
In practice, the joint probability density function of x and y is unknown and only a finite amount of data {(x_{ i },y_{ i })},i=1,⋯,I is available. Therefore, the sample correntropy is estimated by
Based on Eq. (5), a general similarity measurement between any two discrete gene expression vectors was proposed [17]. They introduced the correntropy induced metric (CIM) for any two gene sample vectors x=[x_{1},⋯,x_{ D }]^{⊤} and y=[y_{1},⋯,y_{ D }]^{⊤}, as:
where e_{ d }=x_{ d }−y_{ d } is defined as the error. For adaptive systems, we can define the maximum correntropy criterion (MCC) [18] as
where Θ is a parameter to be specified later. We must notice the difference between MCC and common kernel criterion used in [14]. The Gaussian kernel function of vectors x and y is defined as
We can see that the kernel is applied to the entire feature vector, x, and each feature x_{ d },d=1⋯,D is treated equally with the same kernel parameter. However, in (7), kernel functions are applied to different functions. This can allow the algorithm to learn different kernel parameters as we will introduce later. In this way, we can assign different weights to different features and thus implement feature selection.
Our goal is to find a metasample matrix, H, and a coding matrix, W, such that HW is as correlative to X as possible under MCC as described in Eq. (7). To extend MCC from vector space R^{D} to matrix space R^{D×N}, we replace e_{ d }=(x_{ d }−y_{ d }) with the l_{2} norm distance between the samples of X and Y=H W as ${e}_{d}=\sqrt{{\sum}_{n=1}^{N}{({x}_{\mathit{\text{dn}}}{y}_{\mathit{\text{dn}}})}^{2}}$, where y_{ d n } is the (d,n)th item of Y, and ${y}_{\mathit{\text{dn}}}={\sum}_{k=1}^{K}{h}_{\mathit{\text{dk}}}{w}_{\mathit{\text{kn}}}$. Moreover, the factorization system parameter should be set to Θ=(H,W) under the framework of NMFMCC. By substituting newly defined e_{ d } and Θ to (7), we can formulate the problem of NMFMCC as the following optimization problem:
We should notice the significant difference between NMFMCC and CESR. As a supervised learning algorithm, the CESR represents a test data point, x_{ t }, as a linear combination of all the the training data points as ${x}_{t}\approx {\sum}_{n=1}^{N}{x}_{n}{w}_{\mathit{\text{nt}}}=X{w}_{t}$ and w_{ t }=[w_{1t},⋯,w_{ N t }]^{⊤} is the combination coefficient vector. CESR aims to find the optimal w_{ t } to maximize the correntropy between x_{ t } and X w_{ t }. Similarly, NMFMCC also tries to represent a data point x_{ n } as a linear combination of some basis vectors as ${x}_{n}\approx {\sum}_{k=1}^{K}{h}_{k}{w}_{\mathit{\text{kn}}}=X{w}_{n}$ and w_{ n }=[w_{1n},⋯,w_{ K n }]^{⊤} is the combination coefficient vector. Differently from CESR, NMFMCC aims to find not only the optimal w_{ n } but also the basis vectors in H to maximize the correntropy between x_{ n } and H w_{ n }, n=1,⋯,N. The internal difference between NMFMCC and CESR lies in whether to learn basis vectors or not.
In order to solve the optimization problem, we recognize that the expectation conditional maximization (ECM) method [19] can be applied. Based on the theory of convex conjugate functions [20], we can derive the following proposition that forms the basis to solve the optimization problem in (9):
Proposition 1
There exists a convex conjugate function of g(z,σ) such that
and for a fixed z, the supremum is reached at ϱ=−g(z,σ).
By substituting Eq. (10) into (9), we have the augmented objective function in an enlarged parameter space
where superscript φ is the convex conjugate function φ of g(z) defined in Proposition 1, and ρ=[ρ_{1},⋯,ρ_{ D }]^{⊤} are the auxiliary variables.
According to Proposition 1, for fixed H and W, the following equation holds:
It follows that
That is, maximizing F(H,W) is equivalent to maximizing the augmented function $\hat{F}(H,W,\mathit{\rho})$.
The NMFMCC Algorithm
The traditional NMF can be solved by the expectationmaximization (EM) algorithm [21]. However, in the case of MCCbased NMF, EM must be replaced by ECM because there is more than one parameter. Figure 2 shows the outline of ECM, which is described in more detail below.

1.
EStep: Compute ρ given the current estimations of the metasample matrix H and the coding matrix W as:
$$\begin{array}{l}{\rho}_{d}^{t}=g\phantom{\rule{1pt}{0ex}}\left(\sqrt{\sum _{n=1}^{N}{\left({x}_{\mathit{\text{dn}}}\sum _{k=1}^{K}{h}_{\mathit{\text{dk}}}^{t}{w}_{\mathit{\text{kn}}}^{t}\right)}^{2}},{\sigma}^{t}\right),\end{array}$$(14)where t means the tth iteration. In this study, the kernel size (bandwidth) σ^{2}^{t} is computed by
$$\begin{array}{l}{{\sigma}^{2}}^{t}=\frac{\theta}{2D}\sum _{d=1}^{D}\sum _{n=1}^{N}{\left({x}_{\mathit{\text{dn}}}\sum _{k=1}^{K}{h}_{\mathit{\text{dk}}}^{t}{w}_{\mathit{\text{kn}}}^{t}\right)}^{2},\end{array}$$(15)where Θ is a parameter to control the sparseness of ${\rho}_{d}^{t}$.

2.
CMsteps: In the CMstep, given ${\rho}_{d}^{t}$, we try to optimize the following function respect to H and W:
$$\begin{array}{l}\phantom{\rule{16.0pt}{0ex}}({H}^{t+1},{W}^{t+1})=\underset{H,W}{\mathit{\text{argmax}}}\sum _{d=1}^{D}\left({\rho}_{d}^{t}\sum _{n=1}^{N}{\left({x}_{\mathit{\text{dn}}}\sum _{k=1}^{K}{h}_{\mathit{\text{dk}}}{w}_{\mathit{\text{kn}}}\right)}^{2}\right)\\ \phantom{\rule{7.5em}{0ex}}=\underset{H,W}{\mathit{\text{argmax}}}\phantom{\rule{1em}{0ex}}\mathit{\text{Trac}}\left[{(X\phantom{\rule{0.3em}{0ex}}\phantom{\rule{0.3em}{0ex}}\mathit{\text{HW}})}^{\top}\mathit{\text{diag}}\phantom{\rule{1pt}{0ex}}({\mathit{\rho}}^{t})(X\phantom{\rule{0.3em}{0ex}}\phantom{\rule{0.3em}{0ex}}\mathit{\text{HW}})\right]\\ \phantom{\rule{8.5em}{0ex}}\mathrm{s.t.}\phantom{\rule{1em}{0ex}}H\ge 0,\phantom{\rule{1em}{0ex}}W\ge 0,\end{array}$$(16)where d i a g(·) is an operator that converts the vector ρ to a diagonal matrix.
By introducing a dual objective function,
$$\begin{array}{l}\phantom{\rule{16.0pt}{0ex}}\mathcal{O}(H,W)=\mathit{\text{Trac}}\phantom{\rule{1pt}{0ex}}\left[{(X\mathit{\text{HW}})}^{\top}\mathit{\text{diag}}({\mathit{\rho}}^{t})(X\mathit{\text{HW}})\right]\\ \phantom{\rule{4em}{0ex}}=\mathit{\text{Trac}}\phantom{\rule{1pt}{0ex}}\left[{X}^{\top}\mathit{\text{diag}}({\mathit{\rho}}^{t})X\right]\phantom{\rule{0.3em}{0ex}}\phantom{\rule{0.3em}{0ex}}\phantom{\rule{0.3em}{0ex}}2\mathit{\text{Trac}}\phantom{\rule{1pt}{0ex}}\left[{X}^{\top}\mathit{\text{diag}}({\mathit{\rho}}^{t})\mathit{\text{HW}}\right]\\ \phantom{\rule{5.5em}{0ex}}+\mathit{\text{Trac}}\phantom{\rule{1pt}{0ex}}\left[{W}^{\top}{H}^{\top}\mathit{\text{diag}}({\mathit{\rho}}^{t})\mathit{\text{HW}}\right],\end{array}$$(17)the optimal problem in (16) can be reformulated as the following dual problem:
$$\begin{array}{l}({H}^{t+1},{W}^{t+1})=\underset{H,W}{\mathit{\text{argmin}}}\phantom{\rule{1em}{0ex}}\mathcal{O}(H,W)\\ \phantom{\rule{8.9em}{0ex}}\mathrm{s.t.}\phantom{\rule{1em}{0ex}}H\ge 0,\phantom{\rule{1em}{0ex}}W\ge 0.\end{array}$$(18)Let ϕ_{ d k } and ψ_{ k n } be the Lagrange multiplier for constraints h_{ d k }≥0 and w_{ k n }≥0, respectively, and Φ=[ϕ_{ d k }] and Ψ=[ψ_{ k n }]. The Lagrange $\mathcal{\mathcal{L}}$ is
$$\begin{array}{l}\phantom{\rule{16.0pt}{0ex}}\mathcal{\mathcal{L}}=\mathit{\text{Trac}}\phantom{\rule{1pt}{0ex}}\left[{X}^{\top}\mathit{\text{diag}}({\mathit{\rho}}^{t})X\right]2\mathit{\text{Trac}}\phantom{\rule{1pt}{0ex}}\left[{X}^{\top}\mathit{\text{diag}}({\mathit{\rho}}^{t})\mathit{\text{HW}}\right]\\ \phantom{\rule{2.2em}{0ex}}+\mathit{\text{Trac}}\phantom{\rule{1pt}{0ex}}\left[{W}^{\top}{H}^{\top}\mathit{\text{diag}}({\mathit{\rho}}^{t})\mathit{\text{HW}}\right]+\mathit{\text{Trac}}\phantom{\rule{1pt}{0ex}}\left[\Phi {H}^{\top}\right]\\ \phantom{\rule{2.2em}{0ex}}+\mathit{\text{Trac}}\phantom{\rule{1pt}{0ex}}\left[\Psi {W}^{\top}\right].\end{array}$$(19)The partial derivatives of $\mathcal{\mathcal{L}}$ with respect to H and W are
$$\begin{array}{ll}\frac{\partial \mathcal{\mathcal{L}}}{\mathrm{\partial H}}=& 2\mathit{\text{diag}}({\mathit{\rho}}^{t})X{W}^{\top}+2\mathit{\text{diag}}({\mathit{\rho}}^{t})\mathit{\text{HW}}{W}^{\top}\phantom{\rule{0.3em}{0ex}}+\phantom{\rule{0.3em}{0ex}}\Phi \end{array}$$(20)and
$$\begin{array}{l}\frac{\partial \mathcal{\mathcal{L}}}{\mathrm{\partial W}}=2{H}^{\top}\mathit{\text{diag}}({\mathit{\rho}}^{t})X+2{H}^{\top}\mathit{\text{diag}}({\mathit{\rho}}^{t})\mathit{\text{HW}}+\Psi \end{array}$$(21)Using the KarushKuhnTucker optimal conditions, i.e., ϕ_{ d k }h_{ d k }=0 and ψ_{ k n }w_{ k n }=0, we get the following equations for h_{ d k } and w_{ k n }:
$$\begin{array}{l}2{(\mathit{\text{diag}}({\mathit{\rho}}^{t})X{W}^{\top})}_{\mathit{\text{dk}}}{h}_{\mathit{\text{dk}}}\\ +2{(\mathit{\text{diag}}({\mathit{\rho}}^{t})\mathit{\text{HW}}{W}^{\top})}_{\mathit{\text{dk}}}{h}_{\mathit{\text{dk}}}=0\end{array}$$(22)and
$$\begin{array}{l}2{({H}^{\top}\mathit{\text{diag}}({\mathit{\rho}}^{t})X)}_{\mathit{\text{kn}}}{w}_{\mathit{\text{kn}}}\\ +2{({H}^{\top}\mathit{\text{diag}}({\mathit{\rho}}^{t})\mathit{\text{HW}})}_{\mathit{\text{kn}}}{w}_{\mathit{\text{kn}}}=0\end{array}$$(23)These equations lead to the following updating rules to maximize the expectation in (13).

The metasample matrix H, conditioned on the coding matrix W:
$$\begin{array}{l}{h}_{\mathit{\text{dk}}}^{t+1}\leftarrow {h}_{\mathit{\text{dk}}}^{t}\frac{{(\mathit{\text{diag}}({\mathit{\rho}}^{t})X{{W}^{t}}^{\top})}_{\mathit{\text{dk}}}}{{(\mathit{\text{diag}}({\mathit{\rho}}^{t}){H}^{t}{W}^{t}{{W}^{t}}^{\top})}_{\mathit{\text{dk}}}}\end{array}$$(24) 
The coding matrix W conditioned on the newly estimated metasample matrix H^{t+1}:
$$\begin{array}{l}{w}_{\mathit{\text{kn}}}^{t+1}\leftarrow {w}_{\mathit{\text{kn}}}^{t}\frac{{({{H}^{t+1}}^{\top}\mathit{\text{diag}}({\mathit{\rho}}^{t})X)}_{\mathit{\text{kn}}}}{{({{H}^{t+1}}^{\top}\mathit{\text{diag}}({\mathit{\rho}}^{t}){H}^{t+1}{W}^{t})}_{\mathit{\text{kn}}}}\end{array}$$(25)
We should note that if we exchange the numerator and denominator in (24) and (25), new update formulas will be yield. The new update rules are dual for (24) and (25), and our experimental results show that the dual update rules achieve similar clustering performances as (24) and (25).

Algorithm 1 summarizes the optimization procedure.
Algorithm 1 NMFMCC Algorithm
Proof of convergence
In this section, we will prove that the objective function in (16) is nonincreasing under the updating rules in (24) and (25).
Theorem 1
The objective function in (16) is nonincreasing under the update rules (24) and (25).
To prove the above theorem, we first define an auxiliary function.
Definition 1
G(w,w^{′}) is an auxiliary function for F(w) if the conditions
are satisfied.
The auxiliary function is quite useful because of the following lemma:
Lemma 1
If G is an auxiliary function of F, then F is nonincreasing under the update
We refer the readers to [22] for the proof of this lemma. Now, we show that the updating rule of (25) is exactly the update in (27) with a proper auxiliary function. We denote the objective function in (16) as O:
Considering any element, w_{ k n }, in W, we use F_{ k n } to denote the part of the objective function in (16) that is relevant only to w_{ k n }. It is easy to check that
Since the updating rule is essentially based on elements, it is sufficient to show that each F_{ k n } is nonincreasing under the update step of (25).
Lemma 2
Function
is an auxiliary function for F_{ k n }, which is relevant only to w_{ k n }.
Proof
Since G(w,w)=F_{ k n }(w) is obvious, we only need to show that $G(w,{w}_{\mathit{\text{kn}}}^{t})\ge {F}_{\mathit{\text{kn}}}(w)$. To do this, we compare the Taylor series expansion of F_{ k n }(w),
with (30) to find that $G(w,{w}_{\mathit{\text{kn}}}^{t})\ge {F}_{\mathit{\text{kn}}}(w)$ is equivalent to
We have
Thus, (32) holds and $G(w,{w}_{\mathit{\text{kn}}}^{t})\ge {F}_{\mathit{\text{kn}}}(w)$. □
We can now demonstrate the convergence of Theorem 1.
Proof of Theorem 1
Replacing G(w,w^{t}) in (27) by (30) results in the update rule
Since (30) is an auxiliary function, F_{ k n } is nonincreasing under this update rule as in (25).
Similarly, we can also show that O is nonincreasing under the updating steps in (24).
Experiments
Datasets
To test the proposed algorithm, we carry out extensive experiments on six cancerrelated gene expression datasets. The six datasets consist of five multiclass sets as used in [4, 23] and one binary class set [24]. The descriptions of the six datasets are summarized in Table 1. In these datasets, besides the gene expression data samples, the labels are also given. They were obtained from the diagnosis results and reported in different studies [23].
Performance metric
The proposed NMFMCC algorithm will be used to represent gene expression data for kmeans clustering. The clustering results are evaluated by comparing the obtained label of each sample with the label provided by the dataset. The clustering accuracy is used to measure the clustering performance. Given a microarray dataset containing N samples that belong to K classes, we assume that K is given in all the algorithms tested here. For each sample, x_{ n }, let c_{ n } be the cluster label predicted by an algorithm and r_{ n } be the cancer type label provided by the dataset. The accuracy of the algorithm is defined as:
where I(A,B) returns 1 if A=B and 0 otherwise.
Tested methods
We first compared the MCC with other loss functions between X and HW for the NMF algorithm on the cancer clustering problem, including l_{2} norm distance, KL distance [10], αdivergence [4], and earth mover’s distance (EMC) [12]. We further compared the proposed NMFMCC algorithm with other NMFbased algorithms, including the penalized matrix decomposition (PMD) algorithm [7], the original NMF algorithm [22], the sparse nonnegative matrix factorization (SNMF) algorithm [3], the nonsmooth nonnegative matrix factorization (nsNMF) algorithm [9] and the projected gradient kernel nonnegative matrix factorization (PGKNMF).
Results
Since the initial H and W are selected randomly, we performed 100 independent trials and computed the average and the standard deviations of the accuracy for each loss function. The results from the comparison of MCC with other loss functions are presented in Figure 3. As shown in Figure 3, MCC consistently performed the best on all the six datasets. The other loss functions performed well on some datasets, but poorly on the others. It seems that the improvement of MCC increased when the number of genes increased. The standard deviation on the accuracy of MCC was much smaller than the standard deviation on the other loss functions, indicating that MCC is the most stable. On the other hand, EMD, although worked quite well in computer vision tasks [12], it did not perform well on gene expression data due to the significant difference between the image data and the gene expression data.
The results of the comparison of NMFMCC with other related NMF methods are presented in Figure 4. Figure 4 shows the performance of different algorithms on the six datasets. The NMFMCC algorithm outperformed the other algorithms on five out of the six datasets. The NMFMCC algorithm could correctly cluster more than 88% and 78% of the samples in the Leukemia and DLBCL datasets, respectively, in a completely unsupervised manner. In contrast, the l_{2} norm distancebased NMF algorithm performed even worse than the baseline PMD algorithm on the Leukemia and DLBCL datasets, i.e., an average accuracy of 73% and 67%, respectively. This verifies that correntropy is a much better measure of cancer clustering data. Note that NMFMCC significantly outperformed the other algorithms on the Lung Cancer dataset, which contains a large number of genes. This implies that among the large number of genes, only a small fraction is likely to be relevant to cancerous tumor growth or spread. In NMFMCC, the auxiliary variables −ρ acts as the feature selectors, we was able to select the relevant genes. Although the SNMF and nsNMF algorithms also improved on the performance of the baseline NMF algorithm, the improvement was much less than that of the NMFMCC algorithm. A possible reason is that many genes exhibit similar patterns across all of the samples with only a few genes differentiating different cancer classes. They are likely to be sampled from a nonlinear manifold. Hence, the loss function defined by a linear kernel with either the l_{2} norm or the KL distance could not capture them. In contrast, the NMFMCC algorithm had a loss function that was defined by the correntropy and a Gaussian kernel, which could capture the nonlinear manifold structure much more effectively. By mapping the gene expression data into the nonlinear dataspace by a Gaussian kernel, the PGKNMF outperformed the original NMF. However, our NMFMCC could even further improve the PGKNMF by applying different kernels to different features.
To understand what genes were selected by the NMFMCC algorithm, we drew the gene weight figure on the SRBCT dataset (Figure 5). It can be seen that the −ρ vector is sparse, which shows the significance of certain genes. The resulting metasample matrix weighted by −ρ with the corresponding coding matrix is shown in Figure 6. By comparing to the coding matrix learned by the original NMF with the l_{2} norm distance in Figure 1, we determine that the coding matrix learned by the NMFMCC algorithm is much more discriminative among different cancer classes. On this dataset, the NMRMCC algorithm achieved an average clustering accuracy of 63%.
Discussion
Traditional unsupervised learning techniques select features with features selection algorithms and then do clustering using the selected features. The NMFMCC algorithm proposed here achieves both goals simultaneously. The learned gene weight vector reflects the importance of the genes in the gene clustering task, and the coding matrix encodes the clustering results for the samples.
Our experimental results demonstrate that the improvement of NMRMCC over the other methods increases when the number of genes increases. This shows the ability of the proposed algorithm to effectively select the important genes and cluster samples. This is an important property because highdimensional data analysis has become increasingly frequent and important in diverse fields of sciences and engineering, and social sciences, ranging from genomics and health sciences to economics, finance and machine learning. For instance, in genomewide association studies, hundreds of thousands of SNPs are potential covariates for phenotypes such as cholesterol level or height. The large number of features presents an intrinsic challenge to many classical problems, where usual lowdimensional methods no longer apply. The NMFMCC algorithm has been demonstrated to work well on the datasets with small numbers of samples but large numbers of features. It can therefor provide a powerful tool to study highdimensional problems, such as genomewide association studies.
Conclusion
We have proposed a novel NMFMCC algorithm for gene expression databased cancer clustering. Experiments demonstrate that correntropy is a better measure than the traditional l_{2} norm and KL distances for this task, and the proposed algorithm significantly outperforms the existing methods.
References
 1.
Shi F, Leckie C, MacIntyre G, Haviv I, Boussioutas A, Kowalczyk A: A biordering approach to linking gene expression with clinical annotations in gastric cancer. BMC Bioinformatics. 2010, 11: 47710.1186/1471210511477.
 2.
de Souto MCP, Costa IG, de Araujo DSA, Ludermir TB, Schliep A: Clustering cancer gene expression data: a comparative study. BMC Bioinformatics. 2008, 9: 49710.1186/147121059497.
 3.
Gao Y, Church G: Improving molecular cancer class discovery through sparse nonnegative matrix factorization. Bioinformatics. 2005, 21 (21): 3970—3975
 4.
Liu W, Yuan K, Ye D: On alphadivergence based nonnegative matrix factorization for clustering cancer gene expression data. Artif Intell Med. 2008, 44 (1): 15. 10.1016/j.artmed.2008.05.001.
 5.
Zheng CH, Ng TY, Zhang L, Shiu CK, Wang HQ: Tumor classification based on nonnegative matrix factorization using gene expression data. IEEE Trans Nanobioscience. 2011, 10 (2): 8693.
 6.
Kim MH, Seo HJ, Joung JG, Kim JH: Comprehensive evaluation of matrix factorization methods for the analysis of DNA microarray gene expression data. BMC Bioinformatics. 2011, 12 (Suppl 13): S810.1186/1471210512S13S8.
 7.
Zheng CH, Zhang L, Ng VTY, Shiu SCK, Huang DS: Molecular pattern discovery based on penalized matrix decomposition. IEEE/ACM Trans Comput Biol Bioinformcs. 2011, 8 (6): 15921603.
 8.
Tjioe E, Berry M, Homayouni R, Heinrich K: Using a literaturebased NMF model for discovering gene functional relationships. BMC Bioinformatics. 2008, 9 (7): P1
 9.
CarmonaSaez P, PascualMarqui R, Tirado F, Carazo J, PascualMontano A: Biclustering of gene expression data by nonsmooth nonnegative matrix factorization. BMC Bioinformatics. 2006, 7: 7810.1186/14712105778.
 10.
Venkatesan R, Plastino A: Deformed statistics KullbackLeibler divergence minimization within a scaled Bregman framework. Phys Lett A. 2011, 375 (48): 42374243. 10.1016/j.physleta.2011.09.021.
 11.
Cai D, He X, Han J, Huang TS: Graph regularized nonnegative matrix factorization for data representation. IEEE Trans Pattern Anal Mach Intell. 2011, 33 (8): 15481560.
 12.
Sandler R, Lindenbaum M: Nonnegative matrix factorization with earth mover’s distance metric for image analysis. IEEE Trans Pattern Anal Mach Intell. 2011, 33 (8): 15901602.
 13.
He R, Zheng WS, Hu BG: Maximum correntropy criterion for robust face recognition. IEEE Trans Pattern Anal Mach Intell. 2011, 33 (8): 15611576.
 14.
Zafeiriou S, Petrou M: Nonlinear nonnegative component analysis. CVPR: 2009 IEEE Conference on Computer Vision and Pattern Recognition, Vols 14. 2010, Miami: IEEE Conference on Computer Vision and Pattern Recognition, 28522857.
 15.
Yan H, Yuan X, Yan S, Yang J: Correntropy based feature selection using binary projection. Pattern Recognit. 2011, 44 (12): 28342842. 10.1016/j.patcog.2011.04.014.
 16.
He R, Hu BG, Zheng WS, Kong XW: Robust principal component analysis based on maximum correntropy criterion. IEEE Trans Image Process. 2011, 20 (6): 14851494.
 17.
Chalasani R, Principe JC: Self organizing maps with the correntropy induced metric. Proceedings of the 2010 International Joint Conference on Neural Networks (IJCNN2010). 2010, Barcelona, Spain: , 16.
 18.
Liu W, Pokharel PP, Principe JC: Correntropy: properties and applications in nongaussian signal processing. IEEE Trans Signal Process. 2007, 55 (11): 52865298.
 19.
Horaud R, Forbes F, Yguel M, Dewaele G, Zhang J: Rigid and articulated point registration with expectation conditional maximization. IEEE Trans Pattern Anal Mach Intell. 2011, 33 (3): 587602.
 20.
BEER G: Conjugate convexfunctions and the epidistance topology. Proc Am Math Soc. 1990, 108 (1): 117126. 10.1090/S00029939199009824008.
 21.
Qi Y, Ye P, Bader J: Genetic interaction motif finding by expectation maximization  a novel statistical model for inferring gene modules from synthetic lethality. BMC Bioinformatics. 2005, 6: 28810.1186/147121056288.
 22.
Lee DD, Seung HS: Algorithms for nonnegative matrix factorization. Adv Neural Inf Process Syst. 2001, 13: 556562.
 23.
Statnikov A, Aliferis C, Tsamardinos I, Hardin D, Levy S: A comprehensive evaluation of multicategory classification methods for microarray gene expression cancer diagnosis. Bioinformatics. 2005, 21 (5): 631643. 10.1093/bioinformatics/bti033.
 24.
Shipp M, Ross K, Tamayo P, Weng A, Kutok J, Aguiar R, Gaasenbeek M, Angelo M, Reich M, Pinkus G, Ray T, Koval M, Last K, Norton A, Lister T, Mesirov J, Neuberg D, Lander E, Aster J, Golub T: Diffuse large Bcell lymphoma outcome prediction by geneexpression profiling and supervised machine learning. Nat Med. 2002, 8 (1): 6874. 10.1038/nm010268.
 25.
Golub T, Slonim D, Tamayo P, Huard C, Gaasenbeek M, Mesirov J, Coller H, Loh M, Downing J, Caligiuri M, Bloomfield C, Lander E: Molecular classification of cancer: Class discovery and class prediction by gene expression monitoring. Science. 1999, 286 (5439): 531537. 10.1126/science.286.5439.531.
 26.
Pomeroy S, Tamayo P, Gaasenbeek M, Sturla L, Angelo M, McLaughlin M, Kim J, Goumnerova L, Black P, Lau C, Allen J, Zagzag D, Olson J, Curran T, Wetmore C, Biegel J, Poggio T, Mukherjee S, Rifkin R, Califano A, Stolovitzky G, Louis D, Mesirov J, Lander E, Golub T: Prediction of central nervous system embryonal tumour outcome based on gene expression. Nature. 2002, 415 (6870): 436442. 10.1038/415436a.
 27.
Bhattacharjee A, Richards W, Staunton J, Li C, Monti S, Vasa P, Ladd C, Beheshti J, Bueno R, Gillette M, Loda M, Weber G, Mark E, Lander E, Wong W, Johnson B, Golub T, Sugarbaker D, Meyerson M: Classification of human lung carcinomas by mRNA expression profiling reveals distinct adenocarcinoma subclasses. Proc Natl Acad Sci. 2001, 98 (24): 1379013795. 10.1073/pnas.191502998.
 28.
Staunton J, Slonim D, Coller H, Tamayo P, Angelo M, Park J, Scherf U, Lee J, Reinhold W, Weinstein J, Mesirov J, Lander E, Golub T: Chemosensitivity prediction by transcriptional profiling. Proc Natl Acad Sci. 2001, 98 (19): 1078710792. 10.1073/pnas.191368598.
 29.
Khan J, Wei J, Ringner M, Saal L, Ladanyi M, Westermann F, Berthold F, Schwab M, Antonescu C, Peterson C, Meltzer P: Classification and diagnostic prediction of cancers using gene expression profiling and artificial neural networks. Nat Med. 2001, 7 (6): 673679. 10.1038/89044.
Acknowledgements
The study was supported by a grant from King Abdullah University of Science and Technology, Saudi Arabia. We would like to thank Dr. Ran He for the discussion about the maximum correntropy criterion at ICPR 2012 conference.
Author information
Additional information
Competing interests
The authors declare that they have no competing interests.
Authors’ contributions
JW designed and implemented the algorithm, conducted the experiments, performed data analysis and drafted the manuscript. XW revised the manuscript. XG supervised the study and drafted the manuscript. All authors read and approved the final manuscript.
Authors’ original submitted files for images
Below are the links to the authors’ original submitted files for images.
Rights and permissions
About this article
Cite this article
Wang, J.J., Wang, X. & Gao, X. Nonnegative matrix factorization by maximizing correntropy for cancer clustering. BMC Bioinformatics 14, 107 (2013). https://doi.org/10.1186/1471210514107
Received:
Accepted:
Published:
Keywords
 Nonnegative Matrix Factorization
 Cancer Cluster
 Expectation Conditional Maximization
 Convex Conjugate Function
 Expectation Conditional Maximization Algorithm