ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Journal of Computer and System Sciences
Volume 66, Issue 4, June 2003, Pages 671-687
Special Issue on PODS 2001
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (210 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/S0022-0000(03)00025-4    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2003 Elsevier Science (USA). All rights reserved.

Database-friendly random projections: Johnson-Lindenstrauss with binary coins

Dimitris AchlioptasE-mail The Corresponding Author

Microsoft Research, One Microsoft Way, Redmond, WA 98052, USA

Received 28 August 2001; 
revised 19 July 2002. 
Available online 11 June 2003.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

A classic result of Johnson and Lindenstrauss asserts that any set of n points in d-dimensional Euclidean space can be embedded into k-dimensional Euclidean space—where k is logarithmic in n and independent of d—so that all pairwise distances are maintained within an arbitrarily small factor. All known constructions of such embeddings involve projecting the n points onto a spherically random k-dimensional hyperplane through the origin. We give two constructions of such embeddings with the property that all elements of the projection matrix belong in {−1,0,+1}. Such constructions are particularly well suited for database environments, as the computation of the embedding reduces to evaluating a single aggregate over k random partitions of the attributes.

Article Outline

1. Introduction
1.1. Our contribution
1.1.1. Projecting onto random lines
1.1.2. Randomization
1.1.3. Derandomization
2. Previous work
3. Some intuition
4. Preliminaries and the spherically symmetric case
4.1. Preliminaries
4.2. The spherically symmetric case
5. Tail bounds
6. Moment bounds
7. Discussion
7.1. Database-friendliness
7.2. Further work
Acknowledgements
References

Journal of Computer and System Sciences
Volume 66, Issue 4, June 2003, Pages 671-687
Special Issue on PODS 2001
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.