Molecular cancer class discovery using non-negative matrix factorization with sparseness constraint

Authors:
Xiangzhen Kong;Chunhou Zheng;Yuqiang Wu;Li Shang
Affiliations:
Institute of Automation, Qufu Normal University, Rizhao, Shandong, China;School of Information and Communication Technology, Qufu Normal University, Suzhou, China;Institute of Automation, Qufu Normal University, Rizhao, Shandong, China;Department of Electronic Information Engineering, Suzhou Vocational University, Suzhou, China
Venue:
ICIC'07 Proceedings of the intelligent computing 3rd international conference on Advanced intelligent computing theories and applications
Year:
2007

Citing 7
Cited 2

Introduction to statistical pattern recognition (2nd ed.)

Introduction to statistical pattern recognition (2nd ed.)
Independent component analysis, a new concept?

Signal Processing - Special issue on higher order statistics
Consensus Clustering: A Resampling-Based Method for Class Discovery and Visualization of Gene Expression Microarray Data

Machine Learning
Document clustering based on non-negative matrix factorization

Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval
Non-negative Matrix Factorization with Sparseness Constraints

The Journal of Machine Learning Research
Improving molecular cancer class discovery through sparse non-negative matrix factorization

Bioinformatics
Document clustering using nonnegative matrix factorization

Information Processing and Management: an International Journal

Improving Tumor Clustering Based on Gene Selection

ICIC '08 Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues
Tumor clustering using nonnegative matrix factorization with gene selection

IEEE Transactions on Information Technology in Biomedicine - Special section on biomedical informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In cancer diagnosis and treatment, clustering based on gene expression data has been shown to be a powerful method in cancer class discovery. In this paper, we discuss the use of nonnegative matrix factorization with sparseness constraints (NMFSC), a method which can be used to learn a parts representation of the data, to analysis gene expression data. We illustrate how to choose appropriate sparseness factors in the algorithm and demonstrate the improvement of NMFSC by direct comparison with the nonnegative matrix factorization (NMF). In addition, when using it on the two well-studied datasets, we obtain pretty much the same results with the sparse non-negative matrix factorization (SNMF).