Noise-robust semi-supervised learning via fast sparse coding
From MaRDI portal
Publication:1677083
DOI10.1016/j.patcog.2014.08.019zbMath1373.68325OpenAlexW2017735937MaRDI QIDQ1677083
Publication date: 10 November 2017
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2014.08.019
sparse codingnoise reductiongraph-based semi-supervised learningLaplacian regularizationnoise-robust image classification
Learning and adaptive systems in artificial intelligence (68T05) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Exhaustive and efficient constraint propagation: a graph-based learning approach and its applications
- A second order cone programming approach for semi-supervised learning
- Feature selection guided by structural information
- Image annotation via graph learning
- Restoration of images corrupted by mixed Gaussian-impulse noise via \(l_{1}-l_{0}\) minimization
- An algorithm for semi-supervised learning in image retrieval
- Kernel-based transition probability toward similarity measure for semi-supervised learning
- A new approach to variable selection in least squares problems
- Semi-Supervised Bilinear Subspace Learning
- Learning with $\ell ^{1}$-graph for image analysis
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
This page was built for publication: Noise-robust semi-supervised learning via fast sparse coding