sparse random projections

STOC
2006
ACM

244views Algorithms» more STOC 2006»

Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform

14 years 4 months ago

We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...

Nir Ailon, Bernard Chazelle

claim paper

Read More »

click to vote

KDD
2006
ACM

136views Data Mining» more KDD 2006»

Very sparse random projections

14 years 4 months ago

Download www-stat.stanford.edu

There has been considerable interest in random projections, an approximate algorithm for estimating distances between pairs of points in a high-dimensional vector space. Let A Rn...

Ping Li, Trevor Hastie, Kenneth Ward Church

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers