title: Heterogeneous Tensor Decomposition for Clustering via Manifold Optimization.
abstract: Tensor clustering is an important tool that exploits intrinsically rich structures in real-world multiarray or Tensor datasets. Often in dealing with those datasets, standard practice is to use subspace clustering that is based on vectorizing multiarray data. However, vectorization of tensorial data does not exploit complete structure information. In this paper, we propose a subspace clustering algorithm without adopting any vectorization process. Our approach is based on a novel heterogeneous Tucker decomposition model taking into account cluster membership information. We propose a new clustering algorithm that alternates between different modes of the proposed heterogeneous tensor model. All but the last mode have closed-form updates. Updating the last mode reduces to optimizing over the multinomial manifold for which we investigate second order Riemannian geometry and propose a trust-region algorithm. Numerical experiments show that our proposed algorithm compete effectively with state-of-the-art clustering algorithms that are based on tensor factorization.
authors.forename: Yanfeng
authors.initials: Y
authors.lastname: Sun
authors.forename: Junbin
authors.initials: J
authors.lastname: Gao
authors.forename: Xia
authors.initials: X
authors.lastname: Hong
authors.forename: Bamdev
authors.initials: B
authors.lastname: Mishra
authors.forename: Baocai
authors.initials: B
authors.lastname: Yin