Recovering Hidden Diagonal Structures via Non-Negative Matrix Factorization with Multiple Constraints

被引:2
作者
Yang, Xi [1 ]
Han, Guoqiang [1 ]
Cai, Hongmin [1 ]
Song, Yan [1 ]
机构
[1] South China Univ Technol, Sch Comp Sci & Engn, Guangzhou 510006, Guangdong, Peoples R China
基金
中国国家自然科学基金;
关键词
Loading; Matrix decomposition; Load modeling; Sparse matrices; Biological system modeling; Numerical models; Standards; NMF; total variational norm; block structures; clustering; sparse; INTEGRATIVE ANALYSIS; CANCER; NMF; SEPARATION; CLASSIFICATION; ALGORITHMS; PREDICTION; DISCOVERY;
D O I
10.1109/TCBB.2017.2690282
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
Revealing data with intrinsically diagonal block structures is particularly useful for analyzing groups of highly correlated variables. Earlier researches based on non-negative matrix factorization (NMF) have been shown to be effective in representing such data by decomposing the observed data into two factors, where one factor is considered to be the feature and the other the expansion loading from a linear algebra perspective. If the data are sampled from multiple independent subspaces, the loading factor would possess a diagonal structure under an ideal matrix decomposition. However, the standard NMF method and its variants have not been reported to exploit this type of data via direct estimation. To address this issue, a non-negative matrix factorization with multiple constraints model is proposed in this paper. The constraints include an sparsity norm on the feature matrix and a total variational norm on each column of the loading matrix. The proposed model is shown to be capable of efficiently recovering diagonal block structures hidden in observed samples. An efficient numerical algorithm using the alternating direction method of multipliers model is proposed for optimizing the new model. Compared with several benchmark models, the proposed method performs robustly and effectively for simulated and real biological data.
引用
收藏
页码:1760 / 1772
页数:13
相关论文
共 51 条
[1]   Nonnegative matrix factorization based on projected hybrid conjugate gradient algorithm [J].
Abd El Aziz, Mohamed ;
Khidr, Wael .
SIGNAL IMAGE AND VIDEO PROCESSING, 2015, 9 (08) :1825-1831
[2]  
[Anonymous], FOUND TRENDS MACH LE
[3]  
[Anonymous], 2009, SLEP: Sparse Learning with Efficient Projections
[4]  
[Anonymous], 2017, IEEE Transactions on Circuits and Systems for Video Technology, DOI DOI 10.1109/TCSVT.2016.2539839
[5]  
[Anonymous], 2010, P 16 ACM SIGKDD INT
[6]   Discriminative Nonnegative Matrix Factorization for dimensionality reduction [J].
Babaee, Mohammadreza ;
Tsoukalas, Stefanos ;
Babaee, Maryam ;
Rigoll, Gerhard ;
Datcu, Mihai .
NEUROCOMPUTING, 2016, 173 :212-223
[7]   Inductive Robust Principal Component Analysis [J].
Bao, Bing-Kun ;
Liu, Guangcan ;
Xu, Changsheng ;
Yan, Shuicheng .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2012, 21 (08) :3794-3800
[8]   Principal component analysis [J].
Bro, Rasmus ;
Smilde, Age K. .
ANALYTICAL METHODS, 2014, 6 (09) :2812-2831
[9]   Graph Regularized Nonnegative Matrix Factorization for Data Representation [J].
Cai, Deng ;
He, Xiaofei ;
Han, Jiawei ;
Huang, Thomas S. .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2011, 33 (08) :1548-1560
[10]   Independent Component Analysis for Brain fMRI Does Indeed Select for Maximal Independence [J].
Calhoun, Vince D. ;
Potluru, Vamsi K. ;
Phlypo, Ronald ;
Silva, Rogers F. ;
Pearlmutter, Barak A. ;
Caprihan, Arvind ;
Plis, Sergey M. ;
Adali, Tuelay .
PLOS ONE, 2013, 8 (08)