Uses of Class
elki.clustering.kmeans.AbstractKMeans
-
Packages that use AbstractKMeans Package Description elki.clustering.kmeans K-means clustering and variations.elki.clustering.kmeans.parallel Parallelized implementations of k-means.elki.clustering.kmeans.spherical Spherical k-means clustering and variations.tutorial.clustering Classes from the tutorial on implementing a custom k-means variation. -
-
Uses of AbstractKMeans in elki.clustering.kmeans
Subclasses of AbstractKMeans in elki.clustering.kmeans Modifier and Type Class Description classAnnulusKMeans<V extends NumberVector>Annulus k-means algorithm.classBetulaLloydKMeansBIRCH/BETULA-based clustering algorithm that simply treats the leafs of the CFTree as clusters.classCompareMeans<V extends NumberVector>Compare-Means: Accelerated k-means by exploiting the triangle inequality and pairwise distances of means to prune candidate means.classElkanKMeans<V extends NumberVector>Elkan's fast k-means by exploiting the triangle inequality.classExponionKMeans<V extends NumberVector>Newlings's Exponion k-means algorithm, exploiting the triangle inequality.classGMeans<V extends NumberVector,M extends MeanModel>G-Means extends K-Means and estimates the number of centers with Anderson Darling Test.
Implemented as specialization of XMeans.classHamerlyKMeans<V extends NumberVector>Hamerly's fast k-means by exploiting the triangle inequality.classHartiganWongKMeans<V extends NumberVector>Hartigan and Wong k-means clustering.classKDTreeFilteringKMeans<V extends NumberVector>Filtering or "blacklisting" K-means with k-d-tree acceleration.classKDTreePruningKMeans<V extends NumberVector>Pruning K-means with k-d-tree acceleration.classKMeansMinusMinus<V extends NumberVector>k-means--: A Unified Approach to Clustering and Outlier Detection.classKMediansLloyd<V extends NumberVector>k-medians clustering algorithm, but using Lloyd-style bulk iterations instead of the more complicated approach suggested by Kaufman and Rousseeuw (seePAMinstead).classLloydKMeans<V extends NumberVector>The standard k-means algorithm, using bulk iterations and commonly attributed to Lloyd and Forgy (independently).classMacQueenKMeans<V extends NumberVector>The original k-means algorithm, using MacQueen style incremental updates; making this effectively an "online" (streaming) algorithm.classShallotKMeans<V extends NumberVector>Borgelt's Shallot k-means algorithm, exploiting the triangle inequality.classSimplifiedElkanKMeans<V extends NumberVector>Simplified version of Elkan's k-means by exploiting the triangle inequality.classSingleAssignmentKMeans<V extends NumberVector>Pseudo-k-means variations, that assigns each object to the nearest center.classSortMeans<V extends NumberVector>Sort-Means: Accelerated k-means by exploiting the triangle inequality and pairwise distances of means to prune candidate means (with sorting).classXMeans<V extends NumberVector,M extends MeanModel>X-means: Extending K-means with Efficient Estimation on the Number of Clusters.classYinYangKMeans<V extends NumberVector>Yin-Yang k-Means Clustering.Methods in elki.clustering.kmeans that return AbstractKMeans Modifier and Type Method Description abstract AbstractKMeans<V,?>AbstractKMeans.Par. make() -
Uses of AbstractKMeans in elki.clustering.kmeans.parallel
Subclasses of AbstractKMeans in elki.clustering.kmeans.parallel Modifier and Type Class Description classParallelLloydKMeans<V extends NumberVector>Parallel implementation of k-Means clustering. -
Uses of AbstractKMeans in elki.clustering.kmeans.spherical
Subclasses of AbstractKMeans in elki.clustering.kmeans.spherical Modifier and Type Class Description classEuclideanSphericalElkanKMeans<V extends NumberVector>Elkan's fast k-means by exploiting the triangle inequality in the corresponding Euclidean space.classEuclideanSphericalHamerlyKMeans<V extends NumberVector>A spherical k-Means algorithm based on Hamerly's fast k-means by exploiting the triangle inequality in the corresponding Euclidean space.classEuclideanSphericalSimplifiedElkanKMeans<V extends NumberVector>A spherical k-Means algorithm based on Hamerly's fast k-means by exploiting the triangle inequality in the corresponding Euclidean space.classSphericalElkanKMeans<V extends NumberVector>Elkan's fast k-means by exploiting the triangle inequality.classSphericalHamerlyKMeans<V extends NumberVector>A spherical k-Means algorithm based on Hamerly's fast k-means by exploiting the triangle inequality.classSphericalKMeans<V extends NumberVector>The standard spherical k-means algorithm.classSphericalSimplifiedElkanKMeans<V extends NumberVector>A spherical k-Means algorithm based on Hamerly's fast k-means by exploiting the triangle inequality.classSphericalSimplifiedHamerlyKMeans<V extends NumberVector>A spherical k-Means algorithm based on Hamerly's fast k-means by exploiting the triangle inequality.classSphericalSingleAssignmentKMeans<V extends NumberVector>Pseudo-k-Means variations, that assigns each object to the nearest center. -
Uses of AbstractKMeans in tutorial.clustering
Subclasses of AbstractKMeans in tutorial.clustering Modifier and Type Class Description classSameSizeKMeans<V extends NumberVector>K-means variation that produces equally sized clusters.
-