Classification scheme for binary data with extensions

DOI10.1007/978-3-319-73074-5_4zbMATH Open1443.62186OpenAlexW2968236041MaRDI QIDQ3296178FDOQ3296178

D. Needell, Palina Salanevich, Aaron A. Nelson, Rayan Saab, Denali Molitor

Publication date: 7 July 2020

Published in: Applied and Numerical Harmonic Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-73074-5_4

Recommendations

• Simple classification using binary data
• Classification of run-length encoded binary data
• A method for the design of binary tree classifiers
• Some Classification Procedures for Multivariate Binary Data Using Orthogonal Functions
• Bayesian classification based on multivariate binary data

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Statistical aspects of big data and data science (62R07)

Cites Work

• Extensions of Lipschitz mappings into a Hilbert space
• Support Vector Machines
• An elementary proof of a theorem of Johnson and Lindenstrauss
• Trust, But Verify: Fast and Accurate Signal Recovery From 1-Bit Compressive Measurements
• Stable signal recovery from incomplete and inaccurate measurements
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Compressed sensing
• A Review of Hierarchical Classification
• On sparse reconstruction from Fourier and Gaussian measurements
• One-bit compressed sensing by linear programming
• Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors
• Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
• New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property
• A survey of hierarchical classification across different application domains
• Robust 1-bit Compressive Sensing Using Adaptive Outlier Pursuit
• Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
• Dimension reduction by random hyperplane tessellations
• Robust 1-bit Compressed Sensing and Sparse Logistic Regression: A Convex Programming Approach
• One-Bit Compressive Sensing With Norm Estimation
• Fast binary embeddings with Gaussian circulant matrices: improved bounds
• Simple Classification using Binary Data

Cited In (1)

• An iterative method for classification of binary data

Uses Software

• MNIST
• ImageNet
• AlexNet

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)