Pages that link to "Item:Q650966"
From MaRDI portal
The following pages link to Graph optimization for dimensionality reduction with sparsity constraints (Q650966):
Displaying 15 items.
- Constrained large margin local projection algorithms and extensions for multimodal dimensionality reduction (Q454445) (← links)
- Large margin subspace learning for feature selection (Q888576) (← links)
- Graph-optimized locality preserving projections (Q962793) (← links)
- On group-wise \(\ell_p\) regularization: theory and efficient algorithms (Q1669617) (← links)
- Adaptive graph construction using data self-representativeness for pattern classification (Q1750336) (← links)
- Low-rank and sparse embedding for dimensionality reduction (Q2182893) (← links)
- Linear regression based projections for dimensionality reduction (Q2200579) (← links)
- Enhanced graph-based dimensionality reduction with repulsion Laplaceans (Q2270698) (← links)
- Double linear regressions for single labeled image per person face recognition (Q2629788) (← links)
- Graph structured sparse subset selection (Q2662712) (← links)
- Sparse Recovery With Graph Constraints (Q2978787) (← links)
- Multi-Instance Dimensionality Reduction via Sparsity and Orthogonality (Q5157277) (← links)
- Optimization Algorithms for Graph Laplacian Estimation via ADMM and MM (Q5238972) (← links)
- Multi-priority graph sparsification (Q6182885) (← links)
- Projected fuzzy C-means with probabilistic neighbors (Q6195197) (← links)
