Compressed classification learning with Markov chain samples
From MaRDI portal
Publication:470183
DOI10.1016/j.neunet.2013.11.008zbMath1298.68215OpenAlexW2072031809WikidataQ50703943 ScholiaQ50703943MaRDI QIDQ470183
Feilong Cao, Yuanpeng Tan, Yongquan Zhang, Tenghui Dai
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
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)
Cites Work
- Unnamed Item
- Unnamed Item
- Learning from dependent observations
- Extensions of compressed sensing
- A simple proof of the restricted isometry property for random matrices
- Best choices for regularization parameters in learning theory: on the bias-variance problem.
- On the mathematical foundations of learning
- ONLINE LEARNING WITH MARKOV SAMPLING
- 10.1162/153244302760200713
- Compressed and Privacy-Sensitive Sparse Regression
- The learning performance of support vector machine classification based on Markov sampling
- Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property
- Stable signal recovery from incomplete and inaccurate measurements
- Compressed sensing
