scientific article; zbMATH DE number 1775450
From MaRDI portal
Publication:4542583
zbMATH Open1029.68541MaRDI QIDQ4542583FDOQ4542583
Authors: Piotr Indyk, Rajeev Motwani 
Publication date: 1 August 2002
Title of this publication is not available (Why is that?)
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)
- Fast spectral analysis for approximate nearest neighbor search
- On binary embedding using circulant matrices
- Title not available (Why is that?)
- Sharing hash codes for multiple purposes
- The complexity of LSH feasibility
- Near-neighbor preserving dimension reduction via coverings for doubling subsets of \(\ell_1\)
- On closest pair in Euclidean metric: monochromatic is as hard as bichromatic
- Filtering multi-set tree: data structure for flexible matching using multi-track data
- Permuted pattern matching algorithms on multi-track strings
- Approximate hashing for bioinformatics
- Sequence graph transform (SGT): a feature embedding function for sequence data mining
- Approximation and inapproximability results for maximum clique of disc graphs in high dimensions
- Randomized large distortion dimension reduction
- Random-walk based approximate \(k\)-nearest neighbors algorithm for diffusion state distance
- Efficient binary embedding of categorical data using BinSketch
- On recovery guarantees for one-bit compressed sensing on manifolds
- Learning in compressed space
- Exact \(L_{\infty}\) nearest neighbor search in high dimensions
- Nearly optimal property preserving hashing
- Robust frequent directions with application in online learning
- Optimal bounds for Johnson-Lindenstrauss transformations
- Exploiting pseudo-locality of interchange distance
- Locality sensitive hashing with extended differential privacy
- How to find ternary LWE keys using locality sensitive hashing
- Index-based, high-dimensional, cosine threshold querying with optimality guarantees
- ForestDSH: a universal hash design for discrete probability distributions
- Correlations between random projections and the bivariate normal
- Sketching and embedding are equivalent for norms
- Towards Practical Large-Scale Randomized Iterative Least Squares Solvers through Uncertainty Quantification
- An Implicit Representation and Iterative Solution of Randomly Sketched Linear Systems
- Partitioning well-clustered graphs: spectral clustering works!
- Graph-based time-space trade-offs for approximate near neighbors
- Dense neighborhoods on affinity graph
- Adversarially robust property-preserving hash functions
- Anchor-based self-ensembling for semi-supervised deep pairwise hashing
- Weakly-supervised semantic guided hashing for social image retrieval
- Title not available (Why is that?)
- Title not available (Why is that?)
- An \(O(\log n)\) query time algorithm for reducing \(\varepsilon \)-NN to \((c,r)\)-NN
- Bayesian random projection-based signal detection for Gaussian scale space random fields
- Health policyholder clustering using medical consumption. A useful tool for targeting prevention plans
- Title not available (Why is that?)
- Diverse near neighbor problem
- Theoretical analysis of cross-validation for estimating the risk of the \(k\)-nearest neighbor classifier
- I/O-efficient similarity join
- I/O-efficient similarity join
- Manifold Learning and Nonlinear Homogenization
- Near-Neighbor Preserving Dimension Reduction for Doubling Subsets of L1
- The Closest Pair Problem under the Hamming Metric
- A simple test for zero multiple correlation coefficient in high-dimensional normal data using random projection
- A new coding-based algorithm for finding closest pair of vectors
- LSH-preserving functions and their applications
- Explicit correlation amplifiers for finding outlier correlations in deterministic subquadratic time
- A distance based clustering method for arbitrary shaped clusters in large datasets
- Low-quality dimension reduction and high-dimensional approximate nearest neighbor
- On variants of the Johnson–Lindenstrauss lemma
- Similarity, kernels, and the fundamental constraints on cognition
- Approximate nearest neighbor: towards removing the curse of dimensionality
- A simple proof of the restricted isometry property for random matrices
- Fast dimension reduction using Rademacher series on dual BCH codes
- Nearest-neighbor-preserving embeddings
- Two-dimensional random projection
- Coding of image feature descriptors for distributed rate-efficient visual correspondences
- Dimensionality reduction with subgaussian matrices: a unified theory
- Kernels as features: on kernels, margins, and low-dimensional mappings
- A variant of the Johnson-Lindenstrauss lemma for circulant matrices
- New analysis of manifold embeddings and signal recovery from compressive measurements
- 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
- Diffusion wavelets
- Chromatic nearest neighbor searching: A query sensitive approach
- Database Theory - ICDT 2005
- Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
- Frequent-itemset mining using locality-sensitive hashing
- Title not available (Why is that?)
- Random projections for quadratic programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Biomechanical simulation and control of hands and tendinous systems
- Robust property-preserving hash functions for Hamming distance and more
- A survey on unsupervised outlier detection in high‐dimensional numerical data
- Proximity-preserving labeling schemes
- Property-preserving hash functions for Hamming distance from standard assumptions
- Fast approximate \(k\)NN graph construction for high dimensional data via recursive Lanczos bisection
- Binary vectors for fast distance and similarity estimation
- Decomposable algorithms for nearest neighbor computing
- Vector representations for efficient comparison and search for similar strings
- An algorithmic theory of learning: Robust concepts and random projection
- Fast and RIP-optimal transforms
- An optimal algorithm for approximate nearest neighbor searching fixed dimensions
- Random Projection RBF Nets for Multidimensional Density Estimation
- Compressed labeling on distilled labelsets for multi-label learning
- Title not available (Why is that?)
- Limitations on quantum dimensionality reduction
- Indexability, concentration, and VC theory
- Title not available (Why is that?)
- Almost Optimal Explicit Johnson-Lindenstrauss Families
- Similarity based deduplication with small data chunks
- Approximate closest-point queries in high dimensions
- Nearest neighbors search using point location in balls with applications to approximate Voronoi decompositions
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)
