Live briefing
Everything about Random projection
Technique to reduce dimensionality of points in Euclidean space
In mathematics and statistics, random projection is a technique used to reduce the dimensionality of a set of points which lie in Euclidean space. According to theoretical results, random projection preserves distances well, but empirical results are sparse. They have been applied to many natural language tasks under the name random indexing. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Random projectionA 5-minute orientation
- Skim a recent paper: Sparse random projection isolation forest for outlier detectionInfluential work since 2022
- Pick up a classic book: A Random Walk Down Wall StreetThe most-reprinted book on the subject
- Read the landmark paper: Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?Cited 5,305 times
- Go sideways: Johnson–Lindenstrauss lemmaA closely related topic
- Go sideways: Ensemble Kalman filterA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
Distributed Random Projection Algorithm for Convex Optimization
Random-projection Ensemble Classification
Projection correlation between two random vectors
Ensemble of optimal trees, random forest and random projection ensemble classification
Hierarchical Feature Selection for Random Projection
Random Projection Trees for Vector Quantization
Asynchronous Gossip-Based Random Projection Algorithms Over Networks
🆕 Influential since 2022
Sparse random projection isolation forest for outlier detection
Efficient Heterogeneous Graph Learning via Random Projection
Detection of Small Aerial Object Using Random Projection Feature With Region Clustering
Projection Pursuit Random Forest for Mineral Prospectivity Mapping
Random subspace and random projection nearest neighbor ensembles for high dimensional data
📚 Books worth reading
A Random Walk Down Wall StreetBurton Gordon Malkiel · 1973
The Random Projection Method (Dimacs Series in Discrete Mathematics and Theoretical Computer Science)Santosh S. Vempala · 2004- 📕Contributions of Mexican Mathematicians Abroad in Pure and Applied MathematicsFernando Galaz-Garcia, Juan Carlos Pardo · 2018
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Johnson–Lindenstrauss lemma In mathematics, the Johnson–Lindenstrauss lemma is a result named after William B. Johnson and Joram Lindenstrauss concerning low-distortion embeddings…
- Ensemble Kalman filter The ensemble Kalman filter (EnKF) is a recursive filter suitable for problems with a large number of variables, such as discretizations of partial differential…
- Polynomial chaos Polynomial chaos (PC), also called polynomial chaos expansion (PCE) and Wiener chaos expansion, is a method for representing a random variable in terms…
- Logit-normal distribution In probability theory, a logit-normal distribution is a probability distribution of a random variable whose logit has a normal distribution. If Y is a…
- Nonlinear dimensionality reduction Nonlinear dimensionality reduction (NLDR), also known as manifold learning, is any of various related techniques that aim to project high-dimensional data…
- Rademacher distribution In probability theory and statistics, the Rademacher distribution (which is named after Hans Rademacher) is a discrete probability distribution where a…
- Degrees of freedom (statistics) In statistics, the number of degrees of freedom is the number of values in the final calculation of a statistic that are free to vary. Estimates of statistical…
- Matrix completion Matrix completion is the task of filling in the missing entries of a partially observed matrix, which is equivalent to performing data imputation in statistics…