Classification scheme for binary data with extensions
From MaRDI portal
Recommendations
Cites work
- A Review of Hierarchical Classification
- A survey of hierarchical classification across different application domains
- An elementary proof of a theorem of Johnson and Lindenstrauss
- Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
- Compressed sensing
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- Dimension reduction by random hyperplane tessellations
- Extensions of Lipschitz mappings into a Hilbert space
- Fast binary embeddings with Gaussian circulant matrices: improved bounds
- New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property
- On sparse reconstruction from Fourier and Gaussian measurements
- One-bit compressed sensing by linear programming
- One-Bit Compressive Sensing With Norm Estimation
- Robust 1-bit Compressed Sensing and Sparse Logistic Regression: A Convex Programming Approach
- Robust 1-bit Compressive Sensing Using Adaptive Outlier Pursuit
- Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Simple classification using binary data
- Stable signal recovery from incomplete and inaccurate measurements
- Support Vector Machines
- Trust, But Verify: Fast and Accurate Signal Recovery From 1-Bit Compressive Measurements
Cited in
(2)
This page was built for publication: Classification scheme for binary data with extensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3296178)