Open AccessRobust Semi‐nonnegative Matrix Factorization with Adaptive Graph Regularization for Gene Representation
Author(s) -
Jiang Wei,
Ma Tingting,
Feng Xiaoting,
Zhai Yun,
Tang Kewei,
Zhang Jie
Publication year - 2020
Publication title -
chinese journal of electronics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.267
H-Index - 25
eISSN - 2075-5597
pISSN - 1022-4653
DOI - 10.1049/cje.2019.11.001
Subject(s) - non negative matrix factorization , matrix decomposition , regularization (linguistics) , representation (politics) , mathematics , graph , factorization , computer science , artificial intelligence , algorithm , combinatorics , physics , eigenvalues and eigenvectors , quantum mechanics , politics , political science , law
Various data representation algorithms have been proposed for gene expression. There are some shortcomings in traditional gene expression methods, such as learning the ideal affinity matrix to effectively capture the geometric structure of genetic data space, and reducing noises and outliers influences of data input. We propose a novel matrix factorization algorithm called Robust semi‐nonnegative matrix factorization (RSNMF) with adaptive graph regularization, which simultaneously performs matrix robust factorization with learning affinity matrix in a unified optimization framework. RSNMF also uses a loss function based on l2;1‐norm to improve the robustness of the model against noises and outliers. A novel Augmented Lagrange multiplier (ALM) is designed to obtain the optimal solution of RSNMF. The results of extensive experiments that were performed on gene expression datasets demonstrate that RSNMF outperforms the other algorithms, which validates the effectiveness and robustness of RSNMF.