ITU

ANN-Benchmarks: A Benchmarking Tool for Approximate Nearest Neighbor Algorithms

Research output: Conference Article in Proceeding or Book/Report chapterArticle in proceedingsResearchpeer-review

View graph of relations

This paper describes ANN-Benchmarks, a tool for evaluating the performance of in-memory approximate nearest neighbor algorithms. It provides a standard interface for measuring the performance and quality achieved by nearest neighbor algorithms on different standard data sets. It supports several different ways of integrating k-NN algorithms, and its configuration system automatically tests a range of parameter settings for each algorithm. Algorithms are compared with respect to many different (approximate) quality measures, and adding more is easy and fast; the included plotting front-ends can visualise these as images, Open image in new window plots, and websites with interactive plots. ANN-Benchmarks aims to provide a constantly updated overview of the current state of the art of k-NN algorithms. In the short term, this overview allows users to choose the correct k-NN algorithm and parameters for their similarity search task; in the longer term, algorithm designers will be able to use this overview to test and refine automatic parameter tuning. The paper gives an overview of the system, evaluates the results of the benchmark, and points out directions for future work. Interestingly, very different approaches to k-NN search yield comparable quality-performance trade-offs. The system is available at http://sss.projects.itu.dk/ann-benchmarks/
Original languageEnglish
Title of host publicationInternational Conference on Similarity Search and Applications : SISAP 2017: Similarity Search and Applications
PublisherSpringer
Publication date2017
Pages34-49
ISBN (Print)978-3-319-68473-4
ISBN (Electronic)978-3-319-68474-1
DOIs
Publication statusPublished - 2017
SeriesLecture Notes in Computer Science
Volume10609
ISSN0302-9743

Downloads

No data available

ID: 82348093