Algorithm 1.
Input: A multi-graph | |
Output: subject parameters | |
Initialisation : τ0 = 0.5, αi = βi = τi = 1.0, i = 1, . . . ,m | |
1: | repeat |
2: | for k − 1 to n do |
3: | compute statistics by Eq. (18); |
4: | end for |
5: | for i − 1 to m do |
6: | solve (αi, βi) from Eq. (19) (Newton-Raphson); |
7: | compute τi by Eq. (20); |
8: | end for |
9: | (optional) update γ from Eq. (21); |
10: | until are all converged. |
11: | return Θ |