Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
From MaRDI portal
Publication:1401965
Recommendations
Cites work
- 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
- scientific article; zbMATH DE number 1559575 (Why is no real title available?)
- scientific article; zbMATH DE number 1775450 (Why is no real title available?)
- Latent semantic indexing: A probabilistic analysis
- Learning mixtures of arbitrary Gaussians
- The geometry of graphs and some of its algorithmic applications
- The Johnson-Lindenstrauss lemma and the sphericity of some graphs
Cited in
(only showing first 100 items - show all)- On principal components regression, random projections, and column subsampling
- Gaussian random projections for Euclidean membership problems
- Efficient clustering on Riemannian manifolds: a kernelised random projection approach
- Robustness properties of dimensionality reduction with Gaussian random matrices
- Forecasting using random subspace methods
- Bayesian compressed vector autoregressions
- Fuzzy \(c\)-means and cluster ensemble with random projection for big data clustering
- Efficient extreme learning machine via very sparse random projection
- On using Toeplitz and circulant matrices for Johnson-Lindenstrauss transforms
- On orthogonal projections for dimension reduction and applications in augmented target loss functions for learning problems
- Efficient large scale global optimization through clustering-based population methods
- Geometric component analysis and its applications to data analysis
- Correlations between random projections and the bivariate normal
- Stochastic quasi-gradient methods: variance reduction via Jacobian sketching
- Random projections for conic programs
- A stochastic subspace approach to gradient-free optimization in high dimensions
- Bayesian random projection-based signal detection for Gaussian scale space random fields
- Optimal fast Johnson-Lindenstrauss embeddings for large data sets
- Dimensionality reduction for \(k\)-distance applied to persistent homology
- Fast and memory-optimal dimension reduction using Kac's walk
- Variance reduction in feature hashing using MLE and control variate method
- Recent advances in text-to-pattern distance algorithms
- Near-neighbor preserving dimension reduction via coverings for doubling subsets of _1
- Random-walk based approximate \(k\)-nearest neighbors algorithm for diffusion state distance
- High-dimensional clustering via random projections
- Randomized approaches to accelerate MCMC algorithms for Bayesian inverse problems
- Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections
- Efficient binary embedding of categorical data using BinSketch
- Numerical bifurcation analysis of PDEs from lattice Boltzmann model simulations: a parsimonious machine learning approach
- The perfect marriage and much more: combining dimension reduction, distance measures and covariance
- Practical non-interactive publicly verifiable secret sharing with thousands of parties
- Distance geometry and data science
- Random projections for quadratic programs
- Randomized large distortion dimension reduction
- A randomized method for solving discrete ill-posed problems
- MREKLM: a fast multiple empirical kernel learning machine
- Learning the truth vector in high dimensions
- Randomized linear algebra for model reduction. I. Galerkin methods and error estimation
- Testing proximity to subspaces: approximate \(\ell_\infty\) minimization in constant time
- On the strong restricted isometry property of Bernoulli random matrices
- Structured matrix estimation and completion
- Random projections as regularizers: learning a linear discriminant from fewer observations than dimensions
- On Lipschitz extension from finite subsets
- Structural conditions for projection-cost preservation via randomized matrix multiplication
- On deterministic sketching and streaming for sparse recovery and norm estimation
- Learning intersections of halfspaces with a margin
- Fast and RIP-optimal transforms
- Formation of similarity-reflecting binary vectors with random binary projections
- Entropy-randomized projection
- Binary random projections with controllable sparsity patterns
- Random projections of linear and semidefinite problems with linear inequalities
- It ain't where you're from, it's where you're at: hiring origins, firm heterogeneity, and wages
- Hypercontractivity via tensor calculus
- Frequent directions: simple and deterministic matrix sketching
- Sparse learning for large-scale and high-dimensional data: a randomized convex-concave optimization approach
- Dimension reduction and construction of feature space for image pattern recognition
- Derandomizing restricted isometries via the Legendre symbol
- Newton Sketch: A Near Linear-Time Optimization Algorithm with Linear-Quadratic Convergence
- Almost Optimal Explicit Johnson-Lindenstrauss Families
- Johnson-Lindenstrauss lemma for circulant matrices
- Sparser Johnson-Lindenstrauss transforms
- Variable selection in identification of a high dimensional nonlinear non-parametric system
- A sketch algorithm for estimating two-way and multi-way associations
- Classification scheme for binary data with extensions
- Approximating spectral clustering via sampling: a review
- Guided Projections for Analyzing the Structure of High-Dimensional Data
- Compressed and Penalized Linear Regression
- Compressive sensing with redundant dictionaries and structured measurements
- A survey of compressed sensing
- On variants of the Johnson–Lindenstrauss lemma
- Simple bounds for recovering low-complexity models
- Randomized projective methods for the construction of binary sparse vector representations
- Sparsified randomization algorithms for low rank approximations and applications to integral equations and inhomogeneous random field simulation
- Algorithmic paradigms for stability-based cluster validity and model selection statistical methods, with applications to microarray data analysis
- The xyz algorithm for fast interaction search in high-dimensional data
- On binary embedding using circulant matrices
- Representation and coding of signal geometry
- Time for dithering: fast and quantized random embeddings via the restricted isometry property
- Simple classification using binary data
- Optimal bounds for Johnson-Lindenstrauss transformations
- Robust frequent directions with application in online learning
- Streaming techniques and data aggregation in networks of tiny artefacts
- MULTIVARIATE CALIBRATION WITH SUPPORT VECTOR REGRESSION BASED ON RANDOM PROJECTION
- Sparse projection oblique randomer forests
- A survey on unsupervised outlier detection in high‐dimensional numerical data
- On geometric prototype and applications
- Low-rank Tucker approximation of a tensor from streaming data
- Bioinspired Random Projections for Robust, Sparse Classification
- Performance of Johnson--Lindenstrauss Transform for $k$-Means and $k$-Medians Clustering
- Optimal (Euclidean) Metric Compression
- Real-valued embeddings and sketches for fast distance and similarity estimation
- A numerical study of efficient sampling strategies for randomized singular value decomposition
- On using Toeplitz and circulant matrices for Johnson-Lindenstrauss transforms
- Structure from randomness in halfspace learning with the zero-one loss
- Targeted random projection for prediction from high-dimensional features
- Dimensionality reduction with subgaussian matrices: a unified theory
- Random projections for linear programming
- Robust visual tracking via part-based template matching with low-rank regulation
- Streaming low-rank matrix approximation with an application to scientific simulation
- Two-dimensional random projection
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)
