On using Toeplitz and circulant matrices for Johnson-Lindenstrauss transforms
type: Item
instance of: scholarly article
title: On using Toeplitz and circulant matrices for Johnson-Lindenstrauss transforms
zbMATH Open document ID: 1434.68603
author: Casper Benjamin Freksen
author: Kasper Green Larsen
published in: Algorithmica
publication date: 2020-04-09T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 15B05
Mathematics Subject Classification ID: 46B85
Mathematics Subject Classification ID: 60B20
Mathematics Subject Classification ID: 60E15
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R12
zbMATH DE Number: 7188814
zbMATH Keywords: dimensionality reduction
zbMATH Keywords: Johnson-Lindenstrauss transform
zbMATH Keywords: Toeplitz matrices
MaRDI profile type: Publication
full work available at URL: s00453-019-00644-y
OpenAlex ID: W2963884121
Wikidata QID: Q126842206
cites work: Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
cites work: The Fast Johnson–Lindenstrauss Transform and Approximate Nearest Neighbors
cites work: Fast dimension reduction using Rademacher series on dual BCH codes
cites work: An Almost Optimal Unrestricted Fast Johnson-Lindenstrauss Transform
cites work: Randomized Dimensionality Reduction for $k$ -Means Clustering
cites work: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
cites work: Dimensionality Reduction for k-Means Clustering and Low Rank Approximation
cites work: A sparse Johnson-Lindenstrauss transform
cites work: An elementary proof of a theorem of Johnson and Lindenstrauss
cites work: Compressed sensing
cites work: Approximate nearest neighbor: towards removing the curse of dimensionality
cites work: Johnson-Lindenstrauss lemma for circulant matrices**
cites work: Extensions of Lipschitz mappings into a Hilbert space
cites work: Sparser Johnson-Lindenstrauss Transforms
cites work: New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property
cites work: Q3425115
cites work: Graph Sparsification by Effective Resistances
cites work: Q4821981
cites work: A variant of the Johnson-Lindenstrauss lemma for circulant matrices
cites work: Computational Advertising: Techniques for Targeting Relevant Ads
DOI: 10.1007/S00453-019-00644-Y
Recommended article: On Using Toeplitz and Circulant Matrices for Johnson-Lindenstrauss Transforms
Recommended article: Approximating inverses of Toeplitz matrices by circulant matrices
Recommended article: Johnson-Lindenstrauss lemma for circulant matrices**
Recommended article: The Johnson-Lindenstrauss Transform: An Empirical Study
Recommended article: A variant of the Johnson-Lindenstrauss lemma for circulant matrices
Recommended article: Gaussian Multiple Access via Compute-and-Forward
Recommended article: Fast transforms of Toeplitz matrices
Recommended article: Circulant and Skewcirculant Matrices for Solving Toeplitz Matrix Problems
Recommended article: Circulant approximations of the inverses of Toeplitz matrices and related quantities with applications to stationary random processes
Recommended article: Q3425498
description: scientific article; zbMATH DE number 7188814