Journal Article10.1109/TNNLS.2018.2873655
Feature Extraction for Incomplete Data Via Low-Rank Tensor Decomposition With Feature Regularization
86
TL;DR: This paper incorporates low-rank tensor decomposition with feature variance maximization (TDVM) in a unified framework based on orthogonal Tucker and CP decompositions, and designs two TDVM methods to learn low-dimensional features viewing the core tensors of the Tucker model as features and viewing the weight vectors of the CP models as features.
read more
Abstract: Multidimensional data (i.e., tensors) with missing entries are common in practice. Extracting features from incomplete tensors is an important yet challenging problem in many fields such as machine learning, pattern recognition, and computer vision. Although the missing entries can be recovered by tensor completion techniques, these completion methods focus only on missing data estimation instead of effective feature extraction. To the best of our knowledge, the problem of feature extraction from incomplete tensors has yet to be well explored in the literature. In this paper, we therefore tackle this problem within the unsupervised learning environment. Specifically, we incorporate low-rank tensor decomposition with feature variance maximization (TDVM) in a unified framework. Based on orthogonal Tucker and CP decompositions, we design two TDVM methods, TDVM-Tucker and TDVM-CP, to learn low-dimensional features viewing the core tensors of the Tucker model as features and viewing the weight vectors of the CP model as features. TDVM explores the relationship among data samples via maximizing feature variance and simultaneously estimates the missing entries via low-rank Tucker/CP approximation, leading to informative features extracted directly from observed entries. Furthermore, we generalize the proposed methods by formulating a general model that incorporates feature regularization into low-rank tensor approximation. In addition, we develop a joint optimization scheme to solve the proposed methods by integrating the alternating direction method of multipliers with the block coordinate descent method. Finally, we evaluate our methods on six real-world image and video data sets under a newly designed multiblock missing setting. The extracted features are evaluated in face recognition, object/action classification, and face/gait clustering. Experimental results demonstrate the superior performance of the proposed methods compared with the state-of-the-art approaches.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Missing value imputation in multivariate time series with end-to-end generative adversarial networks
TL;DR: An end-to-end model to impute the missing values in a multivariate time series is proposed that outperforms state-of-the-art methods in imputation tasks and downstream applications, including classification and regression.
120
A Novel Approach to Large-Scale Dynamically Weighted Directed Network Representation
TL;DR: In this article , the Alternating direction method of multipliers (ADMM)-based Nonnegative Latent Factorization of Tensors (ANLT) model is proposed to extract the knowledge from an HDI DWDN, in spite of its incompleteness, contains rich knowledge regarding involved nodes various behavior patterns.
120
Neulft: A Novel Approach to Nonlinear Canonical Polyadic Decomposition on High-Dimensional Incomplete Tensors
TL;DR: In this paper , a neural latent factorization of tensors model for nonlinear Canonical Polyadic decomposition on a high-dimensional and incomplete (HDI) tensor is proposed.
102
NeuLFT: A Novel Approach to Nonlinear Canonical Polyadic Decomposition on High-Dimensional Incomplete Tensors
TL;DR: In this article , a neural latent factorization of tensors model for nonlinear Canonical Polyadic decomposition on a high-dimensional and incomplete (HDI) tensor is proposed.
79
Bayesian Low-Tubal-Rank Robust Tensor Factorization with Multi-Rank Determination
Yang Zhou,Yiu-ming Cheung +1 more
TL;DR: Experimental results demonstrate the effectiveness of the proposed fully Bayesian treatment of robust tensor factorization in multi-rank determination as well as its superiority in image denoising and background modeling over state-of-the-art approaches.
71
References
•Proceedings Article
Provable Tensor Factorization with Missing Data
Prateek Jain,Sewoong Oh +1 more
- 08 Dec 2014
TL;DR: A novel alternating minimization based method which iteratively refines estimates of the singular vectors which can recover a three-mode n × n → n dimensional rank-r tensor exactly from O(n3/2r5 log4 n) randomly sampled entries.
•Proceedings Article
Low-rank tensor learning with discriminant analysis for action classification and image recovery
Chengcheng Jia,Guoqiang Zhong,Yun Fu +2 more
- 27 Jul 2014
TL;DR: This paper proposes a low-rank tensor completion method for action classification, as well as image recovery, and adopts a discriminant analysis criterion to learn the projection matrices.
Semi-Orthogonal Multilinear PCA with Relaxed Start
Qiquan Shi,Haiping Lu +1 more
TL;DR: This paper proposes Semi-Orthogonal Multilinear PCA (SO-MPCA) with a relaxed start strategy, improving low-dimensional feature learning from tensors via tensor-to-vector projection with more captured variance and learned features than full orthogonality.
Automatic Subspace Learning via Principal Coefficients Embedding
TL;DR: These two challenging problems in unsupervised subspace learning can be simultaneously solved by proposing a new method called principal coefficients embedding (PCE), which can automatically determine the feature dimension of the learned subspace and is robust to the non-Gaussian noise.
Probabilistic Rank-One Discriminant Analysis via Collective and Individual Variation Modeling
Yang Zhou,Yiu-ming Cheung +1 more
TL;DR: A new generative model to incorporate structural information into the probabilistic framework, where each observed matrix is represented as a linear combination of collective and individual rank-one matrices, which provides the method with both the expressiveness of capturing discriminative features and nondiscriminative noise, and the capability of exploiting the 2-D tensor structures.