Large Scale Nearest Neighbor Search - Theories, Algorithms, and Applications
Explore this paper's citation graph
Summary
This thesis unify various nearest neighbor search methods into the data partition framework, and provides a general formulation of optimal data partition, which supports fastest search speed while satisfying a required search accuracy.
- Type
- article
- Published
- 2014-01-01
- Cited by
- 0
- References
- 83
- Access
- Open access
- OpenAlex
- https://openalex.org/W1488844540
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:116961587
Keywords
Nearest neighbor search, Search engine indexing, Computer science, Locality-sensitive hashing, Sublinear function
References
- Learning a Nonlinear Embedding by Preserving Class Neighbourhood Structure
- Five Balltree Construction Algorithms
- Similarity Search in High Dimensions via Hashing
- Modeling the Shape of the Scene: A Holistic Representation of the Spatial Envelope
- Fast Approximate Nearest Neighbors with Automatic Algorithm Configuration
- Survey of Nearest Neighbor Techniques
- Active query sensing for mobile location search
- Distance-based indexing for high-dimensional metric spaces
- Retrieval and classification of shape-based objects using Fourier, generic Fourier, and wavelet-Fourier descriptors technique: A comparative study
- Lower bounds on locality sensitive hashing
- Compact hashing with joint optimization of search accuracy and time
- Supervised hashing with kernels
- Similarity estimation techniques from rounding algorithms
- An Algorithm for Finding Best Matches in Logarithmic Expected Time
- Mobile product search with Bag of Hash Bits and boundary reranking
- Evaluating bag-of-visual-words representations in scene classification
- TREC: Experiment and evaluation in information retrieval
- Global contrast based salient region detection
- Satisfying General Proximity/Similarity Queries with Metric Trees
- Mobile Visual Search
Cited by
No citing papers recorded for this paper.
Related papers
- Subspace Approximation for Approximate Nearest Neighbor Search in NLP
- Efficient Approximate Nearest Neighbor Search for Multiple Weighted lp≤2 Distance Functions
- SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index
- Nearest neighbor search for arbitrary kernels with explicit embeddings
- Class-constraint similarity queries