Description Usage Arguments Value Author(s) See Also

Construct a `march.Dcmm`

object, with visible order *orderVC*, hidden order *orderHC* and *M* hidden states, according to a `march.Dataset`

.
The first *maxOrder*-*orderVC* elements of each sequence are truncated in order to return a model
which can be compared with other Markovian model of visible order maxOrder. The construction is performed either by an evolutionary algorithm (EA) or by improving an existing DCMM.
The EA performs *gen* generations on a population of *popSize* individuals. The EA behaves as a Lamarckian evolutionary algorithm, using a Baum-Welch algorithm as
optimization step, running until log-likelihood improvement is less than *stopBw* or for *iterBw* iterations. Finally only the best individual from the population is returned as solution.
If a seedModel is provided, the only step executed is the optimization step, parameters related to the EA does not apply in this case.

1 2 | ```
march.dcmm.construct(y, orderHC, orderVC, M, gen = 5, popSize = 4,
maxOrder = orderVC, seedModel = NULL, iterBw = 2, stopBw = 0.1)
``` |

`y` |
the dataset from which the Dcmm will be constructed |

`orderHC` |
the order of the hidden chain of the constructed Dcmm. |

`orderVC` |
the order of the visible chain of the constructed Dcmm (0 for a HMM). |

`M` |
the number of hidden state of the Dcmm. |

`gen` |
the number of generation performed by the EA. |

`popSize` |
the number of individual stored into the population. |

`maxOrder` |
the maximum visible order among the set of Markovian models to compare. |

`seedModel` |
a model to optimize using Baum-Welch algorithm. |

`iterBw` |
the number of iteration performed by the Baum-Welch algorithm. |

`stopBw` |
the minimum increase in quality (log-likelihood) authorized in the Baum-Welch algorithm. |

the best `march.Dcmm`

constructed by the EA or the result of the Baum-Welch algorithm on *seedModel*.

Ogier Maitre

`march.Dcmm-class`

, `march.Model-class`

, `march.Dataset-class`

.

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.