US 12,348,540 B2
Techniques to generate relationship graphs utilizing data in an enterprise system environment
Nahid Farhady Ghalaty, San Diego, CA (US); Vincent Pham, Champaign, IL (US); Lee Adcock, Midlothian, VA (US); and Ana Cruz, New York, NY (US)
Assigned to Capital One Services, LLC., McLean, VA (US)
Filed by Capital One Services, LLC, McLean, VA (US)
Filed on Aug. 19, 2021, as Appl. No. 17/406,724.
Prior Publication US 2023/0054704 A1, Feb. 23, 2023
Int. Cl. H04L 9/40 (2022.01); G06F 16/901 (2019.01); G06F 16/906 (2019.01)
CPC H04L 63/1425 (2013.01) [G06F 16/9024 (2019.01); G06F 16/906 (2019.01); H04L 63/1416 (2013.01)] 20 Claims
OG exemplary drawing
 
1. A system to generate graphs of associates and events based on digital footprints of the associates, comprising:
a data store comprising data, the data comprising the associates and the events performed by the associates;
one or more processors coupled with the data store; and
memory comprising instructions that, when executed by the one or more processors, cause the one or more processors to:
retrieve the data from the data store;
generate, with the data, a graph comprising associate nodes and event nodes, wherein the associate nodes connect with the event nodes via edges, wherein at least one associate node directly connects to another associate node via an edge;
generate a grouping of associate nodes comprising two or more of the associate nodes, each associate node in the grouping of associate nodes comprising an edge to a number of event nodes, each of which at least one other associate node in the grouping of associate nodes has an edge connected thereto, the number of event nodes defined by a threshold value;
generate an edge between each of the associate nodes in the grouping of associate nodes that have at least one event node in common with each other;
determine an associate node of the grouping of associate nodes having an edge with an event node, wherein the event node includes a second number of edges with other associate nodes of the grouping of associate nodes below a second threshold value; and
generate an indication identifying the associate node.