Pages that link to "Item:Q4542583"
From MaRDI portal
The following pages link to Approximate nearest neighbors: Towards removing the curse of dimensionality (Q4542583):
Displaying 50 items.
- Multiple Bayesian discriminant functions for high-dimensional massive data classification (Q1741308) (← links)
- Why locality sensitive hashing works: a practical perspective (Q1751421) (← links)
- De-anonymization of heterogeneous random graphs in quasilinear time (Q1755750) (← links)
- Fuzzy \(c\)-means and cluster ensemble with random projection for big data clustering (Q1793461) (← links)
- Generalised kernel weighted fuzzy c-means clustering algorithm with local information (Q1795024) (← links)
- Dense neighborhoods on affinity graph (Q1931579) (← links)
- A randomized approximate nearest neighbors algorithm (Q1948601) (← links)
- Lower bounds on performance of metric tree indexing schemes for exact similarity search in high dimensions (Q1950389) (← links)
- Permuted pattern matching algorithms on multi-track strings (Q2003324) (← links)
- On recovery guarantees for one-bit compressed sensing on manifolds (Q2022611) (← links)
- GLDH: toward more efficient global low-density locality-sensitive hashing for high dimensions (Q2023176) (← links)
- Index-based, high-dimensional, cosine threshold querying with optimality guarantees (Q2035468) (← links)
- Geometric component analysis and its applications to data analysis (Q2036489) (← links)
- ForestDSH: a universal hash design for discrete probability distributions (Q2036729) (← links)
- Correlations between random projections and the bivariate normal (Q2036781) (← links)
- Weakly-supervised semantic guided hashing for social image retrieval (Q2056142) (← links)
- Anchor-based self-ensembling for semi-supervised deep pairwise hashing (Q2056149) (← links)
- Robust property-preserving hash functions for Hamming distance and more (Q2056796) (← links)
- Bayesian random projection-based signal detection for Gaussian scale space random fields (Q2058557) (← links)
- An asymptotic thin shell condition and large deviations for random multidimensional projections (Q2070086) (← links)
- A non-gradient method for solving elliptic partial differential equations with deep neural networks (Q2099748) (← links)
- Near-neighbor preserving dimension reduction via coverings for doubling subsets of \(\ell_1\) (Q2110372) (← links)
- Approximate hashing for bioinformatics (Q2117679) (← links)
- Random-walk based approximate \(k\)-nearest neighbors algorithm for diffusion state distance (Q2128423) (← links)
- Efficient binary embedding of categorical data using BinSketch (Q2134033) (← links)
- Sequence graph transform (SGT): a feature embedding function for sequence data mining (Q2134047) (← links)
- Exploiting pseudo-locality of interchange distance (Q2146144) (← links)
- Locality sensitive hashing with extended differential privacy (Q2148769) (← links)
- How to find ternary LWE keys using locality sensitive hashing (Q2149799) (← links)
- Fast spectral analysis for approximate nearest neighbor search (Q2163259) (← links)
- Property-preserving hash functions for Hamming distance from standard assumptions (Q2170070) (← links)
- A simple test for zero multiple correlation coefficient in high-dimensional normal data using random projection (Q2189584) (← links)
- Distance geometry and data science (Q2192022) (← links)
- Random projections for quadratic programs (Q2196316) (← links)
- Explicit correlation amplifiers for finding outlier correlations in deterministic subquadratic time (Q2205636) (← links)
- Health policyholder clustering using medical consumption. A useful tool for targeting prevention plans (Q2219633) (← links)
- On closest pair in Euclidean metric: monochromatic is as hard as bichromatic (Q2221003) (← links)
- Randomized large distortion dimension reduction (Q2253922) (← links)
- SALSAS: sub-linear active learning strategy with approximate \(k\)-NN search (Q2275987) (← links)
- A distance based clustering method for arbitrary shaped clusters in large datasets (Q2276025) (← links)
- An \(O(\log n)\) query time algorithm for reducing \(\varepsilon \)-NN to \((c,r)\)-NN (Q2283022) (← links)
- Sharing hash codes for multiple purposes (Q2329853) (← links)
- New analysis of manifold embeddings and signal recovery from compressive measurements (Q2347898) (← links)
- Binary vectors for fast distance and similarity estimation (Q2362826) (← links)
- Approximation and inapproximability results for maximum clique of disc graphs in high dimensions (Q2380046) (← links)
- The Johnson-Lindenstrauss lemma almost characterizes Hilbert space, but not quite (Q2380779) (← links)
- I/O-efficient similarity join (Q2408174) (← links)
- A new coding-based algorithm for finding closest pair of vectors (Q2420648) (← links)
- The complexity of LSH feasibility (Q2440169) (← links)
- Approximate range searching in higher dimension (Q2456663) (← links)
