Description Usage Arguments Details Value References Examples
A fast procedure for Expectation-Maximization clustering.
1 2 3 |
dat |
Input data: can be a table or a data frame (but the data frame must have only two columns). |
k |
Numeric specification of the number of latent classes to compute. |
tol |
Numeric specification of the convergence criterion. |
This function assumes that the rows of a frequency table come from a multinomial distribution. The prior probabilities of
the latent classes are initialized with a Dirichlet distribution (by means of rdirichlet
from the package gtools) with
alpha =
the total frequency counts of every level.
A list with components:
|
The probabilities of the latent classes. |
|
The probabilities for the first set of levels (viz. the row levels of a frequency table). The rows of |
|
The probabilities for the second set of levels (viz. the column levels of a frequency table). The rows of |
Dempster, A. P., N. M. Laird and D. B. Rubin (1977) Maximum likelihood from incomplete data via the EM algorithm. Journal of the royal statistical society, series B 39 (1), 1–38.
1 2 3 4 5 | SndT_Fra <- read.table(system.file("extdata", "SndT_Fra.txt", package = "svs"),
header = TRUE, sep = "\t", quote = "\"", encoding = "UTF-8",
stringsAsFactors = FALSE)
E_M.SndT_Fra <- fast_E_M(SndT_Fra, k = 7)
E_M.SndT_Fra
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.