Learning with \ell ^{1}-graph for image analysis
From MaRDI portal
Publication:5366297
Cited in
(36)- Beyond linear subspace clustering: a comparative study of nonlinear manifold clustering algorithms
- Similarity preserving low-rank representation for enhanced data representation and effective subspace learning
- Linear regression based projections for dimensionality reduction
- Learning a discriminant graph-based embedding with feature selection for image categorization
- Semi-supervised double sparse graphs based discriminant analysis for dimensionality reduction
- Manifold adaptive kernelized low-rank representation for semisupervised image classification
- An overview of computational sparse models and their applications in artificial intelligence
- Kernel truncated regression representation for robust subspace clustering
- Robust classifier using distance-based representation with square weights
- Convolutional Networks Can Learn to Generate Affinity Graphs for Image Segmentation
- Embedding tangent space extreme learning machine for EEG decoding in brain computer interface systems
- Enhanced low-rank representation via sparse manifold adaption for semi-supervised learning
- Lagrangian relaxation graph matching
- Subspace clustering using a low-rank constrained autoencoder
- Graph-based semi-supervised learning via improving the quality of the graph dynamically
- Subspace learning by \(\ell^0\)-induced sparsity
- Robust subspace segmentation via nonconvex low rank representation
- Discriminant sparse neighborhood preserving embedding for face recognition
- Multi-source adaptation joint kernel sparse representation for visual classification
- Adaptive graph construction using data self-representativeness for pattern classification
- A classification-oriented dictionary learning model: explicitly learning the particularity and commonality across categories
- Fast and robust face recognition via coding residual map learning based adaptive masking
- Adaptive multiple graph regularized semi-supervised extreme learning machine
- Robust subspace clustering based on automatic weighted multiple kernel learning
- Noise-robust semi-supervised learning via fast sparse coding
- Constructing \(L_1\)-graphs for subspace learning via recurrent neural networks
- Supervised neighborhood graph construction for semi-supervised classification
- Variants of k-regular nearest neighbor graph and their construction
- Regularized coplanar discriminant analysis for dimensionality reduction
- Efficient dynamic graph construction for inductive semi-supervised learning
- Semi-supervised classification based on low rank representation
- An image segmentation method based on network clustering model
- Incomplete variables truncated conjugate gradient method for signal reconstruction in compressed sensing
- Multiview sample classification algorithm based on L1-graph domain adaptation learning
- Face recognition using double sparse local Fisher discriminant analysis
- Low-rank affinity based local-driven multilabel propagation
This page was built for publication: Learning with $\ell ^{1}$-graph for image analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5366297)
