Algorithm 1 Heuristic algorithm to extract biclique graph from bipartite graph

Require: A bipartite graph G(N,S,ε)

Ensure: Maximum edge biclique graph ${\mathit{G}}_0({\mathit{N}}^{\prime },{\mathit{S}}^{\prime })$

Initialize edge variable

for (i: 1 to N) do

for (j: 1 to S) do

if $d_{i,j}\le d^{Th}$ then

Estimate $E_{i,j}^h$ using Equation (1)

end if

end for

Find maximum $E_{i,j}^h$

Find maximum $N^{\prime }\leftarrow i$ and $S^{\prime }\leftarrow j$

end for

return $G_0(N^{\prime },S^{\prime })$