Package elki.application.benchmark
Benchmarking pseudo algorithms.
The algorithms in this package are meant to be used in run time benchmarks, to evaluate, e.g., the performance of an index structure.
-
Class Summary Class Description KNNBenchmark<O> Benchmarking experiment that computes the k nearest neighbors for each query point.PrioritySearchBenchmark<O> Benchmarking experiment that computes the k nearest neighbors for each query point.RangeQueryBenchmark<O extends NumberVector> Benchmarking algorithm that computes a range query for each point.ValidateApproximativeKNNIndex<O> Algorithm to validate the quality of an approximative kNN index, by performing a number of queries and comparing them to the results obtained by exact indexing (e.g., linear scanning).