Two-dimensional semi-nonnegative matrix factorization for clustering
From MaRDI portal
Publication:6199487
Abstract: In this paper, we propose a new Semi-Nonnegative Matrix Factorization method for 2-dimensional (2D) data, named TS-NMF. It overcomes the drawback of existing methods that seriously damage the spatial information of the data by converting 2D data to vectors in a preprocessing step. In particular, projection matrices are sought under the guidance of building new data representations, such that the spatial information is retained and projections are enhanced by the goal of clustering, which helps construct optimal projection directions. Moreover, to exploit nonlinear structures of the data, manifold is constructed in the projected subspace, which is adaptively updated according to the projections and less afflicted with noise and outliers of the data and thus more representative in the projected space. Hence, seeking projections, building new data representations, and learning manifold are seamlessly integrated in a single model, which mutually enhance other and lead to a powerful data representation. Comprehensive experimental results verify the effectiveness of TS-NMF in comparison with several state-of-the-art algorithms, which suggests high potential of the proposed method for real world applications.
Recommendations
- Dual semi-supervised convex nonnegative matrix factorization for data representation
- scientific article; zbMATH DE number 6795656
- Nonnegative matrix factorization with local similarity learning
- Nonnegative matrix factorization with rank regularization and hard constraint
- Hyperplane-based nonnegative matrix factorization with label information
Cites work
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- 10.1162/jmlr.2003.3.4-5.993
- Feature selection and multi-kernel learning for sparse representation on a manifold
- Learning the parts of objects by non-negative matrix factorization
- Principal component analysis.
- Robust principal component analysis: a factorization-based approach with linear complexity
- Robust principal component analysis?
- Tensor Decompositions and Applications
This page was built for publication: Two-dimensional semi-nonnegative matrix factorization for clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6199487)