Package de.lmu.ifi.dbs.elki.algorithm.benchmark

Benchmarking pseudo algorithms.

See: Description

Class Summary

Class	Description
KNNBenchmarkAlgorithm<O,D extends Distance<D>>	Benchmarking algorithm that computes the k nearest neighbors for each query point.
KNNBenchmarkAlgorithm.Parameterizer<O,D extends Distance<D>>	Parameterization class
RangeQueryBenchmarkAlgorithm<O extends NumberVector<?>,D extends NumberDistance<D,?>>	Benchmarking algorithm that computes a range query for each point.
RangeQueryBenchmarkAlgorithm.Parameterizer<O extends NumberVector<?>,D extends NumberDistance<D,?>>	Parameterization class
ValidateApproximativeKNNIndex<O,D extends Distance<D>>	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).
ValidateApproximativeKNNIndex.Parameterizer<O,D extends Distance<D>>	Parameterization class

Package de.lmu.ifi.dbs.elki.algorithm.benchmark Description

Benchmarking pseudo algorithms.

The algorithms in this package are meant to be used in run time benchmarks, to evalute e.g. the performance of an index structure.