Package kieker.analysis.generic.clustering.mtree

Copyright 2022 Kieker Project (http://kieker-monitoring.net) Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.

Interface Summary

Interface	Description
DistanceFunctionFactory.IEuclideanCoordinate	An interface to represent coordinates in Euclidean spaces.
IDistanceFunction<T>	An object that can calculate the distance between two data objects.
ILeafness<DATA>
IPartitionFunction<T>	An object with partitions a set of data into two sub-sets.
IPromotionFunction<T>	An object that chooses a pair from a set of data objects.
IRootness
ISplitFunction<T>	Defines an object to be used to split a node in an M-Tree.

Class Summary

Class	Description
BalancedPartitionFunction<T>	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.
ComposedSplitFunction<T>	A split function that is defined by composing a promotion function and a partition function.
DistanceFunctionFactory	Some pre-defined implementations of distance functions.
ISplitFunction.SplitResult<R>	An object used as the result for the ISplitFunction.process(Set, IDistanceFunction) method.
MTree<T>	The main class that implements the M-Tree.
MTreeGeneratorStage<T>	A stage to generate an M-Tree with objects of a generic type, with a given distance function.
RandomPromotionFunction<T>	A promotion function object that randomly chooses ("promotes") two data objects.
TrimmedAlgorithm<T>	An implementation of the trimmed algorithm.