Distance-based index structures for fast similarity search
type: Item
instance of: scholarly article
title: Distance-based index structures for fast similarity search
zbMATH Open document ID: 1392.68175
author: Peng Zhang
published in: Cybernetics and Systems Analysis
publication date: 2018-04-05T00:00:00Z
Mathematics Subject Classification ID: 68P15
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 6856411
zbMATH Keywords: similarity search
zbMATH Keywords: nearest neighbor search
zbMATH Keywords: index structure
zbMATH Keywords: distance-based indexing
zbMATH Keywords: metric distance
zbMATH Keywords: nonmetric distance
zbMATH Keywords: metric tree
zbMATH Keywords: neighborhood graph
zbMATH Keywords: branch-and-bound method
describes a project that uses: FLANN
describes a project that uses: DIMACS
describes a project that uses: GitHub
MaRDI profile type: MaRDI publication profile
full work available at URL: s10559-017-9966-y
OpenAlex ID: W2739676512
cites work: Introduction to Information Retrieval
cites work: Pattern classification.
cites work: Q2970419
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: Foundations of multidimensional and metric data structures.
cites work: Similarity search. The metric space approach.
cites work: A Branch and Bound Algorithm for Computing k-Nearest Neighbors
cites work: Data dimensionality estimation methods: A survey.
cites work: Indexability, concentration, and VC theory
cites work: On nonmetric similarity search problems in complex domains
cites work: A Data Structure and an Algorithm for the Nearest Point Problem
cites work: Approximate similarity search: a multi-faceted problem
cites work: Speeding up spatial approximation search in metric spaces
cites work: Succinct representations of permutations and functions
cites work: Satisfying general proximity/similarity queries with metric trees
cites work: Q3140435
cites work: Pivot selection techniques for proximity searching in metric spaces
cites work: Q3853109
cites work: Dynamic spatial approximation trees
cites work: On certain exact solutions of a generalized KdV-Burgers type equation via symmetry approach. II
cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem
cites work: Clustering to minimize the maximum intercluster distance
cites work: Approximate Bregman near neighbors in sublinear time: beyond the triangle inequality
cites work: Q4633839
cites work: Q3140429
cites work: Practical Construction of k-Nearest Neighbor Graphs in Metric Spaces
cites work: Collective dynamics of ‘small-world’ networks
cites work: The small-world phenomenon
cites work: Q3470486
cites work: Navigability is a Robust Property
cites work: On the searchability of small-world networks with arbitrary underlying structure
cites work: A Lower Bound for Network Navigability
cites work: Universal augmentation schemes for network navigability
cites work: Vector representations for efficient comparison and search for similar strings
cites work: Investigation of accelerated search for close text sequences with the help of vector representations
cites work: Similarity estimation techniques from rounding algorithms
cites work: New directions in nearest neighbor searching with applications to lattice sieving
DOI: 10.1007/S10559-017-9966-Y
description: scientific article; zbMATH DE number 6856411