Suggesting a relationship for a node pair based upon shared connections versus total connections
View Patent ↗A first total number of nodes in a first node set directly linked to a first node can be computed. A second total number of nodes in a second node set directly linked to a second node can be computed. A shared total number of nodes in a union of the first node set and the second node set can be computed. A mutual information metric can then be computed from the first total, the second total, and the shared total. A decision as to whether a new connection should be added between the first node and the second node, which were not previously directly connected, can be determined from the value of mutual information metric.
1. A computer-implemented method of determining new connections between nodes comprising:
identifying a homogonous set of nodes comprising a first set of a plurality of nodes, a second set of a plurality of nodes, a first node, and a second node, each node in the first set having a direct link to the first node, each node in the second set having a direct link to the second node, wherein no direct link exists between the first node and the second node;
determining a first node connection total, a second node connection total, and a shared node connection total, wherein the first node connection total equals a number of nodes in the first set, wherein the second node connection total equals a number of nodes in the second set, and wherein the shared node connection total equals a total number of nodes resulting from a union of the first node set and the second node set;
computing a mutual information (MI) metric using an MI calculation algorithm where the only variables of the MI calculation algorithm are based upon the first node connection total, the second node connection total and the shared node connection total, wherein the computed mutual information (MI) metric increases as the shared node connection total increases and decreases as the first node connection total and the second node connection total increase; and
deciding whether a direct connection is to be added between the first node and the second node based upon a value of the computed mutual information (MI) metric, wherein a higher value for the computed mutual information (MI) metric is more likely to result in a direction connection being added than a lower value for the computed mutual information (MI) metric.
2. The computer-implemented method of claim 1 , wherein the deciding of whether the direct connection is to be added between the first node and the second node is based entirely upon the value of the computed mutual information (MI) metric or is based a user input to a prompt for creating a direct connection between the first node and the second node where the prompt is based entirely upon the value of the computed mutual information (MI) metric.
3. The computer-implemented method of claim 1 , wherein direct links with nodes of the first set and the first node and direct links with nodes of the second set and the second nodes comprise directional links, further comprising:
filtering the first set and the second set to exclude at least a portion of the nodes in each set based upon a link directional state, wherein different link directional states comprise a unidirectional state, a node-to-reference direction, and a reference-to-node direction, wherein the computing of the first node connection total, the second node connection total, and the shared node connection total occurs after the filtering.
4. A computer program product of determining new connections between nodes comprising a computer readable storage medium having computer usable program code embodied thereupon, the computer usable program code comprising:
computer usable program code configured to identify a homogonous set of nodes comprising a first set of a plurality of nodes, a second set of a plurality of nodes, a first node, and a second node, each node in the first set having a direct link to the first node, each node in the second set having a direct link to the second node, wherein no direct link exists between the first node and the second node
computer usable program code configured to determine a first node connection total, a second node connection total, and a shared node connection total, wherein the first node connection total equals a number of nodes in the first set, wherein the second node connection total equals a number of nodes in the second set, and wherein the shared node connection total equals a total number of nodes resulting from a union of the first node set and the second node set;
computer usable program code configured to compute a mutual information (MI) metric using an MI calculation algorithm where the only variables of the MI calculation algorithm are based upon the first node connection total, the second node connection total and the shared node connection total, wherein the computed mutual information (MI) metric increases as the shared node connection total increases and decreases as the first node connection total and the second node connection total increase; and
computer usable program code configured to decide whether a direct connection is to be added between the first node and the second node based upon a value of the computed mutual information (MI) metric, wherein a higher value for the computed mutual information (MI) metric is more likely to result in a direction connection being added than a lower value for the computed mutual information (MI) metric.
5. The computer program product of claim 4 , wherein the deciding of whether the direct connection is to be added between the first node and the second node is based entirely upon the value of the computed mutual information (MI) metric or is based a user input to a prompt for creating a direct connection between the first node and the second node where the prompt is based entirely upon the value of the computed mutual information (MI) metric.
6. The computer program product of claim 4 , wherein direct links with nodes of the first set and the first node and direct links with nodes of the second set and the second nodes comprise directional links, further comprising:
computer usable program code configured to filter the first set and the second set to exclude at least a portion of the nodes in each set based upon a link directional state, wherein different link directional states comprise a unidirectional state, a node-to-reference direction, and a reference-to-node direction, wherein the computing of the first node connection total, the second node connection total, and the shared node connection total occurs after the filtering.
7. A system of determining new connections between nodes comprising:
at least one processor;
a volatile memory;
a non-volatile memory; and
a bus communicatively linking the at least one processor, the volatile memory, and the non-volatile memory, wherein said at least one processor is configured to execute a computer program product, wherein execution of the computer program product causes the system to:
identify a homogonous set of nodes comprising a first set of a plurality of nodes, a second set of a plurality of nodes, a first node, and a second node, each node in the first set having a direct link to the first node, each node in the second set having a direct link to the second node, wherein no direct link exists between the first node and the second node
determine a first node connection total, a second node connection total, and a shared node connection total, wherein the first node connection total equals a number of nodes in the first set, wherein the second node connection total equals a number of nodes in the second set, and wherein the shared node connection total equals a total number of nodes resulting from a union of the first node set and the second node set;
compute a mutual information (MI) metric using an MI calculation algorithm where the only variables of the MI calculation algorithm are based upon the first node connection total, the second node connection total and the shared node connection total, wherein the computed mutual information (MI) metric increases as the shared node connection total increases and decreases as the first node connection total and the second node connection total increase; and
decide whether a direct connection is to be added between the first node and the second node based upon a value of the computed mutual information (MI) metric, wherein a higher value for the computed mutual information (MI) metric is more likely to result in a direction connection being added than a lower value for the computed mutual information (MI) metric.
8. The system of claim 7 , wherein the deciding of whether the direct connection is to be added between the first node and the second node is based entirely upon the value of the computed mutual information (MI) metric or is based a user input to a prompt for creating a direct connection between the first node and the second node where the prompt is based entirely upon the value of the computed mutual information (MI) metric.
9. The system of claim 7 , wherein direct links with nodes of the first set and the first node and direct links with nodes of the second set and the second nodes comprise directional links, and wherein execution of the computer program product further causes the system to:
filter the first set and the second set to exclude at least a portion of the nodes in each set based upon a link directional state, wherein different link directional states comprise a unidirectional state, a node-to-reference direction, and a reference-to-node direction, wherein the computing of the first node connection total, the second node connection total, and the shared node connection total occurs after the filtering.