Binary random projections with controllable sparsity patterns
From MaRDI portal
Publication:2676161
Recommendations
Cites work
- scientific article; zbMATH DE number 1857652 (Why is no real title available?)
- A neural algorithm for a fundamental computing problem
- A sparse Johnson-Lindenstrauss transform
- Concentration inequalities. A nonasymptotic theory of independence
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- Extensions of Lipschitz mappings into a Hilbert space
- Introduction to Information Retrieval
- Probability Inequalities for the Sum of Independent Random Variables
- Sparser Johnson-Lindenstrauss transforms
- Testing Statistical Hypotheses
- The fast Johnson-Lindenstrauss transform and approximate nearest neighbors
- Vector data transformation using random binary matrices
Cited in
(7)- Two-dimensional random projection
- scientific article; zbMATH DE number 2109363 (Why is no real title available?)
- 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
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)