| Interface | Description |
|---|---|
| DistanceFunction<DATA> |
An object that can calculate the distance between two data objects.
|
| DistanceFunctions.EuclideanCoordinate |
An interface to represent coordinates in Euclidean spaces.
|
| PartitionFunction<DATA> |
An object with partitions a set of data into two sub-sets.
|
| PromotionFunction<DATA> |
An object that chooses a pair from a set of data objects.
|
| SplitFunction<DATA> |
Defines an object to be used to split a node in an M-Tree.
|
| Class | Description |
|---|---|
| ComposedSplitFunction<DATA> | |
| DistanceFunctions |
Some pre-defined implementations of distance
functions.
|
| MTree<DATA> |
The main class that implements the M-Tree.
|
| PartitionFunctions |
Some pre-defined implementations of partition
functions.
|
| PartitionFunctions.BalancedPartition<DATA> |
A partition function that tries to
distribute the data objects equally between the promoted data objects,
associating to each promoted data objects the nearest data objects.
|
| PromotionFunctions |
Some pre-defined implementations of promotion
functions.
|
| PromotionFunctions.RandomPromotion<DATA> |
A promotion function object that randomly
chooses ("promotes") two data objects.
|
| SplitFunction.SplitResult<DATA> |
An object used as the result for the
SplitFunction.process(Set, DistanceFunction) method. |
Copyright © 2014 University of Waikato, Hamilton, NZ. All Rights Reserved.