Y
                i
              
            
            ?
          
        
        +
        
          
            ?
            
              
                X
                j
              
              -
              
                X
                i
              
            
            ?
          
          ·
          
            ?
            
              
                Y
                i
              
              -
              
                Y
                j
              
            
            ?
          
        
      
    
  
At 404, the flow proceeds to loop back to the flow of 403 until all biclique pairs are processed.
FIG. 4(b) illustrates an example overall flow, in accordance with an example implementation. Given data represented as a bipartite network and a set of missing links in the bipartite network, at 410 the algorithm of FIG. 4(a) is executed for calculating a weight for each of the missing links in the set based on bicliques of the bipartite network.
At 411 the flow executes a link prediction algorithm configured to incorporate the weight for each of the missing links. Any link prediction algorithm known in the art can be utilized for this purpose such as the algorithms described herein.