Interface | Description |
---|---|
StripWeakCentroidsRunner.BreakStrategy<T> |
Class | Description |
---|---|
IterationCountCalculateRunner<T> |
Determine the number of iterations in the KMeans Parallel initialization step.
|
KMeansDistortionJobRunner |
Calculate the distortation.
|
KMeansIterationsJobRunner<T> |
Run 'K' means until convergence across ALL groups.
|
KMeansJobRunner |
Run 'K' means one time to move the centroids towards the mean.
|
KMeansJumpJobRunner |
The KMeans Jump algorithm
|
KMeansParallelJobRunner |
The KMeans Parallel algorithm,labeled Algorithm 2 within in section 3.3 of
|
KMeansSingleSampleJobRunner<T> | |
KSamplerJobRunner |
Samples 'K' number of data items by evaluating a
SamplingRankFunction |
RankSamplerJobRunner |
Sample K points given a sample function.
|
SampleMultipleSetsJobRunner<T> | |
StripWeakCentroidsRunner<T> |
Remove weak centers.
|
StripWeakCentroidsRunner.MaxChangeBreakStrategy<T> | |
StripWeakCentroidsRunner.StableChangeBreakStrategy<T> | |
StripWeakCentroidsRunner.TailMaxBreakStrategy<T> | |
StripWeakCentroidsRunner.TailStableChangeBreakStrategy<T> | |
UpdateCentroidCostJobRunner |
Update the centroid with its cost, measured by the average distance of assigned points.
|
Copyright © 2013–2022. All rights reserved.