Systems and methods for implementing a nodal data structure for fraud detection ring

A method for data structure optimization comprising:

• generating, by one or more processors, a plurality of account nodes in a node graph, each account node corresponding to a different account;
• determining, by the one or more processors, one or more respective pairs of the plurality of account nodes that correspond to a common entity;
• separately collapsing, by the one or more processors, each of the one or more respective pairs of the plurality of account nodes into a respective single consolidated node responsive to determining the respective pairs of the plurality of account nodes corresponds to a common entity;
• and
• generating, by the one or more processors and based on the collapse, a resulting node graph having a reduced number of transaction edges compared to the node graph prior to the collapsing operation, thereby reducing processing resources for fraud detection.

A non-transitory computer-readable medium storing instructions that, when executed by one or more processors, cause the one or more processors to:

• generate a plurality of account nodes in a node graph, each account node corresponding to a different account;
• determine one or more respective pairs of the plurality of account nodes that correspond to a common entity;
• separately collapse each of the one or more respective pairs of the plurality of account nodes into a respective single consolidated node responsive to determining the respective pairs of the plurality of account nodes corresponds to a common entity;
• and
• generate, based on the collapse, a resulting node graph having a reduced number of transaction edges compared to the node graph prior to the collapsing operation, thereby reducing processing resources for fraud detection.