Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
type: Item
instance of: scholarly article
title: Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
zbMATH Open document ID: 1054.68040
DOI: 10.1016/S0022-0000(03)00025-4
published in: Journal of Computer and System Sciences
publication date: 2003-08-19T00:00:00Z
Mathematics Subject Classification ID: 68P15
zbMATH DE Number: 1967150
zbMATH Keywords: embeddings
zbMATH Keywords: random partitions of attributes
author: D. Achlioptas
MaRDI profile type: Publication
Wikidata QID: Q57254827
cites work: Learning mixtures of arbitrary gaussians
cites work: The Johnson-Lindenstrauss lemma and the sphericity of some graphs
cites work: Q4542583
cites work: Extensions of Lipschitz mappings into a Hilbert space
cites work: Q4527027
cites work: Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
cites work: The geometry of graphs and some of its algorithmic applications
cites work: Latent semantic indexing: A probabilistic analysis
cites work: Clustering for edge-cost minimization (extended abstract)
cites work: Algorithmic derandomization via complexity theory
DBLP publication ID: journals/jcss/Achlioptas03
description: scientific article; zbMATH DE number 1967150