Sparse regularization for semi-supervised classification

DOI10.1016/j.patcog.2011.02.013zbMath1218.68120MaRDI QIDQ2275970

Bo Zhang, Hong Qiao, Mingyu Fan, Nannan Gu

Publication date: 10 August 2011

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2011.02.013

zbMATH Keywords

dimensionality reduction; semi-supervised learning; regularization theory; regularized least square classification

Mathematics Subject Classification ID

68T05: Learning and adaptive systems in artificial intelligence

68T10: Pattern recognition, speech recognition

Related Items

Convergence rate of the semi-supervised greedy algorithm, A multikernel-like learning algorithm based on data probability distribution

Uses Software

• L1-MAGIC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Semi-supervised learning on Riemannian manifolds
• Discriminatively regularized least-squares classification
• On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• The minimum description length principle in coding and modeling
• On Different Facets of Regularization Theory
• For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution
• Stable signal recovery from incomplete and inaccurate measurements