N (10) Flashcards

(6 cards)

1
Q

What is the initial step in the Forward procedure for Task 1?

A

aj (i) = T; bi (01)

This step initializes the forward algorithm for processing the first file.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

In the Forward procedure, for which values of t does the iteration occur?

A

t = 2, 3, …, T

This indicates the time steps at which the forward algorithm processes the data.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What is the initial step in the Backward procedure for Task 1?

A

PT (i) = ni

This step initializes the backward algorithm for processing the data.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

In the Backward procedure, for which values of t does the iteration occur?

A

t = T - 2, …, 1

This indicates the time steps at which the backward algorithm processes the data.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What does the transition likelihood represent?

A

Joint probability of states i and j, conditioned on the observations

It is mathematically expressed as ŝt (i,j) = P (xt-1 = i, xt = j|O, 1).

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What is the formula for transition likelihood?

A

şt (i,j) = P (xt-1 = i, xt = j|O, 1) = at-1(i) aij bj (01) Be(j)

This formula calculates the transition likelihood based on previous states and observations.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly