Algorithm 1.

The algorithm to solve GSJNMF model

Input: $X_i\in {ℝ}_{+}^{m\times n_i}$, ${\mathcal{G}}^i$, λi, (i = 1, 2, 3), r, τ.

Initialize W and Hi, (i = 1, 2, 3) to random positive matrices.

k = 1.

while 1 do

Calculate the current function value fk on Eq. (12).

update W by using Eq. (17).

for j = 1 : r

W.j = W.j/||W.j||2.

end for

Update Hi (i = 1, 2, 3) by using Eq. (18).

Calculate the current function value fk+1 on Eq. (12).

if |(fk − fk+1)/fk+1| < τ

break.

end if

k = k + 1.

end while

Output: W, Hi, (i = 1, 2, 3).