Compressed classification learning with Markov chain samples

DOI10.1016/J.NEUNET.2013.11.008MaRDI QIDQ470183zbMATH OpenOpenAlexWikidataFDO

Authors Feilong Cao, Tenghui Dai, Yongquan Zhang, Yuanpeng Tan

Publication date 12 November 2014

Published in Neural Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.neunet.2013.11.008

zbMATH Keywords

generalization errorSVMcompressed classificationMarkov chain samples

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Generalization bounds of compressed regression learning algorithm
• Compressed learning with regular concept
• A compression approach to support vector model selection
• scientific article; zbMATH DE number 1700013
• PAC-Bayesian compression bounds on the prediction error of learning algorithms for classification

Cites work

• 10.1162/153244302760200713
• A simple proof of the restricted isometry property for random matrices
• Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property
• Best choices for regularization parameters in learning theory: on the bias-variance problem.
• Compressed and Privacy-Sensitive Sparse Regression
• Compressed sensing
• Compressive sampling
• Extensions of compressed sensing
• Learning from dependent observations
• ONLINE LEARNING WITH MARKOV SAMPLING
• On the mathematical foundations of learning
• Stable signal recovery from incomplete and inaccurate measurements
• Support vector machine soft margin classifiers: error analysis
• The learning performance of support vector machine classification based on Markov sampling

Cited in

(7)

• Learning in compressed space
• Compressed learning with regular concept
• Generalization bounds of compressed regression learning algorithm
• scientific article; zbMATH DE number 1700013 (Why is no real title available?)
• Compressive classification: where wireless communications meets machine learning
• A quasi-Monte Carlo data compression algorithm for machine learning
• 2D compressed learning: support matrix machine with bilinear random projections

This page was built for publication: Compressed classification learning with Markov chain samples

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q470183)