基于图的最近邻搜索:承诺与失败
Graph based Nearest Neighbor Search: Promises and Failures
摘要:
近年来,基于图的最近邻搜索在大规模检索任务中得到越来越多的应用。这种类型的方法的吸引力在于其优越的性能超过大多数已知的最近邻搜索方法,以及其通用性的各种指标。在本文中,两个战略的作用,即层次结构和图多样化的关键步骤,采用基于图的方法,进行了研究。我们发现,层次结构不能实现“更好的对数复杂度缩放”,因为它是声称在原来的文件,特别是在高维的情况下。此外,我们发现,类似的高搜索速度的效率与层次结构的支持下,平面k-NN图后,图多样化。最后,我们指出了困难,这是所面临的大多数基于图的搜索方法,是直接联系到“维数灾难”。
英文摘要:
Recently, graph based nearest neighbor search gets more and more popular on large-scale retrieval tasks. The attractiveness of this type of approaches lies in its superior performance over most of the known nearest neighbor search approaches as well as its genericness to various metrics. In this paper, the role of two strategies, namely hierarchical structure and graph diversification that are adopted as the key steps in the graph based approaches, is investigated. We find the hierarchical structure could not achieve "much better logarithmic complexity scaling" as it was claimed in the original paper, particularly on high dimensional cases. Moreover, we find that similar high search speed efficiency as the one with hierarchical structure could be achieved with the support of flat k-NN graph after graph diversification. Finally, we point out the difficulty, that is faced by most of the graph based search approaches, is directly linked to "curse of dimensionality".
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。