Low Diameter Graph Decompositions by Approximate Distance Computation.
Ruben BeckerYuval EmekChristoph LenzenPublished in: CoRR (2019)
Keyphrases
- distance computation
- distance function
- edit distance
- similarity search
- k nearest neighbor
- multi step
- nearest neighbor
- euclidean distance
- graph matching
- similarity measure
- complex objects
- feature construction
- locality sensitive hashing
- similarity queries
- nearest neighbor search
- dimensionality reduction
- knn
- high dimensional data
- multi dimensional
- data sets
- singular value decomposition
- exhaustive search
- object recognition