:: Experimental ::
:: Experimental :: Model fitted by BisectingKMeans.
:: Experimental :: Model fitted by BisectingKMeans.
:: Experimental ::
:: Experimental ::
Distributed model fitted by LDA. This type of model is currently only produced by Expectation-Maximization (EM).
This model stores the inferred topics, the full training dataset, and the topic distribution for each training document.
:: Experimental :: Gaussian Mixture clustering.
:: Experimental :: Gaussian Mixture clustering.
:: Experimental ::
:: Experimental ::
Multivariate Gaussian Mixture Model (GMM) consisting of k Gaussians, where points are drawn from each Gaussian i with probability weights(i).
:: Experimental :: Summary of GaussianMixture.
:: Experimental :: Summary of GaussianMixture.
:: Experimental :: K-means clustering with support for k-means|| initialization proposed by Bahmani et al.
:: Experimental :: K-means clustering with support for k-means|| initialization proposed by Bahmani et al.
:: Experimental :: Model fitted by KMeans.
:: Experimental :: Model fitted by KMeans.
:: Experimental :: Summary of KMeans.
:: Experimental :: Summary of KMeans.
:: Experimental ::
:: Experimental ::
Latent Dirichlet Allocation (LDA), a topic model designed for text documents.
Terminology:
Original LDA paper (journal version): Blei, Ng, and Jordan. "Latent Dirichlet Allocation." JMLR, 2003.
Input data (featuresCol): LDA is given a collection of documents as input data, via the featuresCol parameter. Each document is specified as a Vector of length vocabSize, where each entry is the count for the corresponding term (word) in the document. Feature transformers such as org.apache.spark.ml.feature.Tokenizer and org.apache.spark.ml.feature.CountVectorizer can be useful for converting text to word count vectors.
:: Experimental :: Model fitted by LDA.
:: Experimental :: Model fitted by LDA.
:: Experimental ::
:: Experimental ::
Local (non-distributed) model fitted by LDA.
This model stores the inferred topics only; it does not store info about the training dataset.
:: Experimental ::
A bisecting k-means algorithm based on the paper "A comparison of document clustering techniques" by Steinbach, Karypis, and Kumar, with modification to fit Spark. The algorithm starts from a single cluster that contains all points. Iteratively it finds divisible clusters on the bottom level and bisects each of them using k-means, until there are
k
leaf clusters in total or no leaf clusters are divisible. The bisecting steps of clusters on the same level are grouped together to increase parallelism. If bisecting all divisible clusters on the bottom level would result more thank
leaf clusters, larger clusters get higher priority.Steinbach, Karypis, and Kumar, A comparison of document clustering techniques, KDD Workshop on Text Mining, 2000.