Click or drag to resize
Accord.NET (logo)

Forward Class

Forward Topology for Hidden Markov Models.
Inheritance Hierarchy
SystemObject
  Accord.Statistics.Models.Markov.TopologyForward

Namespace:  Accord.Statistics.Models.Markov.Topology
Assembly:  Accord.Statistics (in Accord.Statistics.dll) Version: 3.8.0
Syntax
[SerializableAttribute]
public class Forward : ITopology
Request Example View Source

The Forward type exposes the following members.

Constructors
  NameDescription
Public methodForward(Int32)
Creates a new Forward topology for a given number of states.
Public methodForward(Int32, Boolean)
Creates a new Forward topology for a given number of states.
Public methodForward(Int32, Int32)
Creates a new Forward topology for a given number of states.
Public methodForward(Int32, Int32, Boolean)
Creates a new Forward topology for a given number of states.
Top
Properties
  NameDescription
Public propertyDeepness
Gets or sets the maximum deepness level allowed for the forward state transition chains.
Public propertyInitial
Gets the initial state probabilities.
Public propertyRandom
Gets or sets whether the transition matrix should be initialized with random probabilities or not. Default is false.
Public propertyStates
Gets the number of states in this topology.
Top
Methods
  NameDescription
Public methodCreate
Creates the state transitions matrix and the initial state probabilities for this topology.
Public methodEquals
Determines whether the specified object is equal to the current object.
(Inherited from Object.)
Protected methodFinalize
Allows an object to try to free resources and perform other cleanup operations before it is reclaimed by garbage collection.
(Inherited from Object.)
Public methodGetHashCode
Serves as the default hash function.
(Inherited from Object.)
Public methodGetType
Gets the Type of the current instance.
(Inherited from Object.)
Protected methodMemberwiseClone
Creates a shallow copy of the current Object.
(Inherited from Object.)
Public methodToString
Returns a string that represents the current object.
(Inherited from Object.)
Top
Extension Methods
  NameDescription
Public Extension MethodHasMethod
Checks whether an object implements a method with the given name.
(Defined by ExtensionMethods.)
Public Extension MethodIsEqual
Compares two objects for equality, performing an elementwise comparison if the elements are vectors or matrices.
(Defined by Matrix.)
Public Extension MethodTo(Type)Overloaded.
Converts an object into another type, irrespective of whether the conversion can be done at compile time or not. This can be used to convert generic types to numeric types during runtime.
(Defined by ExtensionMethods.)
Public Extension MethodToTOverloaded.
Converts an object into another type, irrespective of whether the conversion can be done at compile time or not. This can be used to convert generic types to numeric types during runtime.
(Defined by ExtensionMethods.)
Top
Remarks

Forward topologies are commonly used to initialize models in which training sequences can be organized in samples, such as in the recognition of spoken words. In spoken word recognition, several examples of a single word can (and should) be used to train a single model, to achieve the most general model able to generalize over a great number of word samples.

Forward models can typically have a large number of states.

References:

  • Alexander Schliep, "Learning Hidden Markov Model Topology".
  • Richard Hughey and Anders Krogh, "Hidden Markov models for sequence analysis: extension and analysis of the basic method", CABIOS 12(2):95-107, 1996. Available in: http://compbio.soe.ucsc.edu/html_format_papers/hughkrogh96/cabios.html

Examples

In the following example, we will create a Forward-only discrete-density hidden Markov model.

// Create a new Forward-only hidden Markov model with
// three forward-only states and four sequence symbols.
var model = new HiddenMarkovModel(new Forward(3), 4);

// After creation, the state transition matrix for the model
// should be given by:
// 
//       { 0.33, 0.33, 0.33 }
//       { 0.00, 0.50, 0.50 }
//       { 0.00, 0.00, 1.00 }
//       
// in which no backward transitions are allowed (have zero probability).
See Also