Random Projection Trees
Random Projection Trees is a hierarchical space-partitioning data structure that recursively splits high-dimensional data using random projections to enable efficient approximate nearest neighbor search.
17
Publications
1.6K
Citations
37
Authors
23
Institutions
Publications per year
2017–2026
3
Variants
Rp-trees
Parents
17
Fast approximate spectral clustering
Donghui Yan, Ling Huang, Michael I. Jordan · 2009 · 486 citations
Random projection trees and low dimensional manifolds
Sanjoy Dasgupta, Yoav Freund · 2008 · 383 citations
Learning the structure of manifolds using random projections
Yoav Freund, Sanjoy Dasgupta, Mayank Kabra et al. · 2007 · 112 citations
1–5 of 17
37
4
h-index
Institute of Forest Ecology, Environment and Protection, China
3 publications · 536 citations
3
h-index
3
h-index
2
h-index
2
h-index
1–5 of 37
23
Microsoft (United States)
Redmond, United States
3 h-index
3 publications
129 citations
University of California San Diego
San Diego, United States
3 h-index
8 publications
1.5K citations
University of Massachusetts Dartmouth
North Dartmouth, United States
2 h-index
8 publications
200 citations
University of Illinois Urbana-Champaign
Urbana, United States
2 h-index
2 publications
101 citations
Dali University
Dali, China
2 h-index
2 publications
50 citations
University of Nottingham Ningbo China
Ningbo, China
1 h-index
2 publications
184 citations
University of California, Merced
Merced, United States
1 h-index
1 publications
50 citations
Huaqiao University
Xiamen, China
1 h-index
1 publications
28 citations
1–8 of 23
Conference · 2 publications · 101 citations
2
h-index
TKDE · 1 publications · 23 citations
1
h-index
1 publications · 28 citations
1
h-index
Repository · 1 publications · 62 citations
1
h-index
1 publications · 36 citations
1
h-index
1–5