Package | Description |
---|---|
de.lmu.ifi.dbs.elki.algorithm.clustering.kmeans |
K-means clustering and variations
|
de.lmu.ifi.dbs.elki.algorithm.clustering.kmeans.initialization |
Initialization strategies for k-means.
|
de.lmu.ifi.dbs.elki.algorithm.clustering.kmeans.parallel |
Parallelized implementations of k-means.
|
de.lmu.ifi.dbs.elki.algorithm.clustering.uncertain |
Clustering algorithms for uncertain data.
|
de.lmu.ifi.dbs.elki.algorithm.outlier.clustering |
Clustering based outlier detection.
|
tutorial.clustering |
Classes from the tutorial on implementing a custom k-means variation
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractKMeans<V extends NumberVector,M extends Model>
Abstract base class for k-means implementations.
|
class |
BestOfMultipleKMeans<V extends NumberVector,M extends MeanModel>
Run K-Means multiple times, and keep the best run.
|
class |
KMeansAnnulus<V extends NumberVector>
Annulus k-means algorithm.
|
class |
KMeansBisecting<V extends NumberVector,M extends MeanModel>
The bisecting k-means algorithm works by starting with an initial
partitioning into two clusters, then repeated splitting of the largest
cluster to get additional clusters.
|
class |
KMeansCompare<V extends NumberVector>
Compare-Means: Accelerated k-means by exploiting the triangle inequality and
pairwise distances of means to prune candidate means.
|
class |
KMeansElkan<V extends NumberVector>
Elkan's fast k-means by exploiting the triangle inequality.
|
class |
KMeansExponion<V extends NumberVector>
Newlings's exponion k-means algorithm, exploiting the triangle inequality.
|
class |
KMeansHamerly<V extends NumberVector>
Hamerly's fast k-means by exploiting the triangle inequality.
|
class |
KMeansLloyd<V extends NumberVector>
The standard k-means algorithm, using bulk iterations and commonly attributed
to Lloyd and Forgy (independently).
|
class |
KMeansMacQueen<V extends NumberVector>
The original k-means algorithm, using MacQueen style incremental updates;
making this effectively an "online" (streaming) algorithm.
|
class |
KMeansMinusMinus<V extends NumberVector>
k-means--: A Unified Approach to Clustering and Outlier Detection.
|
class |
KMeansSimplifiedElkan<V extends NumberVector>
Simplified version of Elkan's k-means by exploiting the triangle inequality.
|
class |
KMeansSort<V extends NumberVector>
Sort-Means: Accelerated k-means by exploiting the triangle inequality and
pairwise distances of means to prune candidate means (with sorting).
|
class |
KMediansLloyd<V extends NumberVector>
k-medians clustering algorithm, but using Lloyd-style bulk iterations instead
of the more complicated approach suggested by Kaufman and Rousseeuw (see
KMedoidsPAM instead). |
class |
SingleAssignmentKMeans<V extends NumberVector>
Pseudo-k-Means variations, that assigns each object to the nearest center.
|
class |
XMeans<V extends NumberVector,M extends MeanModel>
X-means: Extending K-means with Efficient Estimation on the Number of
Clusters.
|
Modifier and Type | Field and Description |
---|---|
private KMeans<V,M> |
BestOfMultipleKMeans.innerkMeans
Variant of kMeans for the bisecting step.
|
private KMeans<V,M> |
KMeansBisecting.innerkMeans
Variant of kMeans for the bisecting step.
|
private KMeans<V,M> |
XMeans.innerKMeans
Inner k-means algorithm.
|
protected KMeans<V,M> |
XMeans.Parameterizer.innerKMeans
Variant of kMeans
|
protected KMeans<V,M> |
BestOfMultipleKMeans.Parameterizer.kMeansVariant
Variant of kMeans to use.
|
protected KMeans<V,M> |
KMeansBisecting.Parameterizer.kMeansVariant
Variant of kMeans
|
Constructor and Description |
---|
BestOfMultipleKMeans(int trials,
KMeans<V,M> innerkMeans,
KMeansQualityMeasure<? super V> qualityMeasure)
Constructor.
|
KMeansBisecting(int k,
KMeans<V,M> innerkMeans)
Constructor.
|
XMeans(NumberVectorDistanceFunction<? super V> distanceFunction,
int k_min,
int k_max,
int maxiter,
KMeans<V,M> innerKMeans,
KMeansInitialization initializer,
KMeansQualityMeasure<V> informationCriterion,
RandomFactory random)
Constructor.
|
Modifier and Type | Field and Description |
---|---|
private KMeans<V,?> |
SampleKMeansInitialization.innerkMeans
Variant of kMeans to use for initialization.
|
protected KMeans<V,?> |
SampleKMeansInitialization.Parameterizer.innerkMeans
Inner k-means algorithm to use.
|
Constructor and Description |
---|
SampleKMeansInitialization(RandomFactory rnd,
KMeans<V,?> innerkMeans,
double rate)
Constructor.
|
Modifier and Type | Class and Description |
---|---|
class |
ParallelLloydKMeans<V extends NumberVector>
Parallel implementation of k-Means clustering.
|
Modifier and Type | Field and Description |
---|---|
private KMeans<?,KMeansModel> |
CKMeans.Parameterizer.kmeans
K-means instance to use.
|
Constructor and Description |
---|
CKMeans(KMeans<?,KMeansModel> kmeans)
Constructor that uses an arbitrary k-means algorithm.
|
Modifier and Type | Field and Description |
---|---|
(package private) KMeans<O,?> |
KMeansOutlierDetection.clusterer
Clustering algorithm to use
|
(package private) KMeans<O,?> |
KMeansOutlierDetection.Parameterizer.clusterer
Clustering algorithm to use
|
Constructor and Description |
---|
KMeansOutlierDetection(KMeans<O,?> clusterer)
Constructor.
|
Modifier and Type | Class and Description |
---|---|
class |
SameSizeKMeansAlgorithm<V extends NumberVector>
K-means variation that produces equally sized clusters.
|
Copyright © 2019 ELKI Development Team. License information.