Package de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.strategies.split

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

See: Description

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.
AbstractMTreeSplit.Parameterizer<E extends MTreeEntry,N extends AbstractMTreeNode<?,N,E>>	Parameterization class
FarthestPointsSplit<E extends MTreeEntry,N extends AbstractMTreeNode<?,N,E>>	Farthest points split.
FarthestPointsSplit.Parameterizer<E extends MTreeEntry,N extends AbstractMTreeNode<?,N,E>>	Parameterization class.
MLBDistSplit<E extends MTreeEntry,N extends AbstractMTreeNode<?,N,E>>	Encapsulates the required methods for a split of a node in an M-Tree.
MLBDistSplit.Parameterizer<E extends MTreeEntry,N extends AbstractMTreeNode<?,N,E>>	Parameterization class.
MMRadSplit<E extends MTreeEntry,N extends AbstractMTreeNode<?,N,E>>	Encapsulates the required methods for a split of a node in an M-Tree.
MMRadSplit.Parameterizer<E extends MTreeEntry,N extends AbstractMTreeNode<?,N,E>>	Parameterization class.
MRadSplit<E extends MTreeEntry,N extends AbstractMTreeNode<?,N,E>>	Encapsulates the required methods for a split of a node in an M-Tree.
MRadSplit.Parameterizer<E extends MTreeEntry,N extends AbstractMTreeNode<?,N,E>>	Parameterization class.
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.
RandomSplit.Parameterizer<E extends MTreeEntry,N extends AbstractMTreeNode<?,N,E>>	Parameterization class.

Package de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.strategies.split Description

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