HTRPCA: Hypergraph Regularized Tensor Robust Principal Component Analysis for Sample Clustering in Tumor Omics Data

Zhao, Yuying; Jiao, Cui-Na; Wang, Maoli; Liu, Jin-Xing; Wang, Juan; Zheng, Chun-Hou

doi:10.1007/s12539-021-00441-8

Cited by 9 publications

(1 citation statement)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recent efforts have extended NTD to boost calculation efficiency and meet different demands in actual applications by incorporating suitable constrain conditions with NTD, including smoothness [16,17], graph Laplacian [18][19][20][21][22][23][24], sparsity [25], supervision [26][27][28], just to name a few. For examples, Liu et al stated a graph regularized L p smooth NTD method by adding the graph regularization and L p smooth constraint into NTD to retain smooth and more accurate solution of the objective function [17].…”

Section: Introductionmentioning

confidence: 99%

Approximately orthogonal non-negative Tucker decomposition with graph regularized for multiway dimensionality reduction

Gao,

Lu,

Liu

2024

Preprint

View full text Add to dashboard Cite

Non-negative Tucker decomposition (NTD) is one of the renowned technique in feature extraction and representation for non-negative high-dimensional tensor data. The main focus behind NTD is how to factorize the data to get hold of a high quality data representation from multidimensional directions. However, NTD does not conserve the geometrical structure of the data space and does not consider relationship and property among columns of the factor matrices. In this paper, by using approximately orthogonal constraint and graph regularized constraint , we manage to capture nonlinear local features of data space and further enhance expressiveness of the NTD clustering method. First, based on the uni-side and bi-side approximate orthogonality, we propose two novel approximately orthogonal non-negative Tucker decomposition with graph regularized models, which not only in part make factor matrix tend to be orthogonality, but also preserve the geometrical information from high-dimensional tensor data. Then we develop the iterative updating algorithm depended on multiplicative update rule to solve the proposed models, and provide its convergence and computational complexity. Finally, we use numerical experimental results to demonstrate the effectiveness, robustness and efficiency of the proposed new methods on the real-world image datasets.

show abstract