Very Sparse Stable Random Projections, Estimators and Tail Bounds for Stable Random Projections
Ping Li · arXiv (Cornell University) · 2006
This paper will focus on three different aspects in improving the current practice of stable random projections. Firstly, we propose {\em very sparse stable random projections} to significantly reduce the processing and storage cost, by replacing the $α$-stable distribution with a mixture of a symmetric $α$-Pareto distribution (with probability $β$, $0