scientific article; zbMATH DE number 1775450
From MaRDI portal
Publication:4542583
Recommendations
- scientific article; zbMATH DE number 437552
- Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
- scientific article; zbMATH DE number 1559575
- Approximate nearest neighbor: towards removing the curse of dimensionality
- An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Cited in
(only showing first 100 items - show all)- Investigation of accelerated search for close text sequences with the help of vector representations
- A simple proof of the restricted isometry property for random matrices
- Fast dimension reduction using Rademacher series on dual BCH codes
- Approximate closest-point queries in high dimensions
- Approximate nearest neighbor queries revisited
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- Chromatic nearest neighbor searching: A query sensitive approach
- On approximate nearest neighbors under \(l_\infty\) norm
- Improved maximum inner product search with better theoretical guarantee using randomized partition trees
- Unique entity estimation with application to the Syrian conflict
- Sieving for closest lattice vectors (with preprocessing)
- Robust proximity search for balls using sublinear space
- Approximate nearest neighbor search for \(\ell_{p}\)-spaces \((2 < p < \infty)\) via embeddings
- Identifying an unknown code by partial Gaussian elimination
- SONIC: streaming overlapping community detection
- Multiple Bayesian discriminant functions for high-dimensional massive data classification
- Why locality sensitive hashing works: a practical perspective
- De-anonymization of heterogeneous random graphs in quasilinear time
- Fuzzy \(c\)-means and cluster ensemble with random projection for big data clustering
- Generalised kernel weighted fuzzy c-means clustering algorithm with local information
- Dense neighborhoods on affinity graph
- A randomized approximate nearest neighbors algorithm
- Lower bounds on performance of metric tree indexing schemes for exact similarity search in high dimensions
- Permuted pattern matching algorithms on multi-track strings
- On recovery guarantees for one-bit compressed sensing on manifolds
- GLDH: toward more efficient global low-density locality-sensitive hashing for high dimensions
- Index-based, high-dimensional, cosine threshold querying with optimality guarantees
- Geometric component analysis and its applications to data analysis
- ForestDSH: a universal hash design for discrete probability distributions
- Correlations between random projections and the bivariate normal
- Weakly-supervised semantic guided hashing for social image retrieval
- Anchor-based self-ensembling for semi-supervised deep pairwise hashing
- Robust property-preserving hash functions for Hamming distance and more
- Bayesian random projection-based signal detection for Gaussian scale space random fields
- An asymptotic thin shell condition and large deviations for random multidimensional projections
- A non-gradient method for solving elliptic partial differential equations with deep neural networks
- Near-neighbor preserving dimension reduction via coverings for doubling subsets of _1
- Approximate hashing for bioinformatics
- Random-walk based approximate \(k\)-nearest neighbors algorithm for diffusion state distance
- Efficient binary embedding of categorical data using BinSketch
- Sequence graph transform (SGT): a feature embedding function for sequence data mining
- Exploiting pseudo-locality of interchange distance
- Locality sensitive hashing with extended differential privacy
- How to find ternary LWE keys using locality sensitive hashing
- Fast spectral analysis for approximate nearest neighbor search
- Property-preserving hash functions for Hamming distance from standard assumptions
- A simple test for zero multiple correlation coefficient in high-dimensional normal data using random projection
- Distance geometry and data science
- Random projections for quadratic programs
- Explicit correlation amplifiers for finding outlier correlations in deterministic subquadratic time
- Health policyholder clustering using medical consumption. A useful tool for targeting prevention plans
- On closest pair in Euclidean metric: monochromatic is as hard as bichromatic
- Randomized large distortion dimension reduction
- SALSAS: sub-linear active learning strategy with approximate \(k\)-NN search
- A distance based clustering method for arbitrary shaped clusters in large datasets
- An \(O(\log n)\) query time algorithm for reducing \(\varepsilon \)-NN to \((c,r)\)-NN
- Sharing hash codes for multiple purposes
- New analysis of manifold embeddings and signal recovery from compressive measurements
- Binary vectors for fast distance and similarity estimation
- Approximation and inapproximability results for maximum clique of disc graphs in high dimensions
- The Johnson-Lindenstrauss lemma almost characterizes Hilbert space, but not quite
- I/O-efficient similarity join
- A new coding-based algorithm for finding closest pair of vectors
- The complexity of LSH feasibility
- Approximate range searching in higher dimension
- Lower bounds for predecessor searching in the cell probe model
- Vector representations for efficient comparison and search for similar strings
- Diffusion wavelets
- An algorithmic theory of learning: Robust concepts and random projection
- Deformable spanners and applications
- Nearest neighbors search using point location in balls with applications to approximate Voronoi decompositions
- Learning in compressed space
- Fast and RIP-optimal transforms
- Similarity, kernels, and the fundamental constraints on cognition
- The black-box complexity of nearest-neighbor search
- An acceleration of FFT-based algorithms for the match-count problem
- Is the \(k\)-NN classifier in high dimensions affected by the curse of dimensionality?
- Reductions among high dimensional proximity problems
- Finding correlations in subquadratic time, with applications to learning parities and the closest pair problem
- Biomechanical simulation and control of hands and tendinous systems
- Locality-Sensitive Hashing Without False Negatives for l_p
- Frequent-itemset mining using locality-sensitive hashing
- Computing (and Life) Is All about Tradeoffs
- Random projections and Hotelling's T^2 statistics for change detection in high-dimensional data streams
- Approximate Bregman near neighbors in sublinear time: beyond the triangle inequality
- Approximate Bregman near neighbors in sublinear time: beyond the triangle inequality
- Fast approximate kNN graph construction for high dimensional data via recursive Lanczos bisection
- A combinatorial algorithm for all-pairs shortest paths in directed vertex-weighted graphs with applications to disc graphs
- A localized meshless approach for modeling spatial-temporal calcium dynamics in ventricular myocytes
- Approximate nearest neighbor: towards removing the curse of dimensionality
- Partially specified nearest neighbor search
- Reporting neighbors in high-dimensional Euclidean space
- Approximate k-flat nearest neighbor search
- 3D rectangulations and geometric matrix multiplication
- Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny)
- Faster sieving for shortest lattice vectors using spherical locality-sensitive hashing
- Combinatorial theorems about embedding trees on the real line
- Limitations on quantum dimensionality reduction
- Content search through comparisons
- Almost Optimal Explicit Johnson-Lindenstrauss Families
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4542583)
