Index structures for fast similarity search for real-valued vectors. I
type: Item
instance of: scholarly article
title: Index structures for fast similarity search for real-valued vectors. I
zbMATH Open document ID: 1390.68249
author: Xianqiang Yang
published in: Cybernetics and Systems Analysis
publication date: 2018-04-18T00:00:00Z
Mathematics Subject Classification ID: 68P15
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 6861255
zbMATH Keywords: similarity search
zbMATH Keywords: nearest neighbor
zbMATH Keywords: near neighbor
zbMATH Keywords: index structure
zbMATH Keywords: locality-sensitive hashing
zbMATH Keywords: locality-sensitive filtering
describes a project that uses: FLANN
describes a project that uses: Voronoi
describes a project that uses: FALCONN
describes a project that uses: HyperLogLog
MaRDI profile type: Publication
full work available at URL: s10559-018-0016-1
OpenAlex ID: W2789656094
cites work: Real-valued embeddings and sketches for fast distance and similarity estimation
cites work: Binary vectors for fast distance and similarity estimation
cites work: Distance-based index structures for fast similarity search
cites work: Index structures for fast similarity search for binary vectors
cites work: Introduction to Information Retrieval
cites work: Point location in arrangements of hyperplanes
cites work: Formation of similarity-reflecting binary vectors with random binary projections
cites work: An optimal algorithm for approximate nearest neighbor searching fixed dimensions
cites work: Approximate nearest neighbor: towards removing the curse of dimensionality
cites work: Similarity estimation techniques from rounding algorithms
cites work: Q3853109
cites work: LSH-Preserving Functions and Their Applications
cites work: The Distortion of Locality Sensitive Hashing
cites work: Investigation of accelerated search for close text sequences with the help of vector representations
cites work: Sketching and Embedding are Equivalent for Norms
cites work: Randomized projective methods for the construction of binary sparse vector representations
cites work: Spherical LSH for Approximate Nearest Neighbor Search on Unit Hypersphere
cites work: Optimal Data-Dependent Hashing for Approximate Near Neighbors
cites work: Q5111221
cites work: Q4638108
cites work: Entropy based nearest neighbor search in high dimensions
cites work: Parameter-free Locality Sensitive Hashing for Spherical Range Reporting
cites work: Locality-Sensitive Hashing Without False Negatives for $$l_p$$
cites work: Q3576759
cites work: LSH Forest: Practical Algorithms Made Theoretical
cites work: Optimal Hashing-based Time-Space Trade-offs for Approximate Near Neighbors
cites work: New directions in nearest neighbor searching with applications to lattice sieving
cites work: A Framework for Similarity Search with Space-Time Tradeoffs using Locality-Sensitive Filtering
cites work: Finding correlations in subquadratic time, with applications to learning parities and the closest pair problem
cites work: Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny)
cites work: A Refined Analysis of LSH for Well-dispersed Data Points
cites work: Beyond Locality-Sensitive Hashing
cites work: Tight Lower Bounds for Data-Dependent Locality-Sensitive Hashing
DOI: 10.1007/S10559-018-0016-1
Recommended article: Index structures for fast similarity search for binary vectors
Recommended article: Distance-based index structures for fast similarity search
Recommended article: Indexing very high-dimensional sparse and quasi-sparse vectors for similarity searches
Recommended article: Q5480639
Recommended article: Using non-zero dimensions for the cosine and Tanimoto similarity search among real valued vectors
Recommended article: Q4445806
description: scientific article; zbMATH DE number 6861255