DocumentCode
2526449
Title
Sparse robust matrix tri-factorization with application to cancer genomics
Author
Kim, Seung-Jun ; Hwang, TaeHyun ; Giannakis, Georgios B.
Author_Institution
Dept. of Electr. & Comput. Eng., Univ. of Minnesota, Minneapolis, MN, USA
fYear
2012
fDate
28-30 May 2012
Firstpage
1
Lastpage
6
Abstract
Nonnegative matrix tri-factorization (NMTF) X ≈ FSGT with all matrices nonnegative can reveal simultaneous row and column clusters of X, as well as the associations among the two. In this work, a sparsity-promoting variant is proposed and a simple multiplicative algorithm is developed. The resulting sparse NMTF is further robustified to cope with presence of outliers in the data. A synthetic example illustrates the efficacy of the method. A novel application to cancer patient clustering and pathway analysis is presented using real datasets.
Keywords
biology computing; cancer; data handling; genomics; matrix decomposition; cancer genomics; cancer patient clustering; column clusters; nonnegative matrix tri-factorization; pathway analysis; row clusters; simple multiplicative algorithm; sparse NMTF; sparse robust matrix tri-factorization; sparsity-promoting variant; Bioinformatics; Cancer; Conferences; Gene expression; Optimization; Robustness; Sparse matrices;
fLanguage
English
Publisher
ieee
Conference_Titel
Cognitive Information Processing (CIP), 2012 3rd International Workshop on
Conference_Location
Baiona
Print_ISBN
978-1-4673-1877-8
Type
conf
DOI
10.1109/CIP.2012.6232906
Filename
6232906
Link To Document