Random Projection
Random Projection is a dimensionality reduction technique that maps high-dimensional data to a lower-dimensional space by projecting it onto a random matrix, preserving pairwise distances approximately according to the Johnson-Lindenstrauss lemma.
497
Publications
40.2K
Citations
1.2K
Authors
495
Institutions
Publications per year
2017–2026
140
Variants
Random Projections
Parents
497
Random projection in dimensionality reduction
Ella Bingham, Heikki Mannila · 2001 · 1.3K citations
Database-friendly random projections
Dimitris Achlioptas · 2001 · 712 citations
Improved Approximation Algorithms for Large Matrices via Random Projections
Tamás Sarlós · 2006 · 691 citations
1–5 of 497
1.2K
9
h-index
7
h-index
7
h-index
6
h-index
5
h-index
1–5 of 1.2K
495
Stanford University
Stanford, United States
13 h-index
23 publications
3.4K citations
Microsoft (United States)
Redmond, United States
13 h-index
16 publications
3.5K citations
University of California, Berkeley
Berkeley, United States
12 h-index
33 publications
4.8K citations

Centre National de la Recherche Scientifique
Paris, France
10 h-index
24 publications
1.4K citations
Massachusetts Institute of Technology
Cambridge, United States
9 h-index
22 publications
2.1K citations
National University of Singapore
Singapore, Singapore
9 h-index
14 publications
815 citations
Princeton University
Princeton, United States
9 h-index
16 publications
1.1K citations
Tsinghua University
Beijing, China
9 h-index
26 publications
1.3K citations
1–8 of 495
Repository · 37 publications · 1.4K citations
19
h-index
10 publications · 8K citations
10
h-index
8 publications · 650 citations
8
h-index
TKDE · 8 publications · 770 citations
7
h-index
Conference · 5 publications · 260 citations
5
h-index
1–5