size.search: Size Search Algorithm

In DBHC: Sequence Clustering with Discrete-Output HMMs

Size Search Algorithm

Description

The size search algorithm finds the optimal number of HMM states for a set of sequences and returns both the optimal hmm object and the corresponding number of hidden states. Used in select.seeds.

Usage

size.search(sequences, log_space = FALSE, print = FALSE)

Arguments

sequences	An stslist object (see seqdef) of sequences with discrete observations.
log_space	Logical, parameter provided to fit_model for whether to use optimization in log space or not.
print	Logical, whether to print intermediate steps or not.

Value

A list with the optimal number of HMM states and the optimal hmm object.

See Also

Used in the DBHC seed selection procedure in select.seeds.

DBHC documentation built on Dec. 28, 2022, 2:44 a.m.