From: Identifying protein complexes directly from high-throughput TAP data with Markov random fields
Algorithm: Mean field annealing |
\SetKwInOut{Input}{Input} |
\SetKwInOut{Output}{Output} |
\Input{A set of observations (t ij , s ij ) for each pair (i, j), ψ, a number of clusters K} |
\Output{A probability q ik for a node i belonging to a cluster k for all i and for all k} |
Initialize q to random values; |
Initialize annealing factor γ; |
While γ <γmax Repeat q converges |
ForAll i ∈ V |
ForAll k ∈ K |
|
ForAll k ∈ K |
|
ForAll k ∈ K |
q ik = |
Increase γ; |