US 12,299,006 B2
Machine learning automation of network resource workflows
Boaz Hecht, Palo Alto, CA (US); Josh Russ, Los Angeles, CA (US); Yev Goldin, Los Angeles, CA (US); and Frank Dye, San Francisco, CA (US)
Assigned to 8flow Inc., San Mateo, CA (US)
Filed by 8flow Inc., San Mateo, CA (US)
Filed on May 31, 2024, as Appl. No. 18/679,518.
Claims priority of provisional application 63/470,383, filed on Jun. 1, 2023.
Prior Publication US 2024/0403328 A1, Dec. 5, 2024
Int. Cl. G06F 16/28 (2019.01); H04L 67/02 (2022.01)
CPC G06F 16/285 (2019.01) [H04L 67/02 (2013.01)] 20 Claims
OG exemplary drawing
 
1. A workflow automation computer system comprising:
one or more hardware processors;
one or more network interfaces that are communicatively coupled to one or more internetworks and capable of network communication with a browser extension hosted on an agent computer, a relational database system, and a support ticket system; and
one or more non-transitory computer-readable storage media coupled to the one or more hardware processors and storing:
one or more trained machine learning models; and
one or more sequences of instructions which, when executed using one or more processors, cause the one or more processors to execute:
receiving, from the browser extension, one or more browser event objects, extracting attribute values from the one or more browser event objects, and storing, in the relational database system, the one or more browser event objects and attribute values as one or more events of user action time series records;
creating and storing in memory multiple trees having a depth=2, each of the trees comprising a plurality of nodes corresponding to browser event objects and a plurality of edges that connect the nodes to one or more child event nodes while recording identifiers of source events for copy-type events;
for a particular child event node that represents browser event objects corresponding to pasting or form-filling data, identifying an existing tree among the trees having a corresponding source node, and joining a root node of that existing tree to the particular child event node;
grouping all trees rooted in navigation events identifying a particular hostname under a common root node that specifies a first navigation event;
for the first navigation event having a second navigation event as a direct child node, deleting the second navigation event;
deleting from the memory all the trees having the depth=2; and
in response to determining that a final tree has >2 navigation events, creating and storing a relay based on the final tree.