scientific article; zbMATH DE number 6982906

zbMath1462.68172arXiv1511.06480MaRDI QIDQ4558470

Shih-Fu Chang, Yunchao Gong, Aditya Bhaskara, Felix X. Yu, Sanjiv Kumar

Publication date: 22 November 2018

Full work available at URL: https://arxiv.org/abs/1511.06480

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

FFTcirculant matrixdimensionality reductionstructured matrixbinary embedding

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computational aspects of data analysis and big data (68T09)

Related Items (4)

Binary vectors for fast distance and similarity estimation ⋮ Fast Metric Embedding into the Hamming Cube ⋮ Fast binary embeddings with Gaussian circulant matrices: improved bounds ⋮ Simple Classification using Binary Data

Uses Software

• ImageNet

Cites Work

• Unnamed Item
• Unnamed Item
• New bounds for circulant Johnson-Lindenstrauss embeddings
• A variant of the Johnson-Lindenstrauss lemma for circulant matrices
• Hanson-Wright inequality and sub-Gaussian concentration
• The Johnson-Lindenstrauss lemma and the sphericity of some graphs
• Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
• Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
• Johnson-Lindenstrauss lemma for circulant matrices**
• Extensions of Lipschitz mappings into a Hilbert space
• On variants of the Johnson–Lindenstrauss lemma
• Dense Fast Random Projections and Lean Walsh Transforms
• Similarity estimation techniques from rounding algorithms
• The Johnson-Lindenstrauss lemma is optimal for linear dimensionality reduction

This page was built for publication: