A sparsity driven kernel machine based on minimizing a generalization error bound

DOI10.1016/j.patcog.2009.03.006zbMath1175.68385OpenAlexW2013576352MaRDI QIDQ2270729

Dori Peleg, Ron Meir

Publication date: 29 July 2009

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

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

zbMATH Keywords

classificationstatistical learning theorysparsitygeneralization error bounds

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Related Items

The weighted majority algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Handbook of global optimization
• Selection methods for extended least squares support vector machines
• 10.1162/15324430152748236
• 10.1162/jmlr.2003.3.4-5.781
• 10.1162/1532443041827925
• 10.1162/153244303322753751
• 10.1162/153244303765208403
• A learning generalization bound with an application to sparse-representation classifiers
• Complementarity: applications, algorithms and extensions. Papers from the international conference on complementarity (ICCP 99), Madison, WI, USA, June 9--12, 1999
• A new method for sparsity control in support vector classification and regression