Low-Rank Regularized Heterogeneous Tensor Decomposition for Subspace Clustering.

IEEE Signal Processing Letters(2018)

引用 39|浏览37
暂无评分
摘要
This letter proposes a low-rank regularized heterogeneous tensor decomposition (LRRHTD) algorithm for subspace clustering, in which various constrains in different modes are incorporated to enhance the robustness of the proposed model. Specifically, due to the presence of noise and redundancy in the original tensor, LRRHTD seeks a set of orthogonal factor matrices for all but the last mode to map ...
更多
查看译文
关键词
Tensile stress,Signal processing algorithms,Matrix decomposition,Clustering algorithms,Robustness,Sparse matrices,Algorithm design and analysis
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要