Package jsat.linear.vectorcollection

Interface Summary

Interface	Description
IncrementalCollection<V extends Vec>	This interface is for Vector Collections that support incremental construction.
VectorCollection<V extends Vec>	A Vector Collection is a collection of vectors that is meant to be used to obtain a subset of the collection via a query vector.
VectorCollectionFactory<V extends Vec>	A factory interface for the creation of VectorCollection objects.

Class Summary

Class	Description
CoverTree<V extends Vec>	This class implements the Cover-tree algorithm for answering nearest neighbor queries.
CoverTree.CoverTreeFactory<V extends Vec>
DefaultVectorCollectionFactory<V extends Vec>	DefaultVectorCollectionFactory is a generic factory that attempts to return a good vector collection for the given input.
EuclideanCollection<V extends Vec>	Provides a specialized collections that only supports the EuclideanDistance by brute force search.
EuclideanCollection.EuclideanCollectionFactory<V extends Vec>
KDTree<V extends Vec>	Standard KDTree implementation.
KDTree.KDTreeFactory<V extends Vec>
RandomBallCover<V extends Vec>	An implementation of the exact search for the Random Ball Cover algorithm.
RandomBallCover.RandomBallCoverFactory<V extends Vec>
RandomBallCoverOneShot<V extends Vec>	An implementation of the on shot search for the Random Ball Cover algorithm.
RandomBallCoverOneShot.RandomBallCoverOneShotFactory<V extends Vec>
RTree<V extends Vec>
RTree.RTreeFactory<V extends Vec>
VectorArray<V extends Vec>	This is the naive implementation of a Vector collection.
VectorArray.VectorArrayFactory<V extends Vec>
VectorCollectionUtils	A collection of common utility methods to perform on a VectorCollection
VPTree<V extends Vec>	Provides an implementation of Vantage Point Trees, as described in "Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces" by Peter N.
VPTree.VPTreeFactory<V extends Vec>
VPTreeMV<V extends Vec>	The VPTreeMV is an extension of the VPTree, the MV meaning "of Minimum Variance".
VPTreeMV.VPTreeMVFactory<V extends Vec>

Enum Summary

Enum	Description
KDTree.PivotSelection	KDTree uses an index of the vector at each stage to use as a pivot, dividing the remaining elements into two sets.
VPTree.VPSelection