private void OutputIntermediate(SequenceData valData) {
List<int> combined = new List<int>();
foreach(int[] arr in valData.GetAll()) {
combined.AddRange(arr);
}
intermediateOutputFile.WriteLine(hmm.NumberOfStates + ", " + this.hmm.Evaluate(valData.GetAll(), true));
//intermediateOutputFile.WriteLine(hmm.NumberOfStates + ", " + this.CalculateProbability(combined.ToArray()));
}
public override void Learn(SequenceData trainingData,
SequenceData validationData, SequenceData testData)
{
#region Junk
//hmm.Learn(trainingData.GetNonempty(), 1);
//foreach (int[] O in trainingData.GetAll()) {
// // 1. convert to hmm to graph model.
// HMMGraph hmmGraph = ModelConverter.HMM2Graph(hmm);
// // 2. find argmax gamma
// BaumWelch bw = new BaumWelch(O.Length, hmmGraph);
// //Node qPrime = (from n in hmmGraph.Nodes
// // where hmmGraph.Nodes.TrueForAll(x => bw.ComputeGamma(n,
// // hmmGraph, O) > bw.ComputeGamma(x, hmmGraph, O))
// // select n).Single();
// Node qPrime = (from n in hmmGraph.Nodes
// where hmmGraph.Nodes.TrueForAll(x
// => bw.ComputeGamma(n, hmmGraph, O) >= bw.ComputeGamma(x, hmmGraph, O))
// select n).First();
// // 3. split node if transition or emission probs
// // are above uniformity threshold.
// double[] transValues = qPrime.Transitions.Values.ToArray();
// double[] emissionValues = qPrime.Emissions.Values.ToArray();
// if (!isUniform(transValues, TRANSITION_UNIFORMITY_THRESHOLD)
// || !isUniform(emissionValues, EMISSION_UNIFORMITY_THRESHOLD)) {
// // 4. assign new probs and normalize.
// Node q1 = new Node();
// Node q2 = new Node();
// if (!isUniform(transValues, TRANSITION_UNIFORMITY_THRESHOLD)) {
// AssignTransitions(qPrime, q1, q2);
// }
// if (!isUniform(emissionValues, EMISSION_UNIFORMITY_THRESHOLD)) {
// AssignEmissions(qPrime, q1, q2);
// }
// AssignIncomingTransitions(qPrime, q1, q2, hmmGraph);
// q1.InitialProbability = qPrime.InitialProbability / 2;
// q2.InitialProbability = qPrime.InitialProbability / 2;
// hmmGraph.AddNode(q1);
// hmmGraph.AddNode(q2);
// hmmGraph.RemoveNode(qPrime);
// }
// // 5. convert graph model back to hmm
// //hmmGraph.Normalize();
// hmm = ModelConverter.Graph2HMM(hmmGraph);
// // 6. ReLearn model using BW.
// hmm.Learn(trainingData.GetAll(), ITERATIONS);
//}
#endregion
intermediateOutputFile = new System.IO.StreamWriter(intermediateOutputFileName + (run++) + ".csv");
intermediateOutputFile.WriteLine("States, Likelihood");
// Initialize graph
HMMGraph graph = new HMMGraph(trainingData.NumSymbols);
for (int i = 0; i < MINIMUM_STATES; i++) {
graph.AddNode(new Node());
}
foreach (Node n in graph.Nodes) {
foreach (Node m in graph.Nodes) {
n.SetTransition(m, 0.5);
}
for (int i = 0; i < trainingData.NumSymbols; i++) {
n.SetEmission(i, 0.5);
}
}
graph.Normalize();
this.hmm = SparseHiddenMarkovModel.FromGraph(graph);
CleanGraph(graph);
Random rnd = new Random();
List<int> cList = new List<int>();
foreach (int[] a in trainingData.GetAll()) {
cList.AddRange(a);
}
int[] combinedTrainData = cList.ToArray();
// Run iterations.
int iteration = 1;
int stuckAt = 1;
int stuckFor = 1;
while(hmm.NumberOfStates < maximum_states
&& iteration < maximum_iterations) {
Console.WriteLine("* Iteration {0} of {1} Model contains {2} states",iteration,maximum_iterations,hmm.NumberOfStates);
graph = hmm.ToGraph();
Node qPrime = FindQPrime(graph, combinedTrainData);
// check to see if the algorithm is stuck
if (stuckAt == hmm.NumberOfStates) {
stuckFor++;
}
else {
stuckAt = hmm.NumberOfStates;
stuckFor = 1;
}
bool isStuck = stuckFor > MAX_STUCK ? true : false;
if (isUniform(qPrime.Transitions.Values.ToArray(),TRANSITION_UNIFORMITY_THRESHOLD)
|| isUniform(qPrime.Emissions.Values.ToArray(),EMISSION_UNIFORMITY_THRESHOLD)
|| isStuck)
{
if (isStuck) {
Console.WriteLine("Algorithm is stuck: FORCING SPLIT");
}
graph = Splitstate(qPrime, graph);
}
hmm = SparseHiddenMarkovModel.FromGraph(graph);
hmm.Learn(trainingData.GetAll(), THRESHOLD, BW_ITERATIONS);
OutputIntermediate(validationData);
iteration++;
}
hmm = SparseHiddenMarkovModel.FromGraph(graph);
intermediateOutputFile.Close();
}