Skip to main content
. Author manuscript; available in PMC: 2019 Oct 1.
Published in final edited form as: IEEE Trans Affect Comput. 2017 Mar 6;10(1):115–128. doi: 10.1109/TAFFC.2017.2678472

Algorithm 1.

Variational EM algorithm of GLBA

Input: A multi-graph {Ii,jk{0,1}}i,jΩk0<γ<0.5
Output: subject parameters Θ=({(τi,αi,βi)}i=1m,γ)
Initialisation : τ0 = 0.5, αi = βi = τi = 1.0, i = 1, . . . ,m
1: repeat
2: for k − 1 to n do
3:   compute statistics α˜i(k),β˜i(k),τ˜i(k) 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 {(τi,αi,βi)}i=1m are all converged.
11: return Θ