Package | Description |
---|---|
de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants |
M-Tree and variants
|
de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.strategies.split |
Splitting strategies of nodes in an M-Tree (and variants)
|
Modifier and Type | Field and Description |
---|---|
protected MTreeSplit<E,N> |
MTreeSettings.splitStrategy
Splitting strategy.
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractMTreeSplit<E extends MTreeEntry,N extends AbstractMTreeNode<?,N,E>>
Abstract super class for splitting a node in an M-Tree.
|
class |
FarthestPointsSplit<E extends MTreeEntry,N extends AbstractMTreeNode<?,N,E>>
Farthest points split.
|
class |
MLBDistSplit<E extends MTreeEntry,N extends AbstractMTreeNode<?,N,E>>
Encapsulates the required methods for a split of a node in an M-Tree.
|
class |
MMRadSplit<E extends MTreeEntry,N extends AbstractMTreeNode<?,N,E>>
Encapsulates the required methods for a split of a node in an M-Tree.
|
class |
MRadSplit<E extends MTreeEntry,N extends AbstractMTreeNode<?,N,E>>
Encapsulates the required methods for a split of a node in an M-Tree.
|
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.
|
class |
RandomSplit<E extends MTreeEntry,N extends AbstractMTreeNode<?,N,E>>
Encapsulates the required methods for a split of a node in an M-Tree.
|
Modifier and Type | Method and Description |
---|---|
protected abstract MTreeSplit<E,N> |
AbstractMTreeSplit.Parameterizer.makeInstance() |
Copyright © 2019 ELKI Development Team. License information.