cluster.bic

Compute the BIC of a single HMM given a threshold epsilon for counting
parameters. Auxiliary function used in <code>size.search</code>.

Provides an implementation of a mixture of hidden Markov models
(HMMs) for discrete sequence data in the Discrete Bayesian HMM Clustering
(DBHC) algorithm. The DBHC algorithm is an HMM Clustering
algorithm that finds a mixture of discrete-output HMMs while using
heuristics based on Bayesian Information Criterion (BIC) to search for the
optimal number of HMM states and the optimal number of clusters.

Gabriel Budel

DBHC

Sequence Clustering with Discrete-Output HMMs

cluster.bic function

<dl><dt>hmm</dt>
<dd>An <code>hmm</code> object (see <code>build_hmm</code>).</dd>
<dt>eps</dt>
<dd>A threshold epsilon for counting parameters.</dd></dl>

Arguments

HMM BIC — cluster.bic

<dl>

<dt>hmm</dt>
<dd>An <code>hmm</code> object (see <code>build_hmm</code>).</dd>


<dt>eps</dt>
<dd>A threshold epsilon for counting parameters.</dd>

</dl>

cluster.bic: HMM BIC

Description

Usage

Value

Arguments

See Also