Constructing L₁-graphs for subspace learning via recurrent neural networks
From MaRDI portal
Publication:2337448
Recommendations
- Sparse signal reconstruction via recurrent neural networks with hyperbolic tangent function
- L1-norm based subspace techniques for robust modelling: a brief review
- A Cooperative Recurrent Neural Network for Solving L1 Estimation Problems with General Linear Constraints
- scientific article; zbMATH DE number 7108981
- Graph sparse nonnegative matrix factorization algorithm based on the inertial projection neural network
Cites work
- 10.1162/153244304322972667
- A Simple Neural Network Exhibiting Selective Activation of Neuronal Ensembles: From Winner-Take-All to Winners-Share-All
- Hessian eigenmaps: Locally linear embedding techniques for high-dimensional data
- Learning Theory
- Learning with $\ell ^{1}$-graph for image analysis
- Manifold regularization: a geometric framework for learning from labeled and unlabeled examples
- Manifold Regularized Discriminative Nonnegative Matrix Factorization With Fast Gradient Descent
- NeNMF: An Optimal Gradient Method for Nonnegative Matrix Factorization
- Probing the Pareto frontier for basis pursuit solutions
- Weighted locally linear embedding for dimension reduction
This page was built for publication: Constructing \(L_1\)-graphs for subspace learning via recurrent neural networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2337448)