Package elki.index.tree.metrical.mtreevariants.strategies.split

Splitting strategies of nodes in an M-tree (and variants).

Interface Summary

Interface	Description
MTreeSplit<E extends MTreeEntry,N extends AbstractMTreeNode<?,N,E>>	Interface for M-tree splitting strategies.

Class Summary

Class	Description
AbstractMTreeSplit<E extends MTreeEntry,N extends AbstractMTreeNode<?,N,E>>	Abstract super class for splitting a node in an M-Tree.
FarthestPointsSplit<E extends MTreeEntry,N extends AbstractMTreeNode<?,N,E>>	Farthest points split.
MLBDistSplit<E extends MTreeEntry,N extends AbstractMTreeNode<?,N,E>>	Encapsulates the required methods for a split of a node in an M-Tree.
MMRadSplit<E extends MTreeEntry,N extends AbstractMTreeNode<?,N,E>>	Encapsulates the required methods for a split of a node in an M-Tree.
MRadSplit<E extends MTreeEntry,N extends AbstractMTreeNode<?,N,E>>	Encapsulates the required methods for a split of a node in an M-Tree.
MSTSplit<E extends MTreeEntry,N extends AbstractMTreeNode<?,N,E>>	Splitting algorithm using the minimum spanning tree (MST), as proposed by the Slim-Tree variant.
RandomSplit<E extends MTreeEntry,N extends AbstractMTreeNode<?,N,E>>	Encapsulates the required methods for a split of a node in an M-Tree.