Binary random projections with controllable sparsity patterns

DOI10.1007/s40305-021-00387-0OpenAlexW3037895282MaRDI QIDQ2676161

Wenye Li, Shu-Zhong 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

zbMATH Keywords

dimensionalitysparsitybinary random projection

Mathematics Subject Classification ID

Boolean and Hadamard matrices (15B34) Computational aspects of data analysis and big data (68T09)

Uses Software

• RCV1
• GloVe

Cites Work

• Unnamed Item
• Unnamed Item
• Toward a unified theory of sparse dimensionality reduction in Euclidean space
• Vector data transformation using random binary matrices
• Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
• A sparse Johnson
• Sparser Johnson-Lindenstrauss Transforms
• Probability Inequalities for the Sum of Independent Random Variables
• Extensions of Lipschitz mappings into a Hilbert space
• Introduction to Information Retrieval
• A neural algorithm for a fundamental computing problem
• The Fast Johnson–Lindenstrauss Transform and Approximate Nearest Neighbors
• Testing Statistical Hypotheses

This page was built for publication: Binary random projections with controllable sparsity patterns