Require:G a set of target prediction graphs, and w the associated pairwise consistency weights |
\(\mathbb {E} \Leftarrow \) Union of all edges in G |
repeat |
Extract \(e \in \mathbb {E}\) |
if e belongs to more than one graph from Gthen |
\(~~~~~~~~~~~~~~~b_{e} \Leftarrow \sum w_{i-j} \; \forall i,j \mid e \in G(i)\) and e∈G(j) |
end if |
\(\mathbf {until} \mathbb {E} = \emptyset \) |