This paper reconsiders common benchmarking approaches to nearest neighbor search. It is shown that the concept of local intrinsic dimensionality (LID) allows to choose query sets of a wide range of difficulty for real-world datasets. Moreover, the effect of different LID distributions on the running time performance of implementations is empirically studied. To this end, different visualization concepts are introduced that allow to get a more fine-grained overview of the inner workings of nearest neighbor search principles. The paper closes with remarks about the diversity of datasets commonly used for nearest neighbor search benchmarking. It is shown that such real-world datasets are not diverse: results on a single dataset predict results on all other datasets well.
Title of host publication
International Conference on Similarity Search and Applications : SISAP 2019: Similarity Search and Applications
This page is printed from https://en.itu.dk/research/portalplaceholder?layoutfraction=top&langRef=https://pure.itu.dk/portal/da/persons-research/search.html?pagesize=25&page=0&lastname=a&lastname=k&lastname=x&lastname=b&lastname=u&lastname=p&lastname=j&lastname=p&lastname=d&lastname=f&lastname=k&lastname=x