Database-friendly random projections

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2001, Pages 274-281

  Achlioptas, D ^a  

^a MICROSOFT   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EMBEDDED SYSTEMS; MATRIX ALGEBRA; METHOD OF MOMENTS; PROBABILITY; PROBLEM SOLVING; RANDOM PROCESSES; SET THEORY; THEOREM PROVING; VECTORS;

RANDOM PROJECTIONS;

DATABASE SYSTEMS;

EID: 0034819702     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/375551.375608     Document Type: Conference Paper

References (13)

1. Learning mixtures of Gaussians
2. The Johnson-Lindenstrauss lemma and the sphericity of some graphs
3. Stable distributions, pseudorandom generators, embeddings and data stream computation
4. Approximate nearest neighbors: Towards removing the curse of dimensionality
5. Extensions of lipschitz mappings into a hilbert space
6. Two algorithms for nearest-neighbor search in high dimensions
7. The geometry of graphs and some of its algorithmic applications
8. Latent semantic indexing: A probabilistic analysis
9. Clustering for edge-cost minimization
10. A random sampling based algorithm for learning the intersection of half-spaces
11. An algorithmic theory of learning: Robust concepts and random projection