| CPC H04L 69/18 (2013.01) [G06F 18/22 (2023.01); G06N 20/00 (2019.01); G06Q 30/0251 (2013.01); H04L 69/03 (2013.01); H04L 69/08 (2013.01)] | 20 Claims |
|
1. A computer-implemented method, comprising:
accessing one or more master trees, generated using a plurality of protocol definitions, that defines conditions for transmission of a plurality of dataset to a plurality of computing devices, wherein:
each of the plurality of protocol definitions identifies an ordered set of actions, for each sequential pair of actions in the ordered set of actions, an action-advancement condition that identifies a criterion for advancing across the sequential pair of actions in the ordered set of actions so as to trigger a later of the sequential pair of actions;
each of the plurality of protocol definitions respectively include a set of dynamic nodes and a set of static nodes;
each of the set of dynamic nodes represents an action that was identified in at least one of the plurality of protocol definitions;
each of the set of static nodes represents an action-advancement condition specified in at least one of the plurality of protocol definitions;
the master trees are configured such that, for each of the plurality of protocol definitions, a path through a subset of the set of static nodes and through a subset of the set of dynamic nodes represents the protocol definition;
each of the set of dynamic nodes has a dynamic-node weight that was defined based on data indicating a past result of performing a dynamic action represented by the dynamic node;
each of the set of static nodes has a static-node weight that was defined based on a backpropagation of at least one of the dynamic-node weights; and
each of at least some of the dynamic nodes and each of at least some of the static nodes is associated with a point value generated based at least on the data indicating a past result of performing an action represented by a node;
accessing a partial protocol definition that includes at least one action, wherein the partial protocol definition comprises a mapping of an ordered set of actions to a partial tree comprising an incomplete path or incomplete set of paths that includes one or more identified dynamic nodes and that includes one or more identified static nodes, wherein the partial protocol definition is generated using a plurality of icons in a graphical user interface (GUI);
generating a complete protocol definition by an auto-completion of the partial protocol definition using a comparison of the partial protocol definition with the plurality of protocol definitions associated with the one or more master trees, at least some of the dynamic-node weights, and at least some of the static-node weights, wherein:
the comparison is performed by computing a score based on point values associated with nodes and/or a similarity score using a machine learning model to select a protocol definition of the plurality of protocol definitions to auto-complete the partial protocol definition;
determining, based on the ordered set of actions and the action-advancement condition associated with the complete protocol definition, a subset of dataset from the plurality of dataset to be transmitted to a computing device of the plurality of computing devices; and
transmitting the subset of dataset to the computing device.
|