HyperNTF: A Hypergraph Regularized Nonnegative Tensor Factorization for Dimensionality Reduction
Wanguang Yin, Youzhi Qu, Zhengming Ma, Quanying Liu

TL;DR
HyperNTF introduces a hypergraph-regularized tensor factorization method that captures complex sample relationships, improving dimensionality reduction and clustering performance on high-dimensional data like images and EEG signals.
Contribution
The paper proposes HyperNTF, a novel hypergraph regularized nonnegative tensor factorization technique that models complex sample relationships beyond pairwise similarities.
Findings
HyperNTF outperforms existing methods in dimensionality reduction.
HyperNTF achieves superior clustering accuracy.
HyperNTF effectively handles high-dimensional multi-view data.
Abstract
Tensor decomposition is an effective tool for learning multi-way structures and heterogeneous features from high-dimensional data, such as the multi-view images and multichannel electroencephalography (EEG) signals, are often represented by tensors. However, most of tensor decomposition methods are the linear feature extraction techniques, which are unable to reveal the nonlinear structure within high-dimensional data. To address such problem, a lot of algorithms have been proposed for simultaneously performs linear and non-linear feature extraction. A representative algorithm is the Graph Regularized Non-negative Matrix Factorization (GNMF) for image clustering. However, the normal 2-order graph can only models the pairwise similarity of objects, which cannot sufficiently exploit the complex structures of samples. Thus, we propose a novel method, named Hypergraph Regularized…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTensor decomposition and applications
