Accurate And Fast Retrieval For Complex Non-Metric Data Via Neighborhood Graphs
SIMILARITY SEARCH AND APPLICATIONS (SISAP 2019)(2019)
摘要
We demonstrate that a graph-based search algorithmrelying on the construction of an approximate neighborhood graph-can directly work with challenging non-metric and/or non-symmetric distances without resorting to metric-space mapping and/or distance symmetrization, which, in turn, lead to substantial performance degradation. Although the straightforward metrization and symmetrization is usually ineffective, we find that constructing an index using a modified, e.g., symmetrized, distance can improve performance. This observation paves a way to a new line of research of designing index-specific graph-construction distance functions.
更多查看译文
关键词
k-NN search, Non-metric distance, Neighborhood graph
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络