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

Class AbstractMTreeSplit<E extends MTreeEntry,N extends AbstractMTreeNode<?,N,E>>

java.lang.Object

elki.index.tree.metrical.mtreevariants.strategies.split.AbstractMTreeSplit<E,N>

Type Parameters:

E - the type of MTreeEntry used in the M-Tree

N - the type of AbstractMTreeNode used in the M-Tree

All Implemented Interfaces:

MTreeSplit<E,N>

Direct Known Subclasses:

FarthestPointsSplit, MLBDistSplit, MMRadSplit, MRadSplit, RandomSplit

public abstract class AbstractMTreeSplit<E extends MTreeEntry,N extends AbstractMTreeNode<?,N,E>>
extends java.lang.Object
implements MTreeSplit<E,N>

Abstract super class for splitting a node in an M-Tree.

Since:

0.1

Author:

Elke Achtert

Field Summary

Fields

Modifier and Type	Field	Description
protected DistributionStrategy	distributor	Entry distribution strategy.

Constructor Summary

Constructors

Constructor	Description
AbstractMTreeSplit(DistributionStrategy distributor)	Constructor.

Method Summary

Modifier and Type	Method	Description
protected static <E extends MTreeEntry,N extends AbstractMTreeNode<?,N,E>> double[][]	computeDistanceMatrix(AbstractMTree<?,N,E,?> tree, N node)	Compute the pairwise distances in the given node.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface elki.index.tree.metrical.mtreevariants.strategies.split.MTreeSplit

split

Field Detail

distributor

protected DistributionStrategy distributor

Entry distribution strategy.

Constructor Detail

AbstractMTreeSplit

public AbstractMTreeSplit(DistributionStrategy distributor)

Constructor.

Parameters:

distributor - Entry distribution strategy

Method Detail

computeDistanceMatrix

protected static <E extends MTreeEntry,N extends AbstractMTreeNode<?,N,E>> double[][] computeDistanceMatrix(AbstractMTree<?,N,E,?> tree,
                                                                                                                              N node)

Compute the pairwise distances in the given node.

Parameters:

tree - Tree

node - Node

Returns:

Distance matrix