smile.clustering
Class GMeans
- java.lang.Object
-
- smile.clustering.PartitionClustering<double[]>
-
- smile.clustering.KMeans
-
- smile.clustering.GMeans
-
- All Implemented Interfaces:
- java.io.Serializable, Clustering<double[]>
public class GMeans extends KMeans implements java.io.Serializable
G-Means clustering algorithm, an extended K-Means which tries to automatically determine the number of clusters by normality test. The G-means algorithm is based on a statistical test for the hypothesis that a subset of data follows a Gaussian distribution. G-means runs k-means with increasing k in a hierarchical fashion until the test accepts the hypothesis that the data assigned to each k-means center are Gaussian.References
- G. Hamerly and C. Elkan. Learning the k in k-means. NIPS, 2003.
- See Also:
KMeans,XMeans, Serialized Form
-
-
Field Summary
-
Fields inherited from interface smile.clustering.Clustering
OUTLIER
-
-
Constructor Summary
Constructors Constructor and Description GMeans(double[][] data, int kmax)Constructor.
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method and Description java.lang.StringtoString()-
Methods inherited from class smile.clustering.KMeans
centroids, distortion, lloyd, lloyd, lloyd, predict
-
Methods inherited from class smile.clustering.PartitionClustering
getClusterLabel, getClusterSize, getNumClusters, seed, seed
-
-
DataMelt 3.0 © DataMelt by jWork.ORG