Algorithm 1 Sampling Process 1: Set λ = 1 and initialize topic assignments 2: for m = 1 to M do 3: Optimize η, τ , and ρ using L-BFGS 4: end for 13: end for Link set A is primarily used to find blocks, so it treats all links deterministically.
the links observed in the input are considered explicit positive links, while the unobserved links are considered explicit negative links, in contrast to the implicit links in B.