BMC Bioinformatics · 2013 · 135 citations · 27 references
Life SciencesBioinformaticsOncologyGene Expression AnalysisGenomic Data AnalysisOptimizationCancer ClusteringGene Expression ProfilingMatrix FactorizationCancer BioinformaticsClusteringExpectation-maximizationExpectation-maximization AlgorithmGene ClusteringKullback-leibler DivergenceNon-negative Matrix Factorization
BACKGROUND: Non-negative 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 non-negative matrices whose product closely approximates the original matrix. Traditional NMF methods minimize either the l2 norm or the Kullback-Leibler 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 (NMF-MCC) for gene expression data-based cancer clustering. Instead of minimizing the l2 norm or the Kullback-Leibler distance, NMF-MCC 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 state-of-the-art methods in cancer clustering.
27
Todd R. Golub, Donna K. Slonim, Pablo Tamayo et al. · Science · 1999 · 11.6K citations
Algorithms for Non-negative Matrix Factorization
Daniel D. Lee, H. Sebastian Seung · 2000 · 5.5K citations
ALGORITHMS FOR NON-NEGATIVE MATRIX FACTORIZATION
D Seung, Lin-Wen Lee · 2001 · 4.8K citations
Arindam Bhattacharjee, William G. Richards, Jane Staunton et al. · Proceedings of the National Academy of Sciences · 2001 · 2.6K citations · Full text