Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
From MaRDI portal
Publication:1401965
DOI10.1016/S0022-0000(03)00025-4zbMATH Open1054.68040DBLPjournals/jcss/Achlioptas03WikidataQ57254827 ScholiaQ57254827MaRDI QIDQ1401965FDOQ1401965
Authors: D. Achlioptas 
Publication date: 19 August 2003
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Recommendations
Cites Work
- Extensions of Lipschitz mappings into a Hilbert space
- Latent semantic indexing: A probabilistic analysis
- Title not available (Why is that?)
- The geometry of graphs and some of its algorithmic applications
- Title not available (Why is that?)
- Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
- Learning mixtures of arbitrary Gaussians
- The Johnson-Lindenstrauss lemma and the sphericity of some graphs
- Algorithmic derandomization via complexity theory
- Clustering for edge-cost minimization (extended abstract)
Cited In (only showing first 100 items - show all)
- On variants of the Johnson–Lindenstrauss lemma
- Sparser Johnson-Lindenstrauss transforms
- Two-dimensional random projection
- Random projections as regularizers: learning a linear discriminant from fewer observations than dimensions
- On Lipschitz extension from finite subsets
- A performance driven methodology for cancelable face templates generation
- Dimensionality reduction with subgaussian matrices: a unified theory
- On principal components regression, random projections, and column subsampling
- Bayesian compressed vector autoregressions
- Kernels as features: on kernels, margins, and low-dimensional mappings
- A variant of the Johnson-Lindenstrauss lemma for circulant matrices
- Random projections for linear programming
- Algorithmic paradigms for stability-based cluster validity and model selection statistical methods, with applications to microarray data analysis
- Randomized numerical linear algebra: Foundations and algorithms
- Random projections for conic programs
- A numerical study of efficient sampling strategies for randomized singular value decomposition
- Entropy-randomized projection
- Random projections for quadratic programs
- Monte Carlo Methods for Estimating the Diagonal of a Real Symmetric Matrix
- A survey on unsupervised outlier detection in high‐dimensional numerical data
- Euclidean distortion and the sparsest cut
- 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
- Gaussian random projections for Euclidean membership problems
- Fast and RIP-optimal transforms
- Formation of similarity-reflecting binary vectors with random binary projections
- Hypercontractivity via tensor calculus
- The Mailman algorithm: a note on matrix-vector multiplication
- Random projections of linear and semidefinite problems with linear inequalities
- Distance geometry and data science
- Randomized interpolative decomposition of separated representations
- Sparsified randomization algorithms for low rank approximations and applications to integral equations and inhomogeneous random field simulation
- Frequent directions: simple and deterministic matrix sketching
- Almost Optimal Explicit Johnson-Lindenstrauss Families
- Newton Sketch: A Near Linear-Time Optimization Algorithm with Linear-Quadratic Convergence
- Forecasting using random subspace methods
- Tighter guarantees for the compressive multi-layer perceptron
- Estimates on compressed neural networks regression
- Variable selection in identification of a high dimensional nonlinear non-parametric system
- Optimal (Euclidean) Metric Compression
- Geometric component analysis and its applications to data analysis
- Streaming techniques and data aggregation in networks of tiny artefacts
- Guided Projections for Analyzing the Structure of High-Dimensional Data
- Efficient clustering on Riemannian manifolds: a kernelised random projection approach
- A randomized method for solving discrete ill-posed problems
- Randomized projective methods for the construction of binary sparse vector representations
- Simple bounds for recovering low-complexity models
- Robustness properties of dimensionality reduction with Gaussian random matrices
- Efficient large scale global optimization through clustering-based population methods
- Vector data transformation using random binary matrices
- A survey of compressed sensing
- R3P-Loc: a compact multi-label predictor using ridge regression and random projection for protein subcellular localization
- MULTIVARIATE CALIBRATION WITH SUPPORT VECTOR REGRESSION BASED ON RANDOM PROJECTION
- Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma
- Representation and coding of signal geometry
- High-dimensional model recovery from random sketched data by exploring intrinsic sparsity
- Title not available (Why is that?)
- Real-valued embeddings and sketches for fast distance and similarity estimation
- Sparser Johnson-Lindenstrauss transforms
- Streaming low-rank matrix approximation with an application to scientific simulation
- Dense fast random projections and Lean Walsh transforms
- On using Toeplitz and circulant matrices for Johnson-Lindenstrauss transforms
- Compressive sensing with redundant dictionaries and structured measurements
- On using Toeplitz and circulant matrices for Johnson-Lindenstrauss transforms
- High-dimensional clustering via random projections
- Limiting laws of coherence of random matrices with applications to testing covariance structure and construction of compressed sensing matrices
- Johnson-Lindenstrauss lemma for circulant matrices
- Sparse learning for large-scale and high-dimensional data: a randomized convex-concave optimization approach
- Learning intersections of halfspaces with a margin
- Sparse projection oblique randomer forests
- On orthogonal projections for dimension reduction and applications in augmented target loss functions for learning problems
- On binary embedding using circulant matrices
- 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
- Solving, tracking and stopping streaming linear inverse problems
- MREKLM: a fast multiple empirical kernel learning machine
- \( \varepsilon \)-isometric dimension reduction for incompressible subsets of \(\ell_p\)
- Jointly evolving and compressing fuzzy system for feature reduction and classification
- Near-neighbor preserving dimension reduction via coverings for doubling subsets of \(\ell_1\)
- Title not available (Why is that?)
- Minimum cost flow in the CONGEST model
- On fast Johnson-Lindenstrauss embeddings of compact submanifolds of \(\mathbb{R}^N\) with boundary
- Structured matrix estimation and completion
- Random projections for linear programming: an improved retrieval phase
- Fast Metric Embedding into the Hamming Cube
- The \(xyz\) algorithm for fast interaction search in high-dimensional data
- Randomized large distortion dimension reduction
- A sketch algorithm for estimating two-way and multi-way associations
- Approximating spectral clustering via sampling: a review
- Random-walk based approximate \(k\)-nearest neighbors algorithm for diffusion state distance
- Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections
- On unifying randomized methods for inverse problems
- Fuzzy \(c\)-means and cluster ensemble with random projection for big data clustering
- Efficient binary embedding of categorical data using BinSketch
- Robust visual tracking via part-based template matching with low-rank regulation
- Modewise operators, the tensor restricted isometry property, and low-rank tensor recovery
- Random Projection and Recovery for High Dimensional Optimization with Arbitrary Outliers
- Robust frequent directions with application in online learning
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)
