Robust structure preserving nonnegative matrix factorization for dimensionality reduction
Summary: As a linear dimensionality reduction method, nonnegative matrix factorization (NMF) has been widely used in many fields, such as machine learning and data mining. However, there are still two major drawbacks for NMF: (a) NMF can only perform semantic factorization in Euclidean space, and it fails to discover the intrinsic geometrical structure of high-dimensional data distribution. (b) NMF suffers from noisy data, which are commonly encountered in real-world applications. To address these issues, in this paper, we present a new robust structure preserving nonnegative matrix factorization (RSPNMF) framework. In RSPNMF, a local affinity graph and a distant repulsion graph are constructed to encode the geometrical information, and noisy data influence is alleviated by characterizing the data reconstruction term of NMF with \(\ell_{2,1}\)-norm instead of \(\ell_2\)-norm. With incorporation of the local and distant structure preservation regularization term into the robust NMF framework, our algorithm can discover a low-dimensional embedding subspace with the nature of structure preservation. RSPNMF is formulated as an optimization problem and solved by an effective iterative multiplicative update algorithm. Experimental results on some facial image datasets clustering show significant performance improvement of RSPNMF in comparison with the state-of-the-art algorithms.
- Robust distribution-based nonnegative matrix factorizations for dimensionality reduction
- Projective robust nonnegative factorization
- Robust graph regularized nonnegative matrix factorization for clustering
- Nonnegative matrix factorization with rank regularization and hard constraint
- Locality preserving nonnegative matrix factorization with application to face recognition
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Learning the parts of objects by non-negative matrix factorization
- Manifold Regularized Discriminative Nonnegative Matrix Factorization With Fast Gradient Descent
- Multiple graph regularized nonnegative matrix factorization
- Non-negative matrix factorization with sparseness constraints
- Principal Manifolds and Nonlinear Dimensionality Reduction via Tangent Space Alignment
- Robust (Semi) Nonnegative Graph Embedding
- Supervised optimal locality preserving projection
- Robust semisupervised nonnegative local coordinate factorization for data representation
- Robust graph regularized nonnegative matrix factorization for clustering
- Robust distribution-based nonnegative matrix factorizations for dimensionality reduction
- Projective robust nonnegative factorization
- Neighborhood structure assisted non-negative matrix factorization and its application in unsupervised point-wise anomaly detection
- Robust latent nonnegative matrix factorization with automatic sparse reconstruction for unsupervised feature extraction
- Robust local-coordinate non-negative matrix factorization with adaptive graph for robust clustering
This page was built for publication: Robust structure preserving nonnegative matrix factorization for dimensionality reduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1793532)
