Binary random projections with controllable sparsity patterns
From MaRDI portal
Publication:2676161
DOI10.1007/S40305-021-00387-0OpenAlexW3037895282MaRDI QIDQ2676161FDOQ2676161
Authors: Wenye Li, Shuzhong Zhang 
Publication date: 27 September 2022
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.16180
Recommendations
Cites Work
- Testing Statistical Hypotheses
- Extensions of Lipschitz mappings into a Hilbert space
- Concentration inequalities. A nonasymptotic theory of independence
- Introduction to Information Retrieval
- Probability Inequalities for the Sum of Independent Random Variables
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- Vector data transformation using random binary matrices
- The fast Johnson-Lindenstrauss transform and approximate nearest neighbors
- A sparse Johnson-Lindenstrauss transform
- Sparser Johnson-Lindenstrauss transforms
- A neural algorithm for a fundamental computing problem
- Title not available (Why is that?)
Cited In (7)
- Title not available (Why is that?)
- Two-dimensional random projection
- Formation of similarity-reflecting binary vectors with random binary projections
- Correlations between random projections and the bivariate normal
- Randomized projective methods for the construction of binary sparse vector representations
- Vector data transformation using random binary matrices
- Bioinspired Random Projections for Robust, Sparse Classification
Uses Software
This page was built for publication: Binary random projections with controllable sparsity patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2676161)
