Graph optimization for dimensionality reduction with sparsity constraints
From MaRDI portal
Publication:650966
DOI10.1016/J.PATCOG.2011.08.015zbMATH Open1227.68097OpenAlexW2123961273MaRDI QIDQ650966FDOQ650966
Authors: Lishan Qiao, Li-mei Zhang, Songcan Chen 
Publication date: 7 December 2011
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2011.08.015
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
Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)
Cites Work
- Convergence of a block coordinate descent method for nondifferentiable minimization
- Least angle and \(\ell _{1}\) penalized regression: a review
- A generalized Foley–Sammon transform based on generalized fisher discriminant criterion and its application to face recognition
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Sparsity preserving projections with applications to face recognition
- Graph-optimized locality preserving projections
- Semi-supervised orthogonal discriminant analysis via label propagation
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
- Graph refinement via simultaneously low-rank and sparse approximation
- Large margin subspace learning for feature selection
- Constrained large margin local projection algorithms and extensions for multimodal dimensionality reduction
- Multi-priority graph sparsification
- Adaptive graph construction using data self-representativeness for pattern classification
- Graph structured sparse subset selection
- Projected fuzzy C-means with probabilistic neighbors
- On group-wise \(\ell_p\) regularization: theory and efficient algorithms
- Sparse Recovery With Graph Constraints
- Graph-optimized locality preserving projections
- Multi-instance dimensionality reduction via sparsity and orthogonality
- Linear regression based projections for dimensionality reduction
- Enhanced graph-based dimensionality reduction with repulsion Laplaceans
Uses Software
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)
