Uses of Interface
kieker.analysis.generic.clustering.mtree.IDistanceFunction
Package | Description |
---|---|
kieker.analysis.generic.clustering |
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.
|
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.
|
kieker.analysis.generic.graph.clustering |
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.
|
-
Uses of IDistanceFunction in kieker.analysis.generic.clustering
Constructors in kieker.analysis.generic.clustering with parameters of type IDistanceFunction Constructor Description MedoidGenerator(IDistanceFunction<T> distanceFunction)
NaiveMedoidGenerator(IDistanceFunction<T> distanceFunction)
-
Uses of IDistanceFunction in kieker.analysis.generic.clustering.mtree
Fields in kieker.analysis.generic.clustering.mtree declared as IDistanceFunction Modifier and Type Field Description static IDistanceFunction<DistanceFunctionFactory.IEuclideanCoordinate>
DistanceFunctionFactory. EUCLIDEAN
A distance function object that calculates the distance between two euclidean coordinates.static IDistanceFunction<java.util.List<java.lang.Double>>
DistanceFunctionFactory. EUCLIDEAN_DOUBLE_LIST
A distance function object that calculates the distance between two coordinates represented by lists ofDouble
s.static IDistanceFunction<java.util.List<java.lang.Integer>>
DistanceFunctionFactory. EUCLIDEAN_INTEGER_LIST
A distance function object that calculates the distance between two coordinates represented by lists ofInteger
s.Methods in kieker.analysis.generic.clustering.mtree that return IDistanceFunction Modifier and Type Method Description static <D> IDistanceFunction<D>
DistanceFunctionFactory. cached(IDistanceFunction<D> distanceFunction)
Creates a cached version of a distance function.IDistanceFunction<? super T>
MTree. getDistanceFunction()
Methods in kieker.analysis.generic.clustering.mtree with parameters of type IDistanceFunction Modifier and Type Method Description static <D> IDistanceFunction<D>
DistanceFunctionFactory. cached(IDistanceFunction<D> distanceFunction)
Creates a cached version of a distance function.Pair<java.util.Set<T>>
BalancedPartitionFunction. process(Pair<T> promoted, java.util.Set<T> dataSet, IDistanceFunction<? super T> distanceFunction)
Processes the balanced partition.ISplitFunction.SplitResult<T>
ComposedSplitFunction. process(java.util.Set<T> dataSet, IDistanceFunction<? super T> distanceFunction)
Pair<java.util.Set<T>>
IPartitionFunction. process(Pair<T> promoted, java.util.Set<T> dataSet, IDistanceFunction<? super T> distanceFunction)
Executes the partitioning.Pair<T>
IPromotionFunction. process(java.util.Set<T> dataSet, IDistanceFunction<? super T> distanceFunction)
Chooses (promotes) a pair of objects according to some criteria that is suitable for the application using the M-Tree.ISplitFunction.SplitResult<T>
ISplitFunction. process(java.util.Set<T> dataSet, IDistanceFunction<? super T> distanceFunction)
Processes the splitting of a node.Pair<T>
RandomPromotionFunction. process(java.util.Set<T> dataSet, IDistanceFunction<? super T> distanceFunction)
Constructors in kieker.analysis.generic.clustering.mtree with parameters of type IDistanceFunction Constructor Description MTree(int minNodeCapacity, int maxNodeCapacity, IDistanceFunction<? super T> distanceFunction, ISplitFunction<T> existingSplitFunction)
Constructs an M-Tree with the specified minimum and maximum node capacities and distance function.MTree(int minNodeCapacity, IDistanceFunction<? super T> distanceFunction, ISplitFunction<T> splitFunction)
Constructs an M-Tree with the specified minimum node capacity and distance function.MTree(IDistanceFunction<? super T> distanceFunction, ISplitFunction<T> splitFunction)
Constructs an M-Tree with the specified distance function.MTreeGeneratorStage(IDistanceFunction<T> distanceFunction)
MTreeGeneratorStage(IDistanceFunction<T> distanceFunction, int minNodeCapacity, int maxNodeCapacity)
TrimmedAlgorithm(T[] models, IDistanceFunction<T> distanceFunction)
-
Uses of IDistanceFunction in kieker.analysis.generic.graph.clustering
Classes in kieker.analysis.generic.graph.clustering that implement IDistanceFunction Modifier and Type Class Description class
GraphEditDistance<N extends INode,E extends IEdge>
This class calculates a custom graph edit distance between two Behavior Models.class
OPTICSDataGED<T>
Constructors in kieker.analysis.generic.graph.clustering with parameters of type IDistanceFunction Constructor Description OPTICSDataGED(IDistanceFunction<T> distanceFunction)