The following detailed description provides further details of the figures and example implementations of the present application. Reference numerals and descriptions of redundant elements between figures are omitted for clarity. Terms used throughout the description are provided as examples and are not intended to be limiting. For example, the use of the term “automatic” may involve fully automatic or semi-automatic implementations involving user or administrator control over certain aspects of the implementation, depending on the desired implementation of one of ordinary skill in the art practicing implementations of the present application. Selection can be conducted by a user through a user interface or other input means, or can be implemented through a desired algorithm. Example implementations as described herein can be utilized either singularly or in combination and the functionality of the example implementations can be implemented through any means according to the desired implementations.

As set forth herein, the term “non-connected pair of nodes” is defined as the nodes that are not connected in the original network. The term “set of missing links” is defined as the potential links that exist between non-connected nodes. The term “predicted missing link” is defined as the missing links with the probability generated by the algorithm of example implementations described herein.