Graph optimization for dimensionality reduction with sparsity constraints
From MaRDI portal
Recommendations
- Graph-optimized locality preserving projections
- Graph sparse nonnegative matrix factorization algorithm based on the inertial projection neural network
- Dual-sparsity preserving projection
- Linear regression based projections for dimensionality reduction
- A novel supervised dimensionality reduction algorithm: graph-based Fisher analysis
Cites work
- A generalized Foley–Sammon transform based on generalized fisher discriminant criterion and its application to face recognition
- Convergence of a block coordinate descent method for nondifferentiable minimization
- Graph-optimized locality preserving projections
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Least angle and \(\ell _{1}\) penalized regression: a review
- Semi-supervised orthogonal discriminant analysis via label propagation
- Sparsity preserving projections with applications to face recognition
Cited in
(16)- Low-rank and sparse embedding for dimensionality reduction
- Optimization Algorithms for Graph Laplacian Estimation via ADMM and MM
- Double linear regressions for single labeled image per person face recognition
- Large margin subspace learning for feature selection
- Constrained large margin local projection algorithms and extensions for multimodal dimensionality reduction
- Graph refinement via simultaneously low-rank and sparse approximation
- Adaptive graph construction using data self-representativeness for pattern classification
- Multi-priority graph sparsification
- Graph structured sparse subset selection
- On group-wise \(\ell_p\) regularization: theory and efficient algorithms
- Projected fuzzy C-means with probabilistic neighbors
- Sparse Recovery With Graph Constraints
- Graph-optimized locality preserving projections
- Linear regression based projections for dimensionality reduction
- Multi-instance dimensionality reduction via sparsity and orthogonality
- Enhanced graph-based dimensionality reduction with repulsion Laplaceans
This page was built for publication: Graph optimization for dimensionality reduction with sparsity constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q650966)
