Compressive classification: where wireless communications meets machine learning
From MaRDI portal
Recommendations
- Compressed classification learning with Markov chain samples
- Dimension-adaptive bounds on compressive FLD classification
- Classification via Minimum Incremental Coding Length
- On classification with empirically observed statistics and universal data compression
- Combined compression and classification with learning vector quantization
Cites work
- A geometric analysis of subspace clustering with outliers
- A group-theoretic framework for the construction of packings in Grassmannian spaces
- Approximate Sparsity Pattern Recovery: Information-Theoretic Lower Bounds
- Bounds on the Number of Measurements for Reliable Compressive Classification
- Capacity of a mobile multiple-antenna communication link in Rayleigh flat fading
- Communications-inspired projection design with application to compressive sensing
- Compressed sensing
- Discrimination on the Grassmann Manifold: Fundamental Limits of Subspace Classifiers
- Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels
- Grassmannian Packings From Operator Reed–Muller Codes
- scientific article; zbMATH DE number 3858094 (Why is no real title available?)
- scientific article; zbMATH DE number 3266514 (Why is no real title available?)
- Information-Theoretic Limits on Sparse Signal Recovery: Dense versus Sparse Measurement Matrices
- Information-Theoretic Limits on Sparsity Recovery in the High-Dimensional and Noisy Setting
- Learning transformations for clustering and classification
- Metrics and models for handwritten character recognition
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Pattern classification.
- Quantum computation in quantum-Hall systems.
- Reconstruction of Signals Drawn From a Gaussian Mixture Via Noisy Compressive Measurements
- Robust subspace clustering
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)
- Some Techniques for Assessing Multivarate Normality Based on the Shapiro- Wilk W
- Stable signal recovery from incomplete and inaccurate measurements
- Systematic design of unitary space-time constellations
- The Sampling Rate-Distortion Tradeoff for Sparsity Pattern Recovery in Compressed Sensing
- Unitary space-time modulation for multiple-antenna communications in Rayleigh flat fading
This page was built for publication: Compressive classification: where wireless communications meets machine learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3460843)
