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

Authors

1.2K

  1. MW
    Michael W. Mahoney

    University of California, Berkeley, United States

    9 publications · 377 citations

    9

    h-index

  2. AK
    Ata Kabán

    University of Birmingham, United Kingdom

    7 publications · 241 citations

    7

    h-index

  3. SD
    Sanjoy Dasgupta

    University of California San Diego, United States

    7 publications · 1.1K citations

    7

    h-index

  4. RG
    Richard G. Baraniuk

    Rice University, United States

    6 publications · 600 citations

    6

    h-index

  5. MB
    Michael B. Wakin

    Colorado School of Mines, United States

    5 publications · 595 citations

    5

    h-index

1–5 of 1.2K

Venues

  1. arXiv (Cornell University)

    Repository · 37 publications · 1.4K citations

    19

    h-index

  2. IEEE Transactions on Information Theory

    10 publications · 8K citations

    10

    h-index

  3. 8

    h-index

  4. IEEE Transactions on Knowledge and Data Engineering

    TKDE · 8 publications · 770 citations

    7

    h-index

  5. Proceedings of the AAAI Conference on Artificial Intelligence

    Conference · 5 publications · 260 citations

    5

    h-index

1–5