US 12,265,916 B2
Communication generation in complex computing networks
Michael D. Bigby, Dallas, TX (US); Leonard A. Bucchino, III, Frisco, TX (US); Charles A. Hunt, Frisco, TX (US); Khusro Khalid, Frisco, TX (US); Rabik Maharjan, Dallas, TX (US); Gregory B. Molik, Plano, TX (US); Michael C. Munsie, Plano, TX (US); Timothy W. Proffitt, Carrolton, TX (US); and Bradley D. White, Plano, TX (US)
Assigned to Research Now Group, LLC, Shelton, CT (US)
Filed by Research Now Group, LLC, Shelton, CT (US)
Filed on Jan. 22, 2024, as Appl. No. 18/419,109.
Application 18/419,109 is a continuation of application No. 17/867,531, filed on Jul. 18, 2022, granted, now 11,880,774.
Application 17/867,531 is a continuation of application No. 16/792,863, filed on Feb. 17, 2020, granted, now 11,392,839, issued on Jul. 19, 2022.
Application 16/792,863 is a continuation of application No. 16/235,689, filed on Dec. 28, 2018, granted, now 10,565,506, issued on Feb. 18, 2020.
Application 16/235,689 is a continuation of application No. 15/097,851, filed on Apr. 13, 2016, granted, now 10,169,704, issued on Jan. 1, 2019.
Claims priority of provisional application 62/146,483, filed on Apr. 13, 2015.
Prior Publication US 2024/0265271 A1, Aug. 8, 2024
This patent is subject to a terminal disclaimer.
Int. Cl. G06N 5/02 (2023.01); H04L 45/00 (2022.01); H04L 9/40 (2022.01); H04L 67/52 (2022.01)
CPC G06N 5/02 (2013.01) [H04L 45/14 (2013.01); H04L 63/08 (2013.01); H04L 67/52 (2022.05)] 20 Claims
OG exemplary drawing
 
1. A method for communication generation, based on traversing routes of a graph data structure, in a computing network, the method comprising:
establishing a first connection to a first input data system;
receiving, from the first input data system, a first desired data attribute and a second desired data attribute;
establishing a second connection to a second input data system;
receiving, from the second input data system, first input data;
establishing a third connection to a third input data system or the second input data system;
accessing a graph data structure stored at the third input data system or the second input data system, the graph data structure comprising a plurality of data attributes and routes among at least some first data attributes in the plurality of data attributes;
executing, using one or more computing device processors, a first sensing operation to determine a first data attribute associated with the first input data;
determining, using the one or more computing device processors, the first data attribute is substantially or partially equivalent to the first desired data attribute;
executing, using the one or more computing device processors, a second sensing operation to determine whether the first input data has a second data attribute;
generating a first communication, wherein the first communication is based on an intermediary data attribute;
modifying, using the one or more computing device processors, a first route, wherein the first route connects, either directly or indirectly, the intermediary data attribute to the second data attribute in the graph data structure, thereby resulting in a modified first route;
in response to the modifying, using the one or more computing device processors, the first route, dynamically modifying, the first communication, thereby resulting in a modified first communication;
transmitting, using the one or more computing device processors, the modified first communication to a first computing device, based on the modified first route;
receiving, using the one or more computing device processors, a first response to the modified first communication, from the first computing device; and
determining, using the one or more computing device processors, and based on the first response, that the second data attribute is associated with the first input data.