Non-negative Tucker decomposition with double constraints for multiway dimensionality reduction

Abstract

<p>Nonnegative Tucker decomposition (NTD) is one of the renowned techniques in feature extraction and representation for nonnegative high-dimensional tensor data. The main focus behind the NTD-like model was how to factorize the data to get ahold of a high quality data representation from multidimensional directions. However, existing NTD-like models do not consider relationship and properties between the factor matrix of columns while preserving the geometric structure of the data space. In this paper, we managed to capture nonlinear local features of data space and further enhance expressiveness of the NTD clustering method by syncretizing organically approximately orthogonal constraint and graph regularized constraint. First, based on the uni-side and bi-side approximate orthogonality, we flexibly proposed two novel approximately orthogonal NTD with graph regularized models, which not only in part make the factor matrix tend to be orthogonality, but also preserve the geometrical information from high-dimensional tensor data. Second, we developed the iterative updating algorithm dependent on the multiplicative update rule to solve the proposed models, and provided its convergence and computational complexity. Finally, we used numerical experimental results to demonstrate the effectiveness, robustness, and efficiency of the proposed new methods on the real-world image datasets.</p>