Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
From MaRDI portal
Publication:1401965
Recommendations
Cites work
- scientific article; zbMATH DE number 1559575 (Why is no real title available?)
- scientific article; zbMATH DE number 1775450 (Why is no real title available?)
- Algorithmic derandomization via complexity theory
- Clustering for edge-cost minimization (extended abstract)
- Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
- Extensions of Lipschitz mappings into a Hilbert space
- Latent semantic indexing: A probabilistic analysis
- Learning mixtures of arbitrary Gaussians
- The Johnson-Lindenstrauss lemma and the sphericity of some graphs
- The geometry of graphs and some of its algorithmic applications
Cited in
(only showing first 100 items - show all)- R3P-Loc: a compact multi-label predictor using ridge regression and random projection for protein subcellular localization
- Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma
- Constructing low-rank Tucker tensor approximations using generalized completion
- A survey of compressed sensing
- Representation and coding of signal geometry
- MULTIVARIATE CALIBRATION WITH SUPPORT VECTOR REGRESSION BASED ON RANDOM PROJECTION
- High-dimensional model recovery from random sketched data by exploring intrinsic sparsity
- Compressed and Penalized Linear Regression
- Targeted random projection for prediction from high-dimensional features
- Binary random projections with controllable sparsity patterns
- Structure from randomness in halfspace learning with the zero-one loss
- Bioinspired Random Projections for Robust, Sparse Classification
- Near-Neighbor Preserving Dimension Reduction for Doubling Subsets of L1
- Randomized flexible GMRES with deflated restarting
- Time for dithering: fast and quantized random embeddings via the restricted isometry property
- It ain't where you're from, it's where you're at: hiring origins, firm heterogeneity, and wages
- Learning the truth vector in high dimensions
- scientific article; zbMATH DE number 7758337 (Why is no real title available?)
- On geometric prototype and applications
- Lower bounds on the low-distortion embedding dimension of submanifolds of \(\mathbb{R}^n\)
- Real-valued embeddings and sketches for fast distance and similarity estimation
- Dynamics-preserving compression for modal flow analysis
- Performance of Johnson--Lindenstrauss Transform for $k$-Means and $k$-Medians Clustering
- Dense fast random projections and Lean Walsh transforms
- Sparser Johnson-Lindenstrauss transforms
- On using Toeplitz and circulant matrices for Johnson-Lindenstrauss transforms
- Streaming low-rank matrix approximation with an application to scientific simulation
- Compressive sensing with redundant dictionaries and structured measurements
- Structural conditions for projection-cost preservation via randomized matrix multiplication
- High-dimensional clustering via random projections
- On using Toeplitz and circulant matrices for Johnson-Lindenstrauss transforms
- Limiting laws of coherence of random matrices with applications to testing covariance structure and construction of compressed sensing matrices
- Non-Cartesian spiral binary sensing matrices
- Classification scheme for binary data with extensions
- Simple classification using binary data
- Johnson-Lindenstrauss lemma for circulant matrices
- On the strong restricted isometry property of Bernoulli random matrices
- Fast and memory-optimal dimension reduction using Kac's walk
- Sparse learning for large-scale and high-dimensional data: a randomized convex-concave optimization approach
- scientific article; zbMATH DE number 7650128 (Why is no real title available?)
- Learning intersections of halfspaces with a margin
- On orthogonal projections for dimension reduction and applications in augmented target loss functions for learning problems
- On variants of the Johnson–Lindenstrauss lemma
- Sparse projection oblique randomer forests
- Sparser Johnson-Lindenstrauss transforms
- Two-dimensional random projection
- Randomized approaches to accelerate MCMC algorithms for Bayesian inverse problems
- Variance reduction in feature hashing using MLE and control variate method
- Recent advances in text-to-pattern distance algorithms
- On binary embedding using circulant matrices
- Random projections as regularizers: learning a linear discriminant from fewer observations than dimensions
- MREKLM: a fast multiple empirical kernel learning machine
- A performance driven methodology for cancelable face templates generation
- Near-neighbor preserving dimension reduction via coverings for doubling subsets of \(\ell_1\)
- Dimensionality reduction with subgaussian matrices: a unified theory
- On Lipschitz extension from finite subsets
- Solving, tracking and stopping streaming linear inverse problems
- \( \varepsilon \)-isometric dimension reduction for incompressible subsets of \(\ell_p\)
- Jointly evolving and compressing fuzzy system for feature reduction and classification
- On principal components regression, random projections, and column subsampling
- A variant of the Johnson-Lindenstrauss lemma for circulant matrices
- Kernels as features: on kernels, margins, and low-dimensional mappings
- Bayesian compressed vector autoregressions
- scientific article; zbMATH DE number 7758314 (Why is no real title available?)
- Algorithmic paradigms for stability-based cluster validity and model selection statistical methods, with applications to microarray data analysis
- Structured matrix estimation and completion
- Minimum cost flow in the CONGEST model
- On fast Johnson-Lindenstrauss embeddings of compact submanifolds of \(\mathbb{R}^N\) with boundary
- Random projections for linear programming
- Random projections for conic programs
- Randomized numerical linear algebra: Foundations and algorithms
- Entropy-randomized projection
- Random projections for linear programming: an improved retrieval phase
- The \(xyz\) algorithm for fast interaction search in high-dimensional data
- Random projections for quadratic programs
- A numerical study of efficient sampling strategies for randomized singular value decomposition
- Fast Metric Embedding into the Hamming Cube
- Randomized large distortion dimension reduction
- A survey on unsupervised outlier detection in high‐dimensional numerical data
- Monte Carlo Methods for Estimating the Diagonal of a Real Symmetric Matrix
- Random-walk based approximate \(k\)-nearest neighbors algorithm for diffusion state distance
- Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections
- A sketch algorithm for estimating two-way and multi-way associations
- Approximating spectral clustering via sampling: a review
- Euclidean distortion and the sparsest cut
- Fuzzy \(c\)-means and cluster ensemble with random projection for big data clustering
- On deterministic sketching and streaming for sparse recovery and norm estimation
- Dimension reduction and construction of feature space for image pattern recognition
- Derandomizing restricted isometries via the Legendre symbol
- On unifying randomized methods for inverse problems
- Gaussian random projections for Euclidean membership problems
- Fast and RIP-optimal transforms
- Formation of similarity-reflecting binary vectors with random binary projections
- Efficient binary embedding of categorical data using BinSketch
- Hypercontractivity via tensor calculus
- The Mailman algorithm: a note on matrix-vector multiplication
- Robust visual tracking via part-based template matching with low-rank regulation
- Randomized interpolative decomposition of separated representations
- Random projections of linear and semidefinite problems with linear inequalities
- Modewise operators, the tensor restricted isometry property, and low-rank tensor recovery
This page was built for publication: Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401965)
