No article text was recorded for this version.
triangle inequality violation (non-metric similarity search)
Version 2 of 2363 papers441 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Approximate Bregman Near Neighbors in Sublinear Time: beyond the Triangle inequality
- Blog: Nearly optimal classification for semimetrics
- Blog: Lightweight-Yet-Efficient: Revitalizing Ball-Tree for Point-to-Hyperplane Nearest Neighbor Search
- Blog: Pruning Algorithms for Low-Dimensional Non-metric k-NN Search: A Case Study
- Blog: Maximum Likelihood Directed Enumeration Method in Piecewise-Regular Object Recognition
- Blog: Neural Bregman Divergences for Distance Learning
- Blog: Indexing and matching trajectories under inconsistent sampling rates
- Blog: A Survey on Trajectory Data Management, Analytics, and Learning
- Blog: Non-Metric Locality-Sensitive Hashing
- Blog: Two tales for a geometric Jensen-Shannon divergence
- Blog: Approximate Bregman near neighbors in sublinear time: Beyond the triangle inequality
- Blog: Fast nearest neighbor retrieval for bregman divergences
- Blog: Pruning Algorithms for Low-Dimensional Non-metric k-NN Search: A Case Study
- Blog: $\alpha$-Reachable Graphs for Multi-vector Nearest Neighbor Search
- Blog: Nearly Optimal Classification for Semimetrics
- Blog: Maximum inner-product search using cone trees
- Blog: Metrics defined by Bregman Divergences
- Blog: On Efficient Retrieval of Top Similarity Vectors
- Blog: Cover trees for nearest neighbor
- Blog: Near-Linear Time Approximations Schemes for Clustering in Doubling Metrics
- Blog: Nearly optimal classification for semimetrics
- Blog: Maximum Inner-Product Search using Tree Data-structures
- Blog: Metrics Induced by Quantum Jensen-Shannon-Renyí and Related Divergences
- Blog: Twofold Video Hashing with Automatic Synchronization
- Blog: Metric Representations of Networks: A Uniqueness Result
- Blog: Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce
- Blog: Randomized Algorithms for Comparison-based Search
- Blog: Magnitude Distance: A Geometric Measure of Dataset Similarity
- Blog: Max-Sum Diversification, Monotone Submodular Functions and Semi-metric Spaces
- Blog: Reinforcement Routing on Proximity Graph for Efficient Recommendation
- Blog: Active Data Clustering
- Blog: k-Means Clustering of Lines for Big Data
- Blog: Improved FPT Approximation for Non-metric TSP
- Blog: Foundations of Vector Retrieval
- Blog: S2JSD-LSH: A Locality-Sensitive Hashing Schema for Probability Distributions
- Blog: TSP with Predictions: Heatmap to Tour with Provable Guarantees
- Blog: On the cohesion and separability of average-link for hierarchical agglomerative clustering
- Blog: Levenshtein Distance, Sequence Comparison and Biological Database Search
- Blog: Accurate and Fast Retrieval for Complex Non-metric Data via Neighborhood Graphs
- Blog: Asymmetric LSH (ALSH) for Sublinear Time Maximum Inner Product Search (MIPS)
- Blog: Off the Beaten Path: Let’s Replace Term-Based Retrieval with k-NN Search
- Blog: A Neural Framework for Learning Subgraph and Graph Similarity Measures
- Blog: Graph Sensitive Indices for Comparing Clusterings
- Blog: Efficient Bregman Range Search
- Blog: Recovery of Signals with Low Density
- Blog: A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs
- Blog: Hybrid k-Clustering: Blending k-Median and k-Center
- Blog: Maximum-likelihood approximate nearest neighbor method in real-time image recognition
- Blog: Lightweight-Yet-Efficient: Revitalizing Ball-Tree for Point-to-Hyperplane Nearest Neighbor Search
- Blog: Fast Approximations and Coresets for (k, l)-Median under Dynamic Time Warping
- Blog: On the Complexity of Inner Product Similarity Join
- Blog: Compact location problems with budget and communication constraints
- Blog: Locality-sensitive hashing of curves
- Blog: Nonlinear Estimators and Tail Bounds for Dimension Reduction in $l_1$ Using Cauchy Random Projections
- Blog: DIMS: Distributed Index for Similarity Search in Metric Spaces
- Blog: Towards Robust Trajectory Embedding for Similarity Computation: When Triangle Inequality Violations in Distance Metrics Matter
- Blog: Bregman Divergences and Triangle Inequality
- Blog: Graph Neural Distance Metric Learning with Graph-Bert
- Blog: A family of tractable graph metrics
- Blog: Fast Online k-nn Graph Building
Showing 60 of 363 papers.
History & citation
Current · Permanent link
- Proximity Graphs for Maximum Inner Product Search merged into this direction (67% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_triangle_inequality_violation_non_metric_0c4d6e76,
title = {triangle inequality violation (non-metric similarity search)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/triangle-inequality-violation-non-metric-similarity-search/rdr_0c4d6e76d7394701b42549aed42a6d60},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 2, frozen text):
@misc{lacuna_triangle_inequality_violation_non_metric_0c4d6e76_v2,
title = {triangle inequality violation (non-metric similarity search)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/triangle-inequality-violation-non-metric-similarity-search/rdr_0c4d6e76d7394701b42549aed42a6d60/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-20},
}