NETWORK NODE ANALYSIS AND LINK GENERATION SYSTEM
Described are methods and systems to identify missing connections, facilitate establishing new connections, and identify new nodes within a progression path for entities. According to various embodiments, the system accesses a set of data clusters representing distinct entities, and identifies a progression path for a first entity where the progression path includes a set of nodes. The system determines a match between a subject entity and the first entity based on a current node of a progression path of the subject entity being associated with a selected node of the progression path of the first entity. The system determines that a subsequent node of the progression path of the first entity corresponds to a potential node of the progression path of the subject entity and generates a portion of a message from the subject entity to the first entity.
1 . A method, comprising:
accessing a set of data clusters within a database, the data clusters representing distinct entities within the database;
identifying a progression path for a first entity of the distinct entities represented by the set of data clusters, the progression path including a set of nodes;
determining a match between a subject entity and the first entity, the match based on a current node of a progression path identified for the subject entity being associated with a selected node of the progression path identified for the first entity;
determining that a subsequent node of the progression path identified for the first entity corresponds to a potential node of the progression path identified for the subject entity; and
in response to determining that the subsequent node corresponds to the potential node, generating a portion of a message from the subject entity to the first entity.
2 . The method of claim 1 , wherein the subsequent node of the progression path identified for the first entity is positioned a distance apart from the selected node of the progression path for the first entity.
3 . The method of claim 2 , wherein determining that the subsequent node of the progression path for the first entity corresponds to the potential node of the progression path of the subject entity further comprises:
determining one or more nodes between the current node of the progression path of the subject entity and the subsequent node of the progression path of the first entity;
identifying a second entity having a progression path with a subsequent node corresponding to the one or more nodes between the current node of the progression path of the subject entity and the subsequent node of the progression path of the first entity; and
generating a portion of a message from the subject entity to the second entity.
4 . The method of claim 1 , further comprising:
identifying a historical progression path for the subject entity, the historical progression path comprising a set of historical nodes associated with the subject entity and occurring prior to a specified node; and
based on the historical progression path for the subject entity, determining a set of potential nodes for the progression path for the subject entity and occurring subsequent to the specified node, a portion of nodes within the progression path of the subject entity corresponding to the set of historical nodes.
5 . The method of claim 4 , wherein the set of potential nodes includes the potential node of the progression path for the subject entity which corresponds to the subsequent node of the progression path for the first entity.
6 . The method of claim 4 , wherein the set of potential nodes determined for the progression path of the subject entity represent one or more prospective progression paths extending from the current node of the progression path of the subject entity and the historical progression path.
7 . The method of claim 1 , wherein identifying the progression path for the first entity further comprises:
identifying a set of entities from the distinct entities represented by the data clusters;
for each entity of the set of entities, determining a probability of a node of a progression path of the entity corresponding to the potential node of the progression path of the subject entity; and
ranking the set of entities based on the probabilities determined for each entity of the set of entities.
8 . The method of claim 7 , wherein determining the probability of the node of the entity corresponding to the potential node of the progression path of the subject entity further comprises:
determining a set of potential nodes for the progression path for the subject entity; and
for each potential node of the set of potential nodes, determining a probability of the potential node being a next node in the progression path for the subject entity.
9 . The method of claim 8 , wherein the set of entities is ranked based on the probabilities determined for each potential node of the set of potential nodes and the probabilities determined for each entity of the set of entities.
10 . A system, comprising:
one or more processors; and
a processor-readable storage device comprising processor-executable instructions that, when executed by the one or more processors, cause the one or more processors to perform operations comprising:
accessing a set of data clusters within a database, the data clusters representing distinct entities within the database;
identifying a progression path for a first entity of the distinct entities represented by the set of data clusters, the progression path including a set of nodes;
determining a match between a subject entity and the first entity, the match based on a current node of a progression path identified for the subject entity being associated with a selected node of the progression path identified for the first entity;
determining that a subsequent node of the progression path identified for the first entity corresponds to a potential node of the progression path identified for the subject entity; and
in response to determining that the subsequent node corresponds to the potential node, generating a portion of a message from the subject entity to the first entity.
11 . The system of claim 10 , wherein the subsequent node of the progression path identified for the first entity is positioned a distance apart from the selected node of the progression path for the first entity, and wherein determining that the subsequent node of the progression path for the first entity corresponds to the potential node of the progression path of the subject entity further comprises:
determining one or more nodes between the current node of the progression path of the subject entity and the subsequent node of the progression path of the first entity;
identifying a second entity having a progression path with a subsequent node corresponding to the one or more nodes between the current node of the progression path of the subject entity and the subsequent node of the progression path of the first entity; and
generating a portion of a message from the subject entity to the second entity.
12 . The system of claim 10 , wherein the operations further comprise:
identifying a historical progression path for the subject entity, the historical progression path comprising a set of historical nodes associated with the subject entity and occurring prior to a specified node; and
based on the historical progression path for the subject entity, determining a set of potential nodes for the progression path for the subject entity and occurring subsequent to the specified node, a portion of nodes within the progression path of the subject entity corresponding to the set of historical nodes.
13 . The system of claim 10 , wherein identifying the progression path for the first entity further comprises:
identifying a set of entities from the distinct entities represented by the data clusters;
for each entity of the set of entities, determining a probability of a node of a progression path of the entity corresponding to the potential node of the progression path of the subject entity; and
ranking the set of entities based on the probabilities determined for each entity of the set of entities.
14 . The system of claim 13 , wherein determining the probability of the node of the entity corresponding to the potential node of the progression path of the subject entity further comprises:
determining a set of potential nodes for the progression path for the subject entity; and
for each potential node of the set of potential nodes, determining a probability of the potential node being a next node in the progression path for the subject entity.
15 . The system of claim 14 , wherein the set of entities is ranked based on the probabilities determined for each potential node of the set of potential nodes and the probabilities determined for each entity of the set of entities.
16 . A processor-readable storage device comprising processor-executable instructions that, when executed by one or more processors of a machine, cause the machine to perform operations comprising:
accessing a set of data clusters within a database, the data clusters representing distinct entities within the database;
identifying a progression path for a first entity of the distinct entities represented by the set of data clusters, the progression path including a set of nodes;
determining a match between a subject entity and the first entity, the match based on a current node of a progression path identified for the subject entity being associated with a selected node of the progression path identified for the first entity;
determining that a subsequent node of the progression path identified for the first entity corresponds to a potential node of the progression path identified for the subject entity; and
in response to determining that the subsequent node corresponds to the potential node, generating a portion of a message from the subject entity to the first entity.
17 . The processor-readable storage device of claim 16 , wherein the subsequent node of the progression path identified for the first entity is positioned a distance apart from the selected node of the progression path for the first entity, and wherein determining that the subsequent node of the progression path for the first entity corresponds to the potential node of the progression path of the subject entity further comprises:
determining one or more nodes between the current node of the progression path of the subject entity and the subsequent node of the progression path of the first entity;
identifying a second entity having a progression path with a subsequent node corresponding to the one or more nodes between the current node of the progression path of the subject entity and the subsequent node of the progression path of the first entity; and
generating a portion of a message from the subject entity to the second entity.
18 . The processor-readable storage device of claim 16 , wherein the operations further comprise:
identifying a historical progression path for the subject entity, the historical progression path comprising a set of historical nodes associated with the subject entity and occurring prior to a specified node; and
based on the historical progression path for the subject entity, determining a set of potential nodes for the progression path for the subject entity and occurring subsequent to the specified node, a portion of nodes within the progression path of the subject entity corresponding to the set of historical nodes.
19 . The processor-readable storage device of claim 16 , wherein identifying the progression path for the first entity further comprises:
identifying a set of entities from the distinct entities represented by the data clusters;
for each entity of the set of entities, determining a probability of a node of a progression path of the entity corresponding to the potential node of the progression path of the subject entity; and
ranking the set of entities based on the probabilities determined for each entity of the set of entities.
20 . The processor-readable storage device of claim 19 , wherein determining the probability of the node of the entity corresponding to the potential node of the progression path of the subject entity further comprises:
determining a set of potential nodes for the progression path for the subject entity; and
for each potential node of the set of potential nodes, determining a probability of the potential node being a next node in the progression path for the subject entity.