Package com.rapidminer.tools.math.container

This package consists some additional containers fulfilling some mathematical properties which could, for example, help to speed up searches.

See:
Description

Interface Summary

GeometricDataCollection<T extends Serializable>

This interface provides the methods for multidimensional data structures providing efficient search in data space for the next k neighbors and its distances, or the next neighbors in a specified distance.

Class Summary

BallTree<T extends Serializable>	This class is an implementation of a Ball-Tree for organizing multidimensional datapoints in a fashion supporting the search for nearest neighbours.
BallTreeNode<T>	The node for a ball tree.
BoundedPriorityQueue<E>	This class implements a bounded priority queue which contains always the n-th smalles values.
KDTree<T extends Serializable>	This class is an implementation of a KD-Tree for organizing multidimensional datapoints in a fashion supporting the search for nearest neighbours.
KDTreeNode<T>	The node for a KD tree.
LinearList<T extends Serializable>	This class is an implementation of the GeometricDataCollection interface, which searches all datapoints linearly for the next k neighbours.
ReverseComparableComparator<E>	This comparator reverses the sort direction for a given comparator.
ReverseComparator<F>	This comparator reverses the sort direction for a given comparator.

Package com.rapidminer.tools.math.container Description

This package consists some additional containers fulfilling some mathematical properties which could, for example, help to speed up searches.