Examples of org.encog.ml.hmm.alog.ViterbiCalculator

org.encog.ml.hmm.alog.ViterbiCalculator
The Viterbi algorithm is used to find the most likely sequence of hidden states (called the Viterbi path) that results in a sequence of observed events. Used for the Markov information sources, and more generally, hidden Markov models (HMM). Viterbi AJ (April 1967). "Error bounds for convolutional codes and an asymptotically optimum decoding algorithm" . IEEE Transactions on Information Theory 13 (2): 260-269. doi:10.1109/TIT.1967.1054010.

    return this.stateDistributions[i];
  }


  @Override
  public int[] getStatesForSequence(final MLDataSet seq) {
    return (new ViterbiCalculator(seq, this)).stateSequence();
  }

View Full Code Here


  private boolean optimizeCluster(final HiddenMarkovModel hmm) {
    boolean modif = false;


    for (final MLDataSet obsSeq : this.sequnces.getSequences()) {
      final ViterbiCalculator vc = new ViterbiCalculator(obsSeq, hmm);
      final int states[] = vc.stateSequence();


      for (int i = 0; i < states.length; i++) {
        final MLDataPair o = obsSeq.get(i);


        if (this.clusters.cluster(o) != states[i]) {

View Full Code Here

TOP

Related Classes of org.encog.ml.hmm.alog.ViterbiCalculator

org.encog.ml.data.MLDataPair

org.encog.ml.hmm.HiddenMarkovModel

org.encog.ml.hmm.train.kmeans.TrainKMeans

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.