Generating and populating data-link trees from relationship clusters

A non-transitory computer readable medium storing instructions which, when executed by at least one processor, cause the at least one processor to:

• determine, for a first data identifier and a second data identifier within a relationship cluster comprising a plurality of data identifiers grouped according to data matches, a predicted data link between the first data identifier and the second data identifier;
• generate, based on the predicted data link, a first candidate data-link tree and a second candidate data-link tree, wherein the first candidate data-link tree comprises a first connection between a first node representing the first data identifier and a second node representing the second data identifier and wherein the second candidate data-link tree comprises a second connection between the first node and the second node;
• calculate a first data-match value for the first candidate data-link tree and a second data-match value for the second candidate data-link tree;
• and
• based on comparing the first data-match value and the second data-match value, generate a primary data-link tree including the first node and the second node arranged according to the first connection reflected by the first candidate data-link tree.

A system comprising:

• one or more memory devices;
• and
• one or more processors coupled to the one or more memory devices, wherein the one or more processors are configured to cause the system to:
• determine, for a first data identifier and a second data identifier within a relationship cluster comprising a plurality of data identifiers grouped according to data matches, a predicted data link between the first data identifier and the second data identifier;
• generate, based on the predicted data link, a first candidate data-link tree and a second candidate data-link tree, wherein the first candidate data-link tree comprises a first connection between a first node representing the first data identifier and a second node representing the second data identifier and wherein the second candidate data-link tree comprises a second connection between the first node and the second node;
• calculate a first data-match value for the first candidate data-link tree and a second data-match value for the second candidate data-link tree;
• and
• based on comparing the first data-match value and the second data-match value, generate a primary data-link tree including the first node and the second node arranged according to the first connection reflected by the first candidate data-link tree.