US 11,768,673 B2Granted

Identifying protocol recommendations for application data objects

AssigneeOptum Technology, Inc.

InventorsSanjay K. Dwivedi, Kunal Pankaj, Kanishka Kartikeya, Hitesh Kharbanda

Life of this patent

Estimating the term…

Loading patent…

Abstract

Embodiments of the present disclosure provide methods, apparatus, systems, computing devices, computing entities, and/or the like for generating a protocol recommendation for an application data object. In accordance with one embodiment, a method is provided comprising: extracting application codes from the application data object representing application codes; generating a graph representation data object that includes code nodes representing the application codes, and edges connecting code nodes to indicate an association between the code nodes; identifying a replaceable code node; extracting substitute code nodes from the graph representation data object; identifying a replacement configuration of the graph representation data object with the replaceable code node with one of the substitute code nodes; and generating the protocol recommendation based at least in part on the replacement configuration.

Claims17

Dependent claims

A computer-implemented method comprising:

determining, by one or more processors, a plurality of application codes for an application data object;
determining, by the one or more processors, a graph representation data object that corresponds to the plurality of application codes, wherein the graph representation data object comprises:
(i) a plurality of code nodes in which each code node of the plurality of code nodes represents an application code of the plurality of application codes, and (ii) a plurality of edges in which each edge of the plurality of edges connects two code nodes of the plurality of code nodes to indicate an association between the two code nodes;
identifying, by the one or more processors, a replaceable code node of the plurality of code nodes, wherein identifying the replaceable code node comprises:
generating an augmented relative importance value for each particular code node of the plurality of code nodes based at least in part on a synthesized edge weight for each edge of the plurality of edges connected to the particular code node, and
identifying the replaceable code node based at least in part on a subset of the plurality of code nodes, where the augmented relative importance value for the replaceable code node in the subset satisfies a contribution threshold;
and
responsive to identifying the replaceable code node:
determining, by the one or more processors, one or more substitute code nodes of the plurality of code nodes from the graph representation data object, wherein each substitute code node of the one or more of substitute code nodes represents a substitute application code one of the plurality of application codes represented by the replaceable code node,
determining, by the one or more processors, a replacement configuration of the graph representation data object, wherein the replacement configuration is characterized by a target substitute code node of the one or more substitute code nodes, and
generating, by the one or more processors, a protocol recommendation for the application data object based at least in part on the replacement configuration.

8 more elements

An apparatus comprising one or more processors and at least one memory including program code, the at least one memory and the program code configured to, with the one or more processors, cause the apparatus to at least:

determine a plurality of application codes for an application data object;
determine a graph representation data object that corresponds to the plurality of application codes, wherein the graph representation data object comprises:
(i) a plurality of code nodes in which each code node of the plurality of code nodes represents an application code of the plurality of application codes, and (ii) a plurality of edges in which each edge of the plurality of edges connects two code nodes of the plurality of code nodes to indicate an association between the two code nodes;
identify a replaceable code node of the plurality of code nodes, wherein identifying the replaceable code node comprises:
generating an augmented relative importance value for each particular code node of the plurality of code nodes based at least in part on a synthesized edge weight for each edge of the plurality of edges connected to the particular code node, and
identifying the replaceable code node based at least in part on a subset of the plurality of code nodes, where the augmented relative importance value for the replaceable code node in the subset satisfies a contribution threshold;
and
responsive to identifying the replaceable code node:
determine one or more substitute code nodes of the plurality of code nodes from the graph representation data object, wherein each substitute code node of the one or more of substitute code nodes represents a substitute application code one of the plurality of application codes represented by the replaceable code node,
determine a replacement configuration of the graph representation data object, wherein the replacement configuration is characterized by a target substitute code node of the one or more substitute code nodes, and
generate a protocol recommendation for the application data object based at least in part on the replacement configuration.

8 more elements

A non-transitory computer storage medium comprising instructions configured to cause one or more processors to at least perform operations configured to:

determine a plurality of application codes for an application data object;
determine a graph representation data object that corresponds to the plurality of application codes, wherein the graph representation data object comprises:
(i) a plurality of code nodes in which each code node of the plurality of code nodes represents an application code of the plurality of application codes, and (ii) a plurality of edges in which each edge of the plurality of edges connects two code nodes of the plurality of code nodes to indicate an association between the two code nodes;
identify a replaceable code node of the plurality of code nodes, wherein identifying the replaceable code node comprises:
generating an augmented relative importance value for each particular code node of the plurality of code nodes based at least in part on a synthesized edge weight for each edge of the plurality of edges connected to the particular code node, and
identifying the replaceable code node based at least in part on a subset of the plurality of code nodes, where the augmented relative importance value for the replaceable code node in the subset satisfies a contribution threshold;
and
responsive to identifying the replaceable code node:
determine one or more substitute code nodes of the plurality of code nodes from the graph representation data object, wherein each substitute code node of the one or more of substitute code nodes represents a substitute application code one of the plurality of application codes represented by the replaceable code node,
determine a replacement configuration of the graph representation data object, wherein the replacement configuration is characterized by a target substitute code node of the one or more substitute code nodes, and
generate a protocol recommendation for the application data object based at least in part on the replacement configuration.

8 more elements

Dependencies are inferred from the claim text.

Facts

Application: 17/355,852Filed 23 Jun 2021
Published: US 2022/0413826 A129 Dec 2022
Granted: 26 Sep 2023
Term ends: Not estimatedThe source records don’t support an estimate.

Classification6 codes

G06F 8/65
Software deployment: updates
G06N 5/02
Computing arrangements using knowledge-based models: knowledge representation; Symbolic representation
G06F 8/30
Arrangements for software engineering: creation or generation of source code
G06N 5/04
Computing arrangements using knowledge-based models: inference or reasoning models